Module checking

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

Volumn 1102, Issue , 1996, Pages 75-86

  Kupferman, Oma ^a   Vardi, Moshe Y ^b  

^a LUCENT TECHNOLOGIES   (United States)

^b Rice University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; OPEN SYSTEMS; SPECIFICATIONS; TEMPORAL LOGIC;

ARBITRARY ENVIRONMENT; BRANCHING TIME; CLOSED SYSTEMS; CORRECT MODELS; CURRENT MODELING; MODEL CHECKING ALGORITHM; PROGRAM COMPLEXITY; REACTIVE PROGRAMS;

MODEL CHECKING;

EID: 84957667659     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-61474-5_59     Document Type: Conference Paper

References (42)

1. A. Aziz, T.R. Shiple, V. Singhal, and A.L. Sangiovarmi-Vincentelli. Formula-dependent equivalence for compositional CTL model checking. In Proc. 6th Conf. on Computer Aided Verification, volume 818 of Lecture Notes in Computer Science, pages 324-337, Stanford, CA, June 1994. Springer-Veflag.
2. I. Beer, S. Ben-David, D. Geist, R. Gewirtzman, and M. Yoeli. Methodology and system for practical formal verification of reactive hardware. In Proc. 6th Workshop on Computer Aided Verification, volume 818 of Lecture Notes in Computer Science, pages 182-193, Stanford, June 1994.
3. J.R. Butch, E.M. Clarke, K.L. McMillan, D.L. Dill, and L.J. Hwang. Symbolic model checking: 1020 states and beyond. In Proceedings of the 5th Symposium on Logic in Compute r Science, pages 428-439, Philadelphia, June 1990.
4. O. Bernholtz and O. Grumberg. Buy one, get one free !!! In Proceedings of the First International Conference on Temporal Logic, volume 827 of Lecture Notes in Artificial lntelligence, pages 210-224, Bonn, July 1994. Springer-Verlag.
5. M.C. Browne. An improved algorithm for the automatic verification of finite state systems using temporal logic. In Proceedings of the First Symposium on Logic in Computer Science, pages 260-266, Cambridge, June 1986.
6. O. Bemholtz, M.Y. Vardi, and P. Wolper. An automata-theoretic approach to branching-time model checking. In D. L. Dill, editor, Computer Aided Verification, Proc. 6th Int. Conference, volume 818 of Lecture Notes in Computer Science, pages 142-155, Stanford, June 1994. Springer-Verlag, Berlin.
7. E.M. Clarke and E.A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Proc., workshop on Logic of Programs, volume 131 of Lecture Notes in Computer Science, pages 52-71. Springer-Verlag, 1981.
8. E.M. Clarke, E.A. Emerson, and A.P. Sisfla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2):244-263, January 1986.
9. E.M. Clarke, O. Grumberg, and D. Long. Verification tools for finite-state concurrent systems. In J.W. de Bakker, W.-P. de Roever, and G. Rozenberg, editors, Decade of Concurrency – Reflections and Perspectives (Proceedings of REX School), Lecture Notes in Computer Science, pages 124-175. Springer-Verlag, 1993.
10. R. Cleaveland. A linear-time model-checking algorithm for the alternation-free modal µ-calculus. Formal Methods in System Design, 2:121-147, 1993.
11. E.A. Emerson and J.Y. Halpem. Sometimes and not never revisited: On branching versus linear time. Journal of the ACM, 33(1): 151-178, 1986.
12. E.A. Emerson and C. Jutla. The complexity of tree automata and logics of programs. In Proceedings of the 29th IEEE Symposium on Foundations of Computer Science, White Plains, October 1988.
13. E.A. Emerson and C.-L. Lei. Temporal model checking under generalized fairness constraints. In Proc. 18th Hawaii International Conference on System Sciences, Hawaii, 1985.
14. E.A. Emerson. Temporal and modal logic. Handbook of theoretical computer science, pages 997-1072, 1990.
15. E.A. Emerson and A. P. Sistla. Deciding branching time logic. In Proceedings of the 16th ACM Symposium on Theory of Computing, Washington, April 1984.
16. M.J. Fischer and R.E. Ladner. Propositional dynamic logic of regular programs. J. of Computer and Systems Sciences, 18:194-211, 1979.
17. R.W. Floyd. Assigning meaning to programs. In Proceedings Symposium on Applied Mathematics, volume 19, 1967.
18. M.J. Fischer and L.D. Zuck. Reasoning about uncertainty in fault-tolerant distributed systems. In M. Joseph, editor, Proc. Syrup. on Formal Techniques in Real-Time and Fault-Tolerant Systems, pages 142-158. Springer-Verlag, 1988.
19. M. Garey and D. S. Johnson. Computers and Intractability: A Guide to the Theory of NPcompleteness. W. Freeman and Co., San Francisco, 1979.
20. O Gmmberg and D.E. Long. Model checking and modular verification. ACM Trans. on Programming Languages and Systems, 16(3):843-871, 1994.
21. L.M. Goldschlager. The monotone and planar circuit value problems are log space complete for p. SIGACTNews, 9(2):25--29, 1977.
22. C.A.R. Hoare. An axiomatic basis of computer programming. Communications of the ACM, 12(10):576-583, 1969.
23. C.A.R. Hoare. Communicating Sequepdial Processes. Prentice-Hall, 1985
24. 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.
25. O. Kupferman. Augmenting branching temporal logics with existential quantification over atomic propositions. In Computer Aided Verifzcation, Proc. 7th Int. Workshop, pages 325-338, Liege, July 1995.
26. O. Kupferman and M.Y. Vardi. On the complexity of branching modular model checking. In Proc. 6th Conferance on Concurrency Theory, pages 408--422, Philadelphia, August 1995.
27. L. Lamport. Sometimes is sometimes "not never" - on the temporal logic of programs. In Proceedings of the 7th A CM Symposium on Principles of Programming Languages, pages 174-185, January 1980.
28. K.G. Larsen. Modal specifications. In Automatic Verification Methods for Finite State Systems, Proc. Int. Workshop, Grenoble, volume 407, pages 232-246, Grenoble, June 1989. Lecture Notes in Computer Science, Springer-Verlag.
29. D.E. Long. Model checking, abstraction and compositional verification. PhD thesis, Carnegie-Mellon University, Pittsburgh, 1993.
30. O. Lichtenstein and A. Pnueli. Checking that finite state concurrent programs satisfy their linear specification. In Proceedings of the Twelfth ACM Symposium on Principles of Programming Languages, pages 97-107, New Orleans, January 1985.
31. K.G. Larsen and G.B. Thomsen. A modal process logic. In Proceedings of the 3th Symposium on Logic in Computer Science, Edinburgh, 1988
32. K.L. McMillan. Symbolic model checking. Kluwer Academic Publishers, 1993.
33. Z. Manna and A. Pnueli. Temporal specification and verification of reactive modules. 1991
34. A. Pnueli. The temporal logic of programs. In Proc. 18th IEEE Symposium on Foundation of Computer Science, pages 46-57, 1977.
35. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proceedings of the Sixteenth ACM Symposium on Principles of Programming Languages, Austin, Januery 1989.
36. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in Cesar. In Proc. 5th lnt'l Syrup. on Programming, volume 137, pages 337-351. Spfinger-Verlag, Lecture Notes in Computer Science, 1981.
37. M.O. Rabin. Decidability of second order theories and automata on infinite trees. Transaction of the AMS, 141:1-35, 1969.
38. A.P. Sisfla and E.M. Clarke. The complexity of propositional linear temporal logic. Z ACM, 32:733-749, 1985.
39. M.Y. Vardi. On the complexity of modular model checking. In Proceedings of the lOth 1EEE Symposium on Logic in Computer Science, June 1995.
40. M.Y. Vardi and L. Stockmeyer. Improved upper and lower bounds for modal logics of programs. In Proc 17th ACM Symp. on Theory of Computing, pages 240-251, 1985.
41. M.Y. Vardi and P. Wolper. An automata4heoretic approach to automatic program verification. In Proceedings of the First Symposium on Logic in Computer Science, pages 322-331, Cambridge, June 1986.
42. M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2): 182-221, April 1986