skip to main content
10.1145/1101908.1101974acmconferencesArticle/Chapter ViewAbstractPublication PagesaseConference Proceedingsconference-collections
Article

Compositional reasoning for port-based distributed systems

Published:07 November 2005Publication History

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.

References

  1. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  2. G. Bond, F. IvanciĆ, N. Klarlund, and R. Trefler. ECLIPSE feature logic analysis. IP-Telephony Workshop, pages 49--56, 2001.]]Google ScholarGoogle Scholar
  3. D. Brand and P. Zafiropulo. On communicating finite-state machines. J. ACM, 30(2):323--342, 1983.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  4. 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 ScholarGoogle Scholar
  5. 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 ScholarGoogle ScholarCross RefCross Ref
  6. M. J. C. Gordon and T. F. Melham. Introduction to HOL. Cambridge University Press, 1993.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  7. O. Grumberg and D. E. Long. Model checking and modular verification. ACM Trans. on Prog. Lang. and Sys., 16(3):843--871, 1994.]] Google ScholarGoogle ScholarDigital LibraryDigital Library
  8. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  9. G. J. Holzmann. The Spin Model Checker: Primer and Reference Manual. Addison-Wesley, 2003.]]Google ScholarGoogle ScholarDigital LibraryDigital Library
  10. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  11. M. Jackson and P. Zave. The DFC Manual. AT&T Labs, Nov. 2003.]]Google ScholarGoogle Scholar
  12. A. L. Juarez Dominguez. Verification of DFC call protocol correctness criteria. Master's thesis, School of Computer Science, University of Waterloo. May, 2005.]]Google ScholarGoogle Scholar
  13. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  14. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  15. 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 ScholarGoogle ScholarDigital LibraryDigital Library
  16. 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 ScholarGoogle ScholarCross RefCross Ref
  17. 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 ScholarGoogle Scholar

Index Terms

  1. Compositional reasoning for port-based distributed systems

      Recommendations

      Comments

      Login options

      Check if you have access through your login credentials or your institution to get full access on this article.

      Sign in
      • Published in

        cover image ACM Conferences
        ASE '05: Proceedings of the 20th IEEE/ACM International Conference on Automated Software Engineering
        November 2005
        482 pages
        ISBN:1581139934
        DOI:10.1145/1101908

        Copyright © 2005 ACM

        Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

        Publisher

        Association for Computing Machinery

        New York, NY, United States

        Publication History

        • Published: 7 November 2005

        Permissions

        Request permissions about this article.

        Request Permissions

        Check for updates

        Qualifiers

        • Article

        Acceptance Rates

        Overall Acceptance Rate82of337submissions,24%

        Upcoming Conference

      PDF Format

      View or Download as a PDF file.

      PDF

      eReader

      View online with eReader.

      eReader