In transition from global to modular temporal reasoning about programs
Logics and models of concurrent systems
Model checking and modular verification
ACM Transactions on Programming Languages and Systems (TOPLAS)
Distributed Feature Composition: A Virtual Architecture for Telecommunications Services
IEEE Transactions on Software Engineering
On Communicating Finite-State Machines
Journal of the ACM (JACM)
Formal verification of standards for distance vector routing protocols
Journal of the ACM (JACM)
You Assume, We Guarantee: Methodology and Case Studies
CAV '98 Proceedings of the 10th International Conference on Computer Aided Verification
Spin model checker, the: primer and reference manual
Spin model checker, the: primer and reference manual
CIAA'03 Proceedings of the 8th international conference on Implementation and application of automata
Towards compositional synthesis of evolving systems
Proceedings of the 16th ACM SIGSOFT International Symposium on Foundations of software engineering
Composition and compositionality in a component model for autonomous robots
SC'10 Proceedings of the 9th international conference on Software composition
Journal of Systems and Software
Hi-index | 0.00 |
Many distributed systems using IP-based communication protocols consist of chains of components that run concurrently and communicate asynchronously with their neighbours through ports. We present a compositional reasoning method using model checking and theorem proving to verify liveness properties of a communication protocol for chains of connections consisting of an unknown number of components. We outline how our method is used to verify properties of the call protocol of AT&T's Distributed Feature Composition (DFC) architecture.