ABSTRACT
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.
- N. Amla, E. A. Emerson, and K. S. Namjoshi. Efficient decompositional model-checking for regular timing diagrams. In Correct Hardware Design and Verification Methods, volume 1703 of LNCS, pages 67--81, 1999.]] Google ScholarDigital Library
- G. Bond, F. IvanciĆ, N. Klarlund, and R. Trefler. ECLIPSE feature logic analysis. IP-Telephony Workshop, pages 49--56, 2001.]]Google Scholar
- D. Brand and P. Zafiropulo. On communicating finite-state machines. J. ACM, 30(2):323--342, 1983.]] Google ScholarDigital Library
- J. Burch, E. Clarke, and D. Long. Symbolic model checking with partitioned transition relations. In International Conference on Very Large Scale Integration (VLSI), pages 49--58. IFIP Trans., North-Holland, 1991.]]Google Scholar
- X. Fu, T. Bultan, and J. Su. Conversation protocols: A formalism for specification and verification of reactive electronic services. In Int'l Conf. on Impl. and Application of Automata, number 2759 in LNCS, pages 188--200. Springer, 2003.]]Google ScholarCross Ref
- M. J. C. Gordon and T. F. Melham. Introduction to HOL. Cambridge University Press, 1993.]]Google ScholarDigital Library
- O. Grumberg and D. E. Long. Model checking and modular verification. ACM Trans. on Prog. Lang. and Sys., 16(3):843--871, 1994.]] Google ScholarDigital Library
- T. Henzinger, S. Qadeer, and S. Rajamani. You assume, we guarantee: Methodology and case studies. In Computer-Aided Verification, volume 1427 of LNCS, pages 440--451. Springer-Verlag, 1998.]] Google ScholarDigital Library
- G. J. Holzmann. The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, 2003.]]Google ScholarDigital Library
- M. Jackson and P. Zave. Distributed feature composition: A virtual architecture for telecommunications services. IEEE Trans. on Soft. Eng., 24(10):831--847, Aug. 1998.]] Google ScholarDigital Library
- M. Jackson and P. Zave. The DFC Manual. AT&T Labs, Nov. 2003.]]Google Scholar
- A. L. Juarez Dominguez. Verification of DFC call protocol correctness criteria. Master's thesis, School of Computer Science, University of Waterloo. May, 2005.]]Google Scholar
- K.Bhargavan, D. Obradovic, and C. A. Gunter. Formal verification of standards for distance vector routing protocols. Jour. of the ACM, 49(4):538--576, Jul. 2002.]] Google ScholarDigital Library
- K. L. McMillan. Verification of infinite state systems by compositional model checking. In Correct Hardware Design and Verification Methods, number 1703 in LNCS, pages 219--233. Springer, 1999.]] Google ScholarDigital Library
- A. Pnueli. In transition from global to modular temporal reasoning about programs. In Logic and models of concurrent systems, pages 123--144. Springer, 1985.]] Google ScholarDigital Library
- A. Vardhan, K. Sen, M. Viswanathan, and G. Agha. Learning to verify safety properties. In International Conference on Formal Engineering Methods, volume 3308 of LNCS, pages 274--289. Springer, 2004.]]Google ScholarCross Ref
- P. Zave. Formal description of telecommunication services in Promela and Z. In 19th International NATO Summer School: Calculational System Design, pages 395--420, 1999.]]Google Scholar
Index Terms
- Compositional reasoning for port-based distributed systems
Recommendations
Automated interface refinement for compositional verification
Compositional verification is essential for verifying large systems. However, approximate environments are needed when verifying the constituent modules in a system. Effective compositional verification requires finding a simple but accurate ...
Modeling and Verification of Reactive Systems using Rebeca
Actor-based modeling has been successfully applied to the representation of concurrent and distributed systems. Besides having an appropriate and efficient way for modeling these systems, one needs a formal verification approach for ensuring their ...
Compositional reachability analysis for efficient modular verification of asynchronous designs
Compositional verification is essential to address state explosion in model checking. Traditionally, an over-approximate context is needed for each individual component in a system for sound verification. This may cause state explosion for the ...
Comments