Generalized model checking: Reasoning about partial state spaces

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

Volumn 1877 LNCS, Issue , 2000, Pages 168-182

  Bruns, Glenn ^a   Godefroid, Patrice ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; SEMANTICS; TEMPORAL LOGIC; FORMAL LOGIC;

ALGORITHMS AND COMPLEXITY; GENERALIZED MODELS; KRIPKE STRUCTURE; MODEL CHECKING PROBLEM; SATISFIABILITY; SATISFIABILITY PROBLEMS; SOLUTION SPACE; TEMPORAL PROPERTY;

MODEL CHECKING;

EID: 84885220303     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-44618-4_14     Document Type: Conference Paper

References (28)

1. Martín Abadi, Leslie Lamport, and Pierre Wolper. Realizable and unrealizable concurrent program specifications. In Proc. 16th Int. Colloquium on Automata, Languages and Programming, Volume 372 of Lecture Notes in Computer Science, pages 1-17. Springer-Verlag, July 1989.
2. Glenn Bruns and Patrice Godefroid. Model checking partial state spaces with 3-valued temporal logics. In N. Halbwachs and D. Peled, editors, Proceedings of CAV'99, LNCS 1633, pages 274-287, 1999.
3. Orna Bernholtz, Moshe Y. Vardi, and Pierre Wolper. An automata-theoretic approach to branching-time model checking. In Computer Aided Verification, Proc. 6th Int. Workshop, Volume 818 of Lecture Notes in Computer Science, pages 142-155, Stanford, California, June 1994. Springer-Verlag.
4. E. M. Clarke and E. A. Emerson. Design and Synthesis of Synchronization Skeletons using Branching-Time Temporal Logic. In D. Kozen, editor, Proceedings of the Workshop on Logic of Programs, Yorktown Heights, Volume 131 of Lecture Notes in Computer Science, pages 52-71. Springer-Verlag, 1981.
5. E.M. Clarke, E.A. Emerson, and A.P. Sistla. Automatic verification of finite-state concurrent systems using temporal logic specifications. ACM Transactions on Programming Languages and Systems, 8(2): 244-263, January 1986.
6. E. A. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science. Elsevier/MIT Press, Amsterdam/Cambridge, 1990.
7. Melvin Fitting. Many-valued modal logics I. Fundamenta Informaticae, 15: 235-254, 1992.
8. Melvin Fitting. Many-valued modal logics II. Fundamenta Informaticae, 17: 55-73, 1992.
9. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. Journal of the ACM, 32(1): 137-161, 1985.
10. Stephen Cole Kleene. Introduction to Metamathematics. North Holland, 1987.
11. D. Kozen. Results on the Propositional Mu-Calculus. Theoretical Computer Science, 27: 333-354, 1983.
12. Kim G. Larsen and Bent Thomsen. A modal process logic. In Proceedings of the 3rd Annual Symposium on Logic in Computer Science, pages 203-210. IEEE Computer Society Press, 1988.
13. R. Milner. Communication and Concurrency. Prentice Hall, 1989.
14. Osamu Morikawa. Some modal logics based on a three-valued logic. Notre Dame Journal of Formal Logic, 30(1): 130-137, 1989.
15. Z. Manna and A. Pnueli. The Temporal Logic of Reactive and Concurrent Systems: Specification. Springer-Verlag, 1992.
16. th GI Conference, Volume 104 of Lecture Notes in Computer Science, pages 167-183. Springer-Verlag, 1981.
17. A. Pnueli and R. Rosner. On the synthesis of a reactive module. In Proc. of the Sixteenth Symposim on Principles of Programming Languages, Austin, January 1989.
18. A. Pnueli and R. Rosner. On the synthesis of an asynchronous reactive module. In Proceedings of ICALP'89, Stresa, July 1989.
19. Krister Segerberg. Some modal logics based on a three-valued logic. Theoria, 33: 53-71, 1967.
20. Mooly Sagiv, Thomas Reps, and Reinhard Wilhelm. Parametric shape analysis via 3-valued logic. In Proceedings of the 26th Annual ACM Symposium on Principles of Programming Languages, 1999.
21. Colin Stirling. Modal logics for communicating systems. Theoretical Computer Science, 49: 331-347, 1987.
22. C. Stirling and D. Walker. CCS, liveness and local model checking in the linear-time mu-calculus. In Proc. First International Workshop on Automatic Verification Methods for Finite State Systems, Volume 407 of Lecture Notes in Computer Science, pages 166-178. Springer-Verlag, 1990.
23. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific J. of Maths, 5: 285-309, 1955.
24. M.Y. Vardi. Alternating automata: Checking truth and validity for temporal logics. In Proceedings of CADE'97, 1997.
25. M.Y. Vardi. Why is modallogic sorobustly decidable? In Proceedings of DI-MACS Workshop on Descriptive Complexity and Finite Models. AMS, 1997.
26. M.Y. Vardi and P. Wolper. Automata-theoretic techniques for modal logics of programs. Journal of Computer and System Science, 32(2): 183-221, April 1986.
27. D. J. Walker. Bisimulations and divergence. In Proceedings of the 3rd Annual Symposium on Logic in Computer Science. IEEE Computer Society Press, 1988.
28. Pierre Wolper. Temporal logic can be more expressive. Information and Control, 56(1-2): 72-99, 1983.