新科学想法 › 学术文库 › 学术文献 › 浏览文献

Constraint-based Verification of Client-Server Protocols

热1 twinsen 添加于 2009-12-18 18:22 | 1961 次阅读 | 0 个评论

作者
Delzanno G, Bultan T
摘要
We show that existing constraint manipulation technology incorporated in the paradigm of symbolic model checking with rich assertional languages , can be successfully applied to the verification of client-server protocols with a finite but unbounded number of clients. Abstract interpretation is the mathematical bridge between protocol specifications and the constraint-based verification method on heterogeneous data used in the Action Language Verifier, a model checker for CTL . The method we propose is incomplete but fully automatic and sound for safety and liveness properties. Sufficient conditions for termination of the resulting procedures can be derived by using the theory of . As a case-study, we apply the method to check safety and liveness properties for a formal model of Steve German's directorybased consistency protocol .
详细资料
- 文献种类: Conference Article
- 期刊名称: In Proceedings of the 7th International Conference on Principles and Practice of Constraint Programming
- 期卷页: 2001年 286页
- 出版社: Springer-Verlag
学科领域信息系统 » 计算机科学
标签

Constraint Logic Programming Model Checking
相关链接 URL
附件
Constraint-based Verification of Client-Server Protocols