The existence of finite abstractions for branching time model checking

Proceedings - Symposium on Logic in Computer Science

Volumn 19, Issue , 2004, Pages 335-344

  Dams, Dennis ^a   Namjoshi, Kedar S ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; AUTOMATA THEORY; COMPUTER SCIENCE; CONTEXT SENSITIVE GRAMMARS; GAME THEORY; MATHEMATICAL MODELS; MATHEMATICAL OPERATORS; THEOREM PROVING;

ABSTRACT SYSTEMS; FOCUSED TRANSITION SYSTEMS (FTS); LINEAR TIME LOGIC;

COMPUTER PROGRAMMING;

EID: 4544379156     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/lics.2004.1319628     Document Type: Conference Paper

References (44)

1. R. Alur, T. Henzinger, O. Kupferman, and M. Vardi. Alternating refinement relations. In CONCUR, vol. 1466 of LNCS, 1998.
2. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In COMPOS, vol. 1536 of LNCS, 1997. (full version in J.ACM 49(5), 2002).
3. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In COMPOS, vol. 1536 of LNCS, 1997. (full version in J.ACM 49(5), 2002).
4. M. Browne, E. Clarke, and O. Grumberg. Characterizing finite Kripke structures in propositional temporal logic. Journal of Theoretical Computer Science, 59:115-131, 1988.
5. G. Bruns and P. Godefroid. Model checking partial state spaces with 3-valued temporal logics. In CAV, vol. 1633 of LNCS, 1999.
6. G. Bruns and P. Godefroid. Temporal logic query checking. In LICS, 2001.
7. E. Clarke and E. A. Emerson. Design and synthesis of synchronization skeletons using branching time temporal logic. In Workshop on Logics of Programs, vol. 131 of LNCS, 1981.
8. R. Cleaveland, S. P. Iyer, and D. Yankelevich. Optimally in abstractions of model checking. In SAS, vol. 983 of LNCS, 1995.
9. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL, 1977.
10. D. Dams, O. Grumberg, and R. Gerth. Abstract interpretation of reactive systems. TOPLAS, 19(2), 1997.
11. D. R. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Eindhoven University of Technology, July 1996.
12. L. de Alfaro, P. Godefroid, and R. Jagadeesan. Three-valued abstractions of games: Uncertainty, but with precision. LICS'04 (these proceedings).
13. E. Emerson. Automata, tableaux and temporal logics (extended abstract). In Logic of Programs, vol. 193 of LNCS, 1985.
14. E. Emerson. Temporal and modal logic. In J. van Leeuwen, editor, Handbook of Theoretical Computer Science, Vol. B: Formal Methods and Semantics. Elsevier and MIT Press, 1990.
15. E. Emerson and C. Jutla. Tree automata, mu-calculus and determinacy (extended abstract). In FOCS, 1991.
16. E. Emerson and C.-L. Lei. Efficient model checking in fragments of the propositional mu-calculus (extended abstract). In LICS, 1986.
17. E. Emerson and C.-L. Lei. Modalities for model checking: Branching time logic strikes back. Sci. of Comp. Programming, 8(3), 1987.
18. E. A. Emerson, C. Jutla, and A. Sistla. On model-checking for fragments of μ-calculus. In CAV, vol. 697 of LNCS, 1993.
19. R. J. v. Glabbeek and W. P. Weijland. Branching time and abstraction in bisimulation semantics (extended abstract). In G. X. Ritter, editor, Information Processing 89, North-Holland, Amsterdam, 1989.
20. P. Godefroid and R. Jagadeesan. On the expressiveness of 3-valued models. In L. D. Zuck, P. C. Attie, A. Cortesi, and S. Mukhopadhyay, editors, Verification, Model Checking, and Abstract Interpretation, vol. 2575 in LNCS, 2003.
21. O. Grumberg and D. Long. Model checking and modular verification. TOPLAS, 1994.
22. M. Hennessy and R. Milner. Algebraic laws for nondeterminism and concurrency. J. ACM, 32(1), 1985.
23. R. Hossley and C. Rackoff. The emptiness problem for automata on infinite trees. In FOCS, 1972.
24. M. Huth, R. Jagadeesan, and D. Schmidt. A domain equation for refinement of partial systems. Math. Struct. in Comp. Science (to appear).
25. Y. Kesten and A. Pnueli. Verification by augmented finitary abstraction. Information and Computation, 163(1), 2000.
26. Y. Kesten, A. Pnueli, and M. Vardi. Verification by augmented abstraction: The automata-theoretic view. JCSS, 62(4), 2001.
27. O. Kupferman and M. Vardi. Modular model checking. In COMPOS, vol. 1536 of LNCS, 1997.
28. O. Kupferman, M. Vardi, and P. Wolper. An automata-theoretic approach to branching time model checking. J. ACM, 47(2), 2000.
29. K. G. Larsen and B. Thomsen. A modal process logic. In 1988 IEEE Symposium on Logic in Computer Science, TC-MFC, Computer Society Press, Washington, 1988.
30. K. G. Larsen and L. Xinxin. Equation solving using modal transition systems. In LICS, 1990.
31. M. Maidl. The common fragment of CTL and LTL. In FOCS, 2000.
32. Z. Manna and A. Pnueli. How to cook a temporal proof system for your pet language. In POPL, 1983.
33. P. Manolios. A compositional theory of refinement for branching time. In CHARME, 2003.
34. P. Manolios and R. J. Trefler. Safety and liveness in branching time. In LICS, 2001.
35. R. Milner. An algebraic definition of simulation between programs. In 2nd IJCAI, 1971.
36. K. S. Namjoshi. Certifying model checkers. In CAV, vol. 2102 of LNCS, 2001.
37. K. S. Namjoshi. Abstraction for branching time properties. In CAV, vol. 2725 of LNCS, 2003.
38. D. Park. Concurrency and automata on infinite sequences. In Theoretical Computer Science, vol. 104 of LNCS, 1981.
39. A. Pnueli. The temporal logic of programs. In FOCS, 1977.
40. J. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. of the 5th International Symposium on Programming, vol. 137 of LNCS, 1982.
41. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. TOPLAS, 24(3), 2002.
42. S. Shoham and O. Grumberg. Monotonic abstraction-refinement for CTL. In TACAS, volume 2988 of LNCS, 2004.
43. C. Stirling. Modal and Temporal Properties of Processes. Springer, 2001.
44. T. Uribe. Abstraction-Based Deductive-Algorithmic Verification of Reactive Systems. PhD thesis, Stanford University, 1999.