Monotonic abstraction-refinement for CTL

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

Volumn 2988, Issue , 2004, Pages 546-560

  Shoham, Sharon ^a   Grumberg, Orna ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; SEMANTICS;

3-VALUED SEMANTICS; ABSTRACT MODELING; ABSTRACT MODELS; ABSTRACTION REFINEMENT; AUTOMATIC CONSTRUCTION; REFINED MODEL;

ABSTRACTING;

EID: 35048842322     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24730-2_40     Document Type: Article

References (21)

1. S. Barner, D. Geist, and A. Gringauze. Symbolic localization reduction with reconstruction layering and backtracking. In Computer-Aided Verification (CAV), Denmark, July 2002.
2. P. Chauhan, E.M. Clarke, J. Kukula, S. Sapra, H. Veith, and D. Wang. Automated abstraction refinement for model checking large state spaces using sat based conflict analysis. In Formal Methods in Computer Aided Design (FMCAD), November 2002.
3. M. Chechik, B. Devereux, A. Gurfinkel, and S. Easterbrook. Multi-valued symbolic model-checking. Technical Report CSRG-448, University of Toronto, April 2002.
4. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In Computer Aided Verification (CAV), LNCS, Chicago, USA, July 2000.
5. E.M. Clarke, O. Grumberg, and D.A. Peled. Model Checking. MIT press, December 1999.
6. E.M. Clarke, A. Gupta, J. Kukula, and O. Strichman. SAT based abstraction-refinement using ILP and machine leraning techniques. In Computer Aided Verification (CAV), 2002.
7. P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction or approximation of fixpoints. In popl4, pages 238-252, 1977.
8. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Transactions on Programming Languages and Systems (TOPLAS), 19(2), March 1997.
9. P. Godefroid, M. Huth, and R. Jagadeesan. Abstraction-based model checking using modal transition systems. In CONCUR, 2001.
10. P. Godefroid and R. Jagadeesan. Automatic abstraction using generalized model checking. In Computer Aided Verification (CAV), LNCS, Copenhagen, Denmark, July 2002.
11. P. Godefroid and R. Jagadeesan. On the expressiveness of 3-valued models. In Verification, Model Checking and Abstract Interpretation (VMCAI), LNCS, January 2003.
12. M. Huth, R. Jagadeesan, and D. Schmidt. Modal transition systems: A foundation for three-valued program analysis. LNCS, 2028:155-169, 2001.
13. R.P. Kurshan. Computer-Aided-Verification of Coordinating Processes. Princeton University Press, 1994.
14. K.G. Larsen and B. Thomsen. A modal process logic. In LICS, July 1988.
15. W. Lee, A. Pardo, J. Jang, G. D. Hachtel, and F. Somenzi. Tearing based automatic abstraction for CTL model checking. In ICCAD, pages 76-81, 1996.
16. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for the verification of concurrent systems. Formal Methods in System Design, 1995.
17. K. S. Namjoshi. Abstraction for branching time properties. In CAV, Boulder, CO, July 2003.
18. A. Pardo and G. D. Hachtel. Automatic abstraction techniques for prepositional mu-calculus model checking. In Computer Aided Verification (CAV), pages 12-23, 1997.
19. A. Pardo and G. D. Hachtel. Incremental CTL model checking using BDD subsetting. In Design Automation Conference, pages 457-462, 1998.
20. S. Shoham and O. Grumberg. A game-based framework for CTL counterexamples and 3-valued abstraction-refinement. In Computer Aided Verification, Boulder, CO, July 2003.
21. A. Tarski. A lattice-theoretical fixpoint theorem and its applications. Pacific J. Math, 1955.