Skip to main content
SpringerLink
Log in

Composing Temporal-Logic Specifications with Machine Assistance

  • Conference paper
  • First Online:
FME 2003: Formal Methods (FME 2003)

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

Included in the following conference series:

  • 641 Accesses

Abstract

This paper presents an adaptation of a compositional verification framework based on linear-time temporal logic and its mechanization in PVS. We suggest an approach to avoiding the inconvenience of handling quantification over flexible variables in a general-purpose theorem prover. The use of the mechanized framework is illustrated by proving the mutual exclusion property of a token ring in a compositional manner.

This work was supported in part by the National Science Council, Taiwan (R.O.C.) under grants NSC 87-2213-E-002-015 and NSC 88-2213-E-002-064 and by Center for Information and Electronics Technologies (CIET), National Taiwan University.

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 EPUB and 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

References

  1. Clarke, E., Long, D., McMillan, K.: Compositional model checking. In: Proceedings of the 4th IEEE Symposium on Logic in Computer Science, pp. 353–362 (1989)

    Google Scholar 

  2. Kurshan, R., Lamport, L.: Verification of a multiplier: 64 bits and beyond. In: Courcoubetis, C. (ed.) CAV 1993. LNCS, vol. 697, pp. 166–179. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  3. Szyperski, C.: Component Software: Beyond Object-Oriented Programming. Addison-Wesley, Reading (1998)

    Google Scholar 

  4. Pnueli, A.: The temporal semantics of concurrent programs. Theoretical Computer Science 13, 45–60 (1982)

    Article  MathSciNet  Google Scholar 

  5. Lamport, L.: The temporal logic of actions. ACM Transactions on Programming Languages and Systems 16, 872–923 (1994)

    Article  Google Scholar 

  6. Manna, Z., Pnueli, A.: Temporal Verification of Reactive Systems: Safety. Springer, Heidelberg (1995)

    Book  Google Scholar 

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

    Article  Google Scholar 

  8. Jonsson, B., Tsay, Y.K.: Assumption/guarantee specifications in linear-time temporal logic. Theoretical Computer Science 167, 47–72 (1996); An extended abstract appeared earlier in Mosses, P.D., Schwartzbach, M.I., Nielsen, M. (eds.): CAAP 1995, FASE 1995, and TAPSOFT 1995. LNCS, vol. 915. Springer, Heidelberg (1995)

    Google Scholar 

  9. Hoare, C.: An axiomatic basis for computer programs. Communications of the ACM 12, 576–580 (1969)

    Article  Google Scholar 

  10. Misra, J., Chandy, K.: Proofs of networks of processes. IEEE Transactions on Software Engineering 7, 417–426 (1981)

    Article  MathSciNet  Google Scholar 

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

    Article  Google Scholar 

  12. Lamport, L.: Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems 5, 190–222 (1983)

    Article  Google Scholar 

  13. Tsay, Y.K.: Compositional verification in linear-time temporal logic. In: Tiuryn, J. (ed.) FOSSACS 2000. LNCS, vol. 1784, pp. 344–358. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  14. Manna, Z., Pnueli, A.: The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer, Heidelberg (1992)

    Book  Google Scholar 

  15. Crow, J., Owre, S., Rushby, J., Shankar, N., Srivas, M.: A tutorial introduction to PVS. Technical report, Computer Science Laboratory, SRI International, Menlo Park, CA (1995)

    Google Scholar 

  16. Barringer, H., Kuiper, R.: Hierarchical development of concurrent systems in a temporal logic framework. In: Brookes, S.D., Winskel, G., Roscoe, A.W. (eds.) Seminar on Concurrency. LNCS, vol. 197, pp. 35–61. Springer, Heidelberg (1984)

    Chapter  Google Scholar 

  17. Grønning, P., Nielsen, T., Løvengreen, H.: Refinement and composition of transition-based rely-guarantee specifications with auxiliary variables. In: Veni Madhavan, C.E., Nori, K.V. (eds.) FSTTCS 1990. LNCS, vol. 472, pp. 332–348. Springer, Heidelberg (1991)

    Chapter  Google Scholar 

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

    Article  Google Scholar 

  19. Abadi, M., Plotkin, G.: A logical view of composition. Theoretical Computer Science 114, 3–30 (1993)

    Article  MathSciNet  Google Scholar 

  20. Collette, P.: Application of the composition principle to Unity-like specifications. In: Gaudel, M.-C., Jouannaud, J.-P. (eds.) CAAP 1993, FASE 1993, and TAPSOFT 1993. LNCS, vol. 668, pp. 230–242. Springer, Heidelberg (1993)

    Chapter  Google Scholar 

  21. Collette, P.: Design of Compositional Proof Systems Based on Assumption- Guarantee Specifications — Application to UNITY. PhD thesis, Université Catholique de Louvain (1994)

    Google Scholar 

  22. Xu, Q., Cau, A., Collette, P.: On unifying assumption-commitment style proof rules for concurrency. In: Jonsson, B., Parrow, J. (eds.) CONCUR 1994. LNCS, vol. 836, pp. 267–282. Springer, Heidelberg (1994)

    Google Scholar 

  23. Heckman, M., Zhang, C., Becker, B., Peticolas, D., Levitt, K., Olsson, R.: Towards applying the composition principle to verify a microkernel operating system. In: von Wright, J., Harrison, J., Grundy, J. (eds.) TPHOLs 1996. LNCS, vol. 1125, pp. 235–250. Springer, Heidelberg (1996)

    Chapter  Google Scholar 

  24. Engberg, U., Grønning, P., Lamport, L.: Mechanical verification of concurrent systems with TLA. In: Probst, D.K., von Bochmann, G. (eds.) CAV 1992. LNCS, vol. 663, pp. 44–55. Springer, Heidelberg (1992)

    Chapter  Google Scholar 

  25. Har’El, Z., Kurshan, R.: Software for analytical development of communication protocols. AT&T Technical Journal 69, 45–59 (1990)

    Article  Google Scholar 

  26. Shankar, N.: Lazy compositional verification. In: de Roever, W.-P., Langmaack, H., Pnueli, A. (eds.) COMPOS 1997. LNCS, vol. 1536, pp. 541–564. Springer, Heidelberg (1998)

    Chapter  Google Scholar 

  27. Shankar, N.: Machine-assisted verification using theorem proving and model checking. Computer and Systems Science 158, 499–528 (1997)

    MATH  Google Scholar 

  28. Andersen, F., Petersen, K., Petterson, J.: Program verification using HOL-UNITY. In: Joyce, J.J., Seger, C.-J.H. (eds.) HUG 1993. LNCS, vol. 780, pp. 1–16. Springer, Heidelberg (1994)

    Chapter  Google Scholar 

  29. Chandy, K., Misra, J.: Parallel Program Design: A Foundation. Addison-Wesley, Reading (1988)

    MATH  Google Scholar 

  30. Gordon, M.: HOL: A proof generating system for higher-order logic. In: Birtwistle, G., Subrahmanyam, P. (eds.) VLSI Specification, Verification and Synthesis, pp. 73–128. Kluwer, Dordrecht (1988)

    Chapter  Google Scholar 

  31. Långbacka, T.: A HOL formalization of the temporal logic of actions. In: Higher Order Logic Theorem Proving System and Its Applications, 7th International Workshop (1994)

    Google Scholar 

  32. Kellomäki, P.: Verification of reactive systems using DisCo and PVS. In: Fitzgerald, J.S., Jones, C.B., Lucas, P. (eds.) FME 1997. LNCS, vol. 1313, pp. 589–604. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Information Science, Academia Sinica, Taipei, Taiwan

    Jei-Wen Teng

  2. Dept. of Information Management, National Taiwan University, Taipei, Taiwan

    Yih-Kuen Tsay

Authors
  1. Jei-Wen Teng
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Yih-Kuen Tsay
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Department of Computer Science and Communication Engineering, Graduate School of Information Science and Electrical Engineering, Kyushu University, 6-10-1-Hakozaki, Higashi-ku, 812-8581, Fukuoka, Japan

    Keijiro Araki

  2. Istituto di Scienza e Tecnologie dell’Informazione “A. Faedo”, ISTI - CNR, Pisa, Italy

    Stefania Gnesi

  3. Dipartimento di Elettronica e Informazione, Politecnico di Milano, Italy

    Dino Mandrioli

Rights and permissions

Reprints and permissions

Copyright information

© 2003 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Teng, JW., Tsay, YK. (2003). Composing Temporal-Logic Specifications with Machine Assistance. In: Araki, K., Gnesi, S., Mandrioli, D. (eds) FME 2003: Formal Methods. FME 2003. Lecture Notes in Computer Science, vol 2805. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-45236-2_39

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-45236-2_39

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-40828-4

  • Online ISBN: 978-3-540-45236-2

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation