Skip to main content
SpringerLink
Log in

Compositional Reasoning Using the Assumption-Commitment Paradigm

  • Conference paper
  • First Online:
Compositionality: The Significant Difference (COMPOS 1997)

Part of the book series: Lecture Notes in Computer Science ((LNCS,volume 1536))

Included in the following conference series:

Abstract

Assumption-Commitment paradigms have been investigated to derive tractable rules for composing specifications of concurrent systems. We first give a short survey of several typical composition rules, and then we adopt the principle to reason about real time systems. An extension of Duration Calculus capable of describing infinite behaviours and instantaneous actions is proposed. In the calculus, verification techniques based on assumption-commitment are incorporated.

On leave from The Institute of Mathematical Sciences, C. I. T. campus, Chennai 600 113, India.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. M. Abadi and L. Lamport. An old-fashioned recipe for real time. In J.W. de Bakker, C. Huizing, W.-P. de Roever, and G. Rozenberg, editors, Proc. of REX Workshop on Real-Time: Theory and Practice, LNCS 600, pages 1–27, Mook, The Netherlands, 1992. Springer-Verlag.

    Chapter  Google Scholar 

  2. M. Abadi and L. Lamport. Composing specifications. ACM Transactions on Programming Languages and Systems, 15:73–132, 1993.

    Article  Google Scholar 

  3. M. Abadi and L. Lamport. Conjoining specifications. ACM Transactions on Programming Languages and Systems, 17(3):507–534, 1995.

    Article  Google Scholar 

  4. H. Barringer and R. Kuiper. Hierarchical development of concurrent systems in a temporal logic framework. In S.D. Brookes, A.W. Roscoe, and G. Winskel, editors, Proc. of Seminar on Concurrency, LNCS 197. Springer-Verlag, 1985.

    Google Scholar 

  5. Zhou Chaochen, C.A.R. Hoare, and A.P. Ravn. A calculus of durations. Information Processing Letters, 40(5):269–276, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  6. Zhou Chaochen, Dang Van Hung, and Li Xiaoshan. A duration calculus with infinite intervals. In Fundamentals of Computation Theory, Horst Reichel (Ed.), pages 16–41. LNCS 965, Springer-Verlag, 1995.

    Google Scholar 

  7. Zhou Chaochen, A.P. Ravn, and M.R. Hansen. An extended duration calculus for hybrid systems. In Hybrid Systems, R.L. Grossman, A. Nerode, A.P. Ravn, H. Rischel (Eds.), pages 36–59. LNCS 736, Springer-Verlag, 1993.

    Google Scholar 

  8. P. Collette. Application of the composition principle to Unity-like specifications. In M.-C. Gaudel and J.-P. Jouannaud, editors, Proc. TAPSOFT 93, LNCS 668. Springer-Verlag, 1993.

    Google Scholar 

  9. P. Collette and A. Cau. Parallel composition of assumption-commitment specifications: a unifying approach for shared variable and distributed message passing concurrency. Acta Informatica, 1995.

    Google Scholar 

  10. W.-P. de Roever. The quest for compositionality. In Proc. Of IFIP Working Conf., The Role of Abstract Models in Computer Science. Elsevier Science B.V. (North-Holland), 1985.

    Google Scholar 

  11. J. Hooman. Specification and Compositional Verification of Real-Time Systems, LNCS 558. Springer-Verlag, 1991.

    MATH  Google Scholar 

  12. C.B. Jones. Tentative steps towards a development method for interfering programs. ACM Transactions on Programming Languages and Systems, 5(4):596–619, October 1983.

    Google Scholar 

  13. C.B. Jones. Accommodating interference in the formal design of concurrent objectbased programs. Formal Methods in System Design, 8(2):105–121, October 1996.

    Google Scholar 

  14. B. Jonsson. Compositional specification and verification of distributed systems. ACM Transactions on Programming Languages and Systems, 16(2):259–303, March 1994.

    Google Scholar 

  15. B. Jonsson and Y.-K. Tsay. Reasoning about assumption/guarantee specifications in linear-time temporal logic. In P.D. Mosses, M. Nielsen, and M.I. Schwartzbach, editors, Proc. TAPSOFT 95, LNCS 915. Springer-Verlag, 1995.

    Google Scholar 

  16. R. Koymans. Specifying Message Passing and Time-Critical Systems with Temporal Logic. LNCS 651, Springer-Verlag, 1992.

    MATH  Google Scholar 

  17. Z. Liu, A.P. Ravn, and X.-S. Li. Verifying duration properties of timed transition systems. In Proc. IFIP Working Conference PROCOMET’98. Chapman & Hall, 1998.

    Google Scholar 

  18. J. Misra and M. Chandy. Proofs of networks of processes. IEEE SE, 7(4):417–426, 1981.

    MathSciNet  Google Scholar 

  19. B. Moszkowski. A temporal logic for multilevel reasoning about hardware. IEEE Computer, 18(2):10–19, 1985.

    Google Scholar 

  20. B. Moszkowski. Some very compositional temporal properties. In E.-R. Olderog, editor, Programming Concepts, Methods and Calculi, pages 307–326. Elsevier Science B.V. (North-Holland), 1994.

    Google Scholar 

  21. B. Moszkowski. Compositional reasoning about projected and infinite time. In Proc. the First IEEE International Conference on Engineering of Complex Computer Systems (ICECCS’95), pages 238–245. IEEE Computer Society Press, 1995.

    Google Scholar 

  22. P.K. Pandya and Dang Van Hung. Duration calculus with weakly monotonic time. Technical Report Detfors 6, UNU/IIST, P.O. Box 3058 Macau, 1996.

    Google Scholar 

  23. P.K. Pandya and M. Joseph. P-A logic-a compositional proof system for distributed programs. Distributed Computing, 5:37–54, 1991.

    Article  MATH  MathSciNet  Google Scholar 

  24. A. Pnueli. In transition from global to modular temporal reasoning about programs. In K.R. Apt, editor, Logic amd Models of Concurrent Systems, NATO ASI Series, pages 123–144. Springer-Verlag, 1984.

    Google Scholar 

  25. G. Schneider and Q.-W. Xu. Formalising semantics of hardware description language Verilog in duration calculus. Technical report, UNU/IIST Technical Report draft, P.O. Box 3058 Macau, 1998.

    Google Scholar 

  26. N. Shankar. Lazy compositional verification. In this volume, 1998.

    Google Scholar 

  27. C. Stirling. A generalization of Owicki-Griesś Hoare logic for a concurrent while language. Theoretical Computer Science, 58:347–359, 1988.

    Article  MATH  MathSciNet  Google Scholar 

  28. K. Stølen. A method for the development of totally correct shared-state parallel programs. In J.C.M. Baeten and J.F. Groote, editors, Proc. 2nd International Conference on Concurrency Theory (CONCUR’91), LNCS 527, Armsterdam, The Netherlands, 1991. Springer-Verlag.

    Google Scholar 

  29. H.-P. Wang and Q.-W. Xu. Infinite duration calculus with fixed-point operators. Technical Report draft, UNU/IIST, P.O.Box 3058, Macau, September 1997.

    Google Scholar 

  30. Q.-W. Xu, A. Cau, and P. Collette. On unifying assumption-commitment style proof rules for concurrency. In B. Jonsson and J. Parrow, editors, Proc. 5th International Conference on Concurrency Theory (CONCUR’94), LNCS 836, pages 267–282, Uppsala, Sweden, August 1994. Springer-Verlag.

    Google Scholar 

  31. Q.-W. Xu, W.-P. de Roever, and J.-F. He. The rely-guarantee method for verifying shared variable concurrent programs. Formal Aspects of Computing, 9(2):149–174, 1997.

    Article  MATH  Google Scholar 

  32. J. Zwiers. Compositionality, Concurrency and Partial Correctness, LNCS 321. Springer-Verlag, 1989.

    MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. International Institute for Software Technology, United Nations University, P.O. Box 3058, Macau

    Qiwen Xu & Mohalik Swarup

Authors
  1. Qiwen Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Mohalik Swarup
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Informatics and Applied Mathematics, Christian Albrechts University at Kiel, Preußerstr. 1-9, D-24105, Kiel, Germany

    Willem-Paul de Roever  & Hans Langmaack  & 

  2. Department of Applied Mathematics and Computer Science, Weizmann Institute of Science, P.O. Box 26, Rehovot, 76100, Israel

    Amir Pnueli

Rights and permissions

Reprints and permissions

Copyright information

© 1998 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Xu, Q., Swarup, M. (1998). Compositional Reasoning Using the Assumption-Commitment Paradigm. In: de Roever, WP., Langmaack, H., Pnueli, A. (eds) Compositionality: The Significant Difference. COMPOS 1997. Lecture Notes in Computer Science, vol 1536. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-49213-5_22

Download citation

  • DOI: https://doi.org/10.1007/3-540-49213-5_22

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-65493-3

  • Online ISBN: 978-3-540-49213-9

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation