Linking theorem proving and model-checking with well-founded bisimulation

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

Volumn 1633, Issue , 1999, Pages 369-379

  Manolios, Panagiotis ^a   Namjoshi, Kedar ^b   Sumners, Robert ^c  

^a University of Texas at Austin   (United States)

^b LUCENT TECHNOLOGIES   (United States)

^c The University of Texas at Austin   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; SPECIFICATIONS; THEOREM PROVING;

EQUIVALENCE CHECKER; FINITE STATE SYSTEMS; INFINITE STATE SPACE; INFINITE STATE SYSTEMS; LINKING THEOREM; ON-THE-FLY METHODS; ORIGINAL SYSTEMS; TEMPORAL LOGIC FORMULA;

MODEL CHECKING;

EID: 84957092218     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-48683-6_32     Document Type: Conference Paper

References (22)

1. [ACD90] R. Alur, C. Courcoubetis, and D. Dill. Model checking for real time systems. In 5th IEEE Symp. on Logic in Computer Science, 1990.
2. [AJ96] P.A. Abdulla and B. Jonsson. Verifying programs with unreliable channels. Information and Computation, 127(2), 1996.
3. [BCG88] M. Browne, E.M. Clarke, and O. Grumberg. Characterizing finite Kripke structures in propositional temporal logic. Theoretical Computer Science, 59, 1988.
4. [BG94] M.A. Bezem and J.F. Groote. A correctness proof of a one bit sliding window protocol in mCRL. The Computer Journal, 1994.
5. [BG96] B. Boigelot and P. Godefroid. Symbolic verification of communication protocols with infinite state spaces using QDD's. In Conference on Computer Aided Verification, volume 1102 of LNCS, 1996.
6. [BM79] R. Boyer and J. Moore. A Computational Logic. Kluwer Academic Publishers, 1979.
7. [BSW69] K.A. Barlett, R.A. Scantlebury, and P.C. Wilkinson. A note on reliable full duplex transmission over half duplex links. In Communications of the ACM, volume 12, 1969.
8. [CE81] 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.
9. [CES86] 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, 8(2), 1986.
10. [EH86] E. A. Emerson and J. Y. Halpern. "Sometimes" and "not never" revisited: on branching versus linear time temporal logic. JACM, 33(1):151-178, January 1986.
11. [EN95] E.A. Emerson and K.S. Namjoshi. Reasoning about rings. In ACM Symposium on Principles of Programming Languages, 1995.
12. [GM93] M. J. C. Gordon and T. F. Melham, editors. Introduction to HOL: A theorem proving environment for higher order logic. Cambridge University Press, 1993.
13. [GS92] S. German and A.P. Sistla. Reasoning about systems with many processes. Journal of the ACM, 1992.
14. [GS97] S. Graf and H. Saidi. Construction of abstract state graphs with PVS. In Conference on Computer Aided Verification, volume 1254 of LNCS, 1997.
15. [HS96] K. Havelund and N. Shankar. Experiments in theorem proving and model checking for protocol verification. In Formal Methods Europe (FME), volume 1051 of LNCS. Springer-Verlag, 1996.
16. [KM97] M. Kaufmann and J S. Moore. An industrial strength theorem prover for a logic based on Common Lisp. IEEE Transactions on Software Engineering, 23(4):203-213, April 1997.
17. [Lam80] L. Lamport. "Sometimes" is sometimes "not never." In ACM Symposium on Principles of Programming Languages, 1980.
18. [Mil90] R. Milner. Communication and Concurrency. Prentice-Hall, 1990.
19. [MN95] O. Muller and T. Nipkow. Combining model checking and deduction for I/O-Automata. In Proceedings of TACAS, 1995.
20. [Nam97] K. S. Namjoshi. A simple characterization of stuttering bisimulation. In 17th Conference on Foundations of Software Technology and Theoretical Computer Science, volume 1346 of LNCS, pages 284-296, 1997.
21. [QS82] 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.
22. [Wol86] P. Wolper. Expressing interesting properties of programs in propositional temporal logic. In Proceedings of the 13th ACM Symposium on Principles of Programming Languages, pages 184-193. ACM Press, 1986.