Assumption/guarantee specifications in linear-time temporal logic

Theoretical Computer Science

Volumn 167, Issue 1-2, 1996, Pages 47-72

  Jonsson, Bengt ^a   Tsay, Yih Kuen ^a  

^a NONE

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER SCIENCE; COMPUTER SOFTWARE; COMPUTER SYSTEMS; MATHEMATICAL TECHNIQUES;

ASSUMPTION/GUARANTEE SPECIFICATIONS; SYNTACTIC FORMULATION;

FORMAL LOGIC;

EID: 0030260192     PISSN: 03043975     EISSN: None     Source Type: Journal    
DOI: 10.1016/0304-3975(96)00069-2     Document Type: Article

References (17)

1. M. Abadi and L. Lamport, The existence of refinement mappings, Theoret. Comput. Sci. 82 (1991) 253-284.
2. M. Abadi and L. Lamport, Composing specifications, ACM Trans. on Programming Languages Systems 15 (1993) 73-132.
3. M. Abadi and L. Lamport, Conjoining specifications, Tech. Report 118, SRC DEC, 1993. Part of the paper appears in ACM PODC '94 under the title "Open Systems in TLA".
4. M. Abadi and G.D. Plotkin, A logical view of composition, Theoret. Comput. Sci. 114 (1993) 3-30.
5. B. Alpern and F.B. Schneider, Defining liveness, Inform. Process. Lett. 24 (1985) 181-185.
6. 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, eds., Seminar on Concurrency, Lecture Notes in Computer Science, Vol. 197 (Springer, Berlin, 1984) 35-61.
7. P. Collette, Application of the composition principle to Unity-like specifications, in: TAPSOFT '93: Theory and Practice of Software Development, Lecture Notes in Computer Science, Vol. 668, (Springer, Berlin, 1993) 230-242.
8. P. Collette, Design of compositional proof systems based on assumption-guarantee specifications -application to UNITY, Ph.D. Thesis, Université Catholique de Louvain, June 1994.
9. P. Grønning, T.Q. Nielsen and H.H. Løvengreen, Refinement and composition of transition-based rely-guarantee specifications with auxiliary variables, in: K.V. Nori and C.E. Veni Madhavan, eds., Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 472, (Springer, Berlin, 1991) 332-348.
10. C.B. Jones, Tentative steps towards a development method for interfering programs, ACM Trans. Programming Languages Systems 5 (1983) 596-619.
11. L. Lamport, What good is temporal logic? in: R.E.A. Mason, ed., Information Processing, Vol. 83, IFIP, (North-Holland, Amsterdam, 1983) 657-668.
12. L. Lamport, The temporal logic of actions, ACM Trans. Programming Languages Systems 16 (1994) 872-923.
13. Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification (Springer, Berlin, 1992).
14. J. Misra and K.M. Chandy, Proofs of networks of processes, IEEE Trans. Software Eng. 7 (1981) 417-426.
15. A. Pnueli, The temporal semantics of concurrent programs, Theoret. Comput. Sci. 13 (1982) 45-60.
16. A. Pnueli, System specification and refinement in temporal logic, in: R.K. Shyamasundar, ed., Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science, Vol. 652 (Springer, Berlin, 1992) 1-38.
17. Q. Xu, A. Cau and P. Collette, On unifying assumption-commitment style proof rules for concurrency, in: B. Jonsson and J. Parrow, ed., CONCUR '94: Concurrency Theory, Lecture Notes in Computer Science, Vol. 836 (Springer, Berlin, 1994) 267-282.