Automata as abstractions

Lecture Notes in Computer Science

Volumn 3385, Issue , 2005, Pages 216-232

  Dams, Dennis ^a   Namjoshi, Kedar S ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; MATHEMATICAL MODELS; THEOREM PROVING; TREES (MATHEMATICS);

ABSTRACTIONS; TREE AUTOMATA; VERIFICATION;

AUTOMATA THEORY;

EID: 24144496202     PISSN: 03029743     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1007/978-3-540-30579-8_15     Document Type: Conference Paper

References (34)

1. G. Bruns and P. Godefroid. Model checking partial state spaces with 3-valued temporal logics. In CAV, volume 1633 of LNCS. Springer, 1999.
2. M. Chechik, S. Easterbrook, and V. Petrovykh. Model-Checking over Multi-valued Logics. In FME, volume 2021 of LNCS. Springer, 2001.
3. 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.
4. R. Cleaveland, P. Iyer, and D. Yankelevich. Optimality in abstractions of model checking. In SAS, volume 983 of LNCS. Springer, 1995.
5. 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.
6. D. Dams and K.S. Namjoshi. The existence of finite abstractions for branching time model checking. In LICS, 2004.
7. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM TOPLAS, 19(2):253-291, 1997.
8. D. Dams, Y. Lakhnech, and M. Steffen. Iterating transducers. In J. of Logic and Algebraic Programming, 52-53:109-127. Elsevier, 2002.
9. D. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, July 1996.
10. L. de Alfaro, P. Godefroid, and R. Jagadeesan. Three-valued abstractions of games: Uncertainty, but with precision. In LICS, 2004.
11. E.A. Emerson and C.S. Jutla. The complexity of tree automata and logics of programs (extended abstract). In FOCS, 1988.
12. Full version in SIAM Journal of Computing, 29(1):132-158, 1999.
13. E.A. Emerson and C.S. Jutla. Tree automata, mu-calculus and determinacy (extended abstract). In FOCS, 1991.
14. P. Godefroid and R. Jagadeesan. On the expressiveness of 3-valued models. In VMCAI, volume 2575 of LNCS. Springer, 2003.
15. R. Giacobazzi, F. Ranzato, and F. Scozzari. Making abstract interpretations complete. Journal of the ACM, 47(2):361-416, 2000.
16. O. Grumberg and D.E. Long. Model checking and modular verification. In ACM TOPLAS, 1994.
17. T.A. Henzinger, O. Kupferman, and S. Rajamani. Fair simulation. In CONCUR, volume 1243 of LNCS. Springer, 1997.
18. M. Huth, R. Jagadeesan, and D. Schmidt. Modal transition systems: A foundation for three-valued program analysis. In ESOP, volume 2028 of LNCS. Springer, 2001.
19. D. Janin and I. Walukiewicz. Automata for the modal mu-calulus and related results. In MFCS, volume 969 of LNCS. Springer, 1995.
20. D. Janin and I. Walukiewicz. On the expressive completeness of the prepositional mu-calculus with respect to monadic second order logic. In CONCUR, volume 1119 of LNCS. Springer, 1996.
21. Y. Kesten and A. Pnueli. Verification by augmented unitary abstraction. Information and Computation, 163(1):203-243. Elsevier, 2000.
22. O. Kupferman and M.Y. Vardi. Modular model checking. In COMPOS, volume 1536 of LNCS. Springer, 1997.
23. K.G. Larsen and B. Thomsen. A modal process logic. In LICS, 1988.
24. K.G. Larsen and L. Xinxin. Equation solving using modal transition systems. In LICS, 1990.
25. R. Milner. An algebraic definition of simulation between programs. In 2nd IJCAI. William Kaufmann, 1971.
26. K.S. Namjoshi. Abstraction for branching time properties. In CAV, volume 2725 of LNCS. Springer, 2003.
27. F. Nielson, H. R. Nielson, and C. Hankin. Principles of Program Analysis. Springer, 1999.
28. J.P. Queille and J. Sifakis. Specification and verification of concurrent systems in CESAR. In Proc. of the 5th Intl. Symp. on Programming, volume 137 of LNCS. Springer-Verlag, 1982.
29. D. A. Schmidt. Closed and logical relations for over- and under-approximation of powersets. In SAS, volume 3148 of LNCS. Springer, 2004.
30. H. Seidl. Deciding equivalence of finite tree automata. SIAM Journal of Computing, 19:424-437, 1990.
31. S. Shoham and O. Grumberg. Monotonic abstraction-refinement for CTL. In TACAS, volume 2988 of LNCS. Springer, 2004.
32. R.S. Streett and E.A. Emerson. The prepositional mu-calculus is elementary. In ICALP, volume 172 of LNCS, 1984.
33. Full version in Information and Computation 81(3): 249-264, 1989.
34. T.E. Uribe. Abstraction-Based Deductive-Algorithmic Verification of Reactive Systems. PhD thesis, Stanford University, 1999.