Abstraction for branching time properties

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

Volumn 2725, Issue , 2003, Pages 288-300

  Namjoshi, Kedar S ^a  

^a LUCENT TECHNOLOGIES   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS; MODEL CHECKING; SEMANTICS;

ALTERNATING TRANSITION SYSTEM; ALTERNATING TREE AUTOMATON; EFFECTIVE PROGRAMS; NON-DETERMINISM; PREDICATE ABSTRACTIONS; RANK FUNCTIONS; SEMANTIC COMPLETENESS; TRANSITION RELATIONS;

ABSTRACTING;

EID: 21144457342     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45069-6_29     Document Type: Article

References (34)

1. R. Alur, T. A. Henzinger, and O. Kupferman. Alternating-time temporal logic. In COMPOS, volume 1536 of LNCS, 1997. Journal version in JACM.
2. T. Ball, A. Podelski, and S. K. Rajamani. Relative completeness of abstraction refinement for software model checking. In TACAS, number 2280 in LNCS, 2002.
3. T. Ball and S. K. Rajamani. The SLAM toolkit. In CAV, volume 2102 of LNCS, 2001.
4. S. Bensalem, Y. Lakhnech, and S. Owre. InVeST: A tool for the verification of invariants. In CAV, volume 1427 of LNCS, 1998.
5. A. Bouajjani, J-C. Fernandez, and N. Halbwachs. Minimal model generation. In CAV, volume 531 of LNCS, 1990.
6. I.A. Browne, Z. Manna, and H.B. Sipma. Generalized temporal verification diagrams. In FST&TCS, volume 1026 of LNCS, 1995.
7. G. Bruns and P. Godefroid. Generalized model checking: Reasoning about partial state spaces. In CONCUR, volume 1877 of LNCS, 2000.
8. E. M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV, volume 1855 of LNCS, 2000.
9. E.M. Clarke, O. Grumberg, and D. E. Long. Model checking and abstraction. TOPLAS, 16(5), 1994.
10. R. Cleaveland, S. P. Iyer, and D. Yankelevich. Optimality in abstractions of model checking. In SAS, volume 983 of LNCS, 1995.
11. J. Corbett, M. Dwyer, J. Hatcliff, C. Pasareanu, Robby, S. Laubach, and H. Zheng. Bandera: extracting finite-state models from Java source code. In ICSE, 2001.
12. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In POPL, 1997.
13. D. Dams. Abstract Interpretation and Partition Refinement for Model Checking. PhD thesis, Eindhoven University of Technology, 1996.
14. D. Dams, O. Grumberg, and R. Gerth. Abstract interpretation of reactive systems. TOPLAS, 19(2), 1997.
15. E.W. Dijkstra. Guarded commands, nondeterminacy, and formal derivation of programs. CACM, 18(8), 1975.
16. E. A. Emerson, C.S. Jutla, and A.P. Sistla. On model-checking for fragments of μ-calculus. In CAV, 1993.
17. E.A. Emerson and C.S. Jutla. Tree automata, mu-calculus and determinacy (extended abstract). In FOCS, 1991.
18. P. Godefroid, M. Huth, and R. Jagadeesan. Abstraction-based model checking using modal transition systems. In CONCUR, volume 2154 of LNCS, 2001.
19. S. Graf and H. Saïdi. Construction of abstract state graphs with PVS. In CAV, volume 1254 of LNCS, 1997.
20. T. A. Henzinger, R. Jhala, R. Majumdar, and G. Sutre. Lazy abstraction. In POPL, 2002.
21. G. J. Holzmann and M. H. Smith. Automating software feature verification. Bell Labs Technical Journal, 5(2), 2000.
22. Y. Kesten and A. Pnueli. Verification by augmented finitary abstraction. Information and Computation, 163(1), 2000.
23. Y. Kesten, A. Pnueli, and M. Vardi. Verification by augmented abstraction: The automata-theoretic view. JCSS, 62(4), 2001.
24. D. Kozen. Results on the prepositional mu-calculus. In ICALP, 1982.
25. D. Lee and M. Yannakakis. Online minimization of transition systems. In STOC, 1992.
26. R. Milner. An algebraic definition of simulation between programs. In 2nd IJCAI, 1971.
27. K. S. Namjoshi. Certifying model checkers. In CAV, number 2102 in LNCS, 2001.
28. K. S. Namjoshi. Lifting temporal proofs across abstractions. In VMCAI, volume 2575 of LNCS, 2003.
29. K. S. Namjoshi and R. P. Kurshan. Syntactic program transformations for automatic abstraction. In CAV, volume 1855 of LNCS, 2000.
30. H.B. Sipma, T.E. Uribe, and Z. Manna. Deductive model checking. Formal Methods in System Design, 15(1), 1999.
31. R.S. Streett and E.A. Emerson. The prepositional mu-calculus is elementary. In ICALP, 1984.
32. Full version in Inf. and Comp. 81(3), pp. 249-264, 1989.
33. T.E. Uribe. Abstraction-Based Deductive-Algorithmic Verification of Reactive Systems. PhD thesis, Stanford University, 1999.
34. W. Visser, K. Havelund, G. Brat, and S. Park. Model checking programs. In ICSE, 2000.