You assume, we guarantee: Methodology and case studies

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

Volumn 1427 LNCS, Issue , 1998, Pages 440-451

  Henzinger, Thomas A ^a   Qadeer, Shaz ^a   Rajamani, Sriram K ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; COMPUTER AIDED ANALYSIS;

ASSUME-GUARANTEE REASONING; COMPOSITIONAL VERIFICATION; LANGUAGE INCLUSION PROBLEMS; PROOF OBLIGATIONS; REFINEMENT CHECKING; REFINEMENT MAPPING; SYSTEM VERIFICATIONS; VERIFICATION PROBLEMS;

MODEL CHECKING;

EID: 84863971672     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/bfb0028765     Document Type: Conference Paper

References (18)

1. R. Alur and T.A. Henzinger. Reactive modules. In Proceedings of the 11 ill Annual Symposium on Logic in Computer Science, pages 207-218. IEEE Computer Society Press, 1996.
2. R. Alur, T.A. Henzinger, F.Y.C. Mang, S. Qadeer, S.K. Rajamani, and S. Tasiran. MOCHA: Modularity in model checking. In A. Hu and M. Vardi, editors, CAV 98: Computer Aided Verification, Lecture Notes in Computer Science. Springer-Verlag, 1998.
3. M. Abadi and L. Lamport. The existence of rclincmcnt mappings. Theoretical Computer Science, 82(2):253-284, 1991.
4. M. Abadi and L. Lamport. Conjoining specifications. ACM Transactions on Pmgramming Languages and Systems, 17(3):507-534, 1995.
5. S. Bcnsalcm, A. Bouajjani, C. Loiscaux, and J. Sifakis. Property-preserving simulations. In G. von Bochmann and D.K. Probst, editors, CAV 92: Computer Aided Verification, Lecture Notes in Computer Science 663, pages 260-273. Springer-Verlag, 1992.
6. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. In Pwceedings of the 19th Annual Symposium on Principles of Programming Languages, pages 343-354. ACM Press, 1992. (Pubitemid 23608124)
7. E.M. Clarke, D.E. Long, and K.L. McMillan. Compositional model checking. In Pwceedings of the 4th Annual Symposium on Logic in Computer Science, pages 353-362. IEEE Computer Society Press, 1989. (Pubitemid 20617544)
8. W. Damm and A. Pnueli. Verifying out-of-order executions. In Proceedings of the IFJP Working Conference on Correct Hardware Design and Verification Methods, CHARME, 1997.
9. O. Grumberg and D.E. Long. Model checking and modular verification. ACM Transactions on Programming Languages and Systems, 16(3): 843-871, 1994.
10. T.A. Henzinger, S. Qadeer, and S.K. Rajamani. You assume, we guarantee: Methodology and case studies. Technical report, Electronics Research Lab, Univ. of California, Berkeley, CA 94720, 1998.
11. R.P. Kurshan. Computer-aided Verification of Coordinating Processes. Princeton University Press, 1994.
12. L. Lamport. Specifying concurrent program modules. ACM Transactions on Programming Languages and Systems, 5(2): 190-222, 1983.
13. N.A. Lynch and M.R. Tuttle. Hierarchical correctness proofs for distributed algorithms. In Proceedings of the 6th Annual Symposium on Principles of Distributed Computing, pages 137-151. ACM Press, 1987.
14. N.A. Lynch and F. Vaandrager. Forward and backward simulations, Part I: Untimed systems. Information and Computation, 121(2):214-233, 1995.
15. K.L. McMillan. A compositional rule for hardware design refinement. In O. Grumberg, editor, CAV 97: Computer Aided Verification, Lecture Notes in Computer Science 1254, pages 24-35. Springer-Verlag, 1997. (Pubitemid 127088962)
16. K.L. McMillan. Verification of an implementation of Tomasulo's algorithm by compositional model checking. In A. Hu and M. Vardi, editors, CAV98: Computer Aided Verification, Lecture Notes in Computer Science. Springer-Verlag, 1998.
17. E. W. Stark. A proof technique for rely/guarantee properties. In Proceedings of the 5th Conference on Foundations of Software Technology and Theoretical Computer Science, Lecture Notes in Computer Science 206, pages 369-391. Springer-Verlag, 1985.
18. Andrew S. Tanenbaum. Computer Networks. Prentice-Hall Inc., 1992.