On the completeness of compositional reasoning

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 1855, Issue , 2000, Pages 139-153

  Namjoshi, Kedar S ^a   Trefler, Richard J ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b AT AND T LABS RESEARCH   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

MODEL CHECKING;

COMPOSITIONAL REASONING; CONCURRENT SYSTEMS; NON-CIRCULAR; PROOF RULES; SOUND AND COMPLETE;

COMPUTER AIDED ANALYSIS;

EID: 84944386630     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/10722167_14     Document Type: Conference Paper

References (33)

1. R. Alur and T. Henzinger. Reactive modules. In IEEE LICS, 1996.
2. M. Abadi and L. Lamport. Conjoining specifications. ACM Trans. on Programming Languages and Systems (TOPLAS), May 1995.
3. E. M. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Workshop on Logics of Programs, volume 131 of LNCS. Springer-Verlag, 1981.
4. E. M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic. ACM Transactions on Programming Languages and Systems (TOPLAS), 8(2), 1986.
5. E. M. Clarke, D.E. Long, and K.L. McMillan. Compositional model checking. In IEEE LICS, 1989.
6. K. M. Chandy and J. Misra. Proofs of networks of processes. IEEE Transactions on Software Engineering, 7(4), 1981.
7. W-P. de Roever, F. de Boer, U. Hannemann, J. Hooman, Y. Lakhnech, M. Poel, and J. Zwiers. Concurrency Verification: Introduction to Compositional and Noncompositional Proof Methods. Draft book, 1999.
8. W-P. de Roever, H. Langmaack, and A. Pnueli, editors. Compositionality: The Significant Difference, volume 1536 of LNCS. Springer-Verlag, 1997.
9. O. Grümberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems (TOPLAS), 1994.
10. C. A. R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 1969.
11. D. Harel and A. Pnueli. On the development of reactive systems. In K. Apt, editor, Logics and Models of Concurrent Systems, volume F-13 of NATO Advanced Summer Institutes, pages 477-498. Springer-Verlag, 1985.
12. T.A. Henzinger, S. Qadeer, S.K. Rajamani, and S. Tasiran. An assumeguarantee rule for checking simulation. In FMCAD, volume 1522 of LNCS, 1998.
13. C.B. Jones. Development methods for computer programs including a notion of interference. PhD thesis, Oxford University, 1981.
14. B. Josko. Model checking of CTL formulae under liveness assumptions. In ICALP, volume 267 of LNCS, 1987.
15. R.P. Kurshan. Reducibility in analysis of coordination. In Discrete Event Systems: Models and Applications, volume 103 of LNCIS, 1987.
16. O. Kupferman and M. Vardi. On the complexity of branching modular model checking. In CONCUR, volume 962 of LNCS, 1995.
17. O. Kupferman and M. Vardi. Module checking revisited. In CAV, volume 1254 of LNCS, 1997.
18. O. Lichtenstein, A. Pnueli, and L. Zuck. The glory of the past. In Proc. of the Conf. on Logics of Programs, 1985.
19. K.L. McMillan. A compositional rule for hardware design refinement. In CAV, volume 1254 of LNCS, 1997.
20. K. L. McMillan. Verification of an implementation of Tomasulo's algorithm by compositional model checking. In CAV, volume 1427 of LNCS, 1998.
21. K. L. McMillan. Circular compositional reasoning about liveness. In CHARME, volume 1703 of LNCS, 1999.
22. Z. Manna and A. Pnueli. Adequate proof principles for invariance and liveness properties of concurrent programs. Science of Computer Programming, 1984.
23. Z. Manna and A. Pnueli. Temporal Verification of Reactive Systems: Safety. Springer-Verlag, 1995.
24. P. Pandya. Compositional Verification of Distributed Programs. PhD thesis, University of Bombay, 1988.
25. P. Pandya and M. Joseph. P-A logic - a compositional proof system for distributed programs. Distributed Computing, 1991.
26. A. Pnueli. The temporal logic of programs. In FOCS, 1977.
27. A. Pnueli. In transition from global to modular reasoning about programs. In Logics and Models of Concurrent Systems, NATO ASI Series, 1985.
28. J. P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. of the 5th International Symposium on Programming, volume 137 of LNCS, 1982.
29. E. Stark. A proof technique for rely/guarantee properties. In FST&TCS, volume 206 of LNCS, 1985.
30. W. Thomas. Automata on in finite objects. In Handbook of Theoretical Computer Science, Volume B: Formal Models and Semantics, edited by J. van Leeuwen. Elsevier and MIT Press, 1990.
31. M. Vardi and P. Wolper. An automata-theoretic approach to automatic program verification. In IEEE Symposium on Logic in Computer Science, 1986.
32. J. Zwiers, W.P. de Roever, and P. van EmdeBoas. Compositionality and concurrent networks: Soundness and completeness of a proof system. Technical Report, University of Nijmegen, 1984.
33. J. Zwiers. Compositionality, Concurrency and Partial Correctness, volume 321 of LNCS. Springer-Verlag, 1989.