3-Valued abstraction: More precision at less cost

Proceedings - Symposium on Logic in Computer Science

Volumn , Issue , 2006, Pages 399-408

  Shoham, Sharon ^a   Grumberg, Orna ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION ALGORITHMS; MATHEMATICAL MODELS; QUADRATIC PROGRAMMING; SEMANTICS;

ABSTRACT MODELS; ABSTRACTION-REFINEMENT FRAMEWORK; BRANCHING TIME LOGICS;

MODEL CHECKING;

EID: 34547312842     PISSN: 10436871     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/LICS.2006.5     Document Type: Conference Paper

References (23)

1. G. Bruns and P. Godefroid. Model checking partial state spaces with 3-valued temporal logics. In CAV. 1999.
2. G. Bruns and P. Godefroid. Generalized model checking: Reasoning about partial state spaces. In CONCUR, 2000.
3. E. Clarke, O. Grumberg, and D. Peled. Model Checking. MIT press, 1999.
4. R. Cleaveland, P. Iyer, and D. Yankelevich. Optimality in abstraction of model checking. In SAS, 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. P. Cousot and R. Cousot. Abstract interpretation frameworks. J. Log. Comput., 2(4), 1992.
7. D. Dams, R. Gerth, and O. Grumberg. Abstract, interpretation of reactive systems. TOPLAS, 19(2), 1997.
8. D. Dams and K. Namjoshi. The existence of finite abstractions for branching time model checking. In LICS, 2004.
9. L. de Alfaro, P. Godefroid, and R. Jagadeesan. Three-valued abstractions of games: Uncertainty, but with precision. In LICS, 2004.
10. P. Godefroid, M. Huth, and R. Jagadeesan. Abstraction-based model checking using modal transition systems. In CONCUR, 2001.
11. P. Godefroid and R. Jagadeesan. Automatic abstraction using generalized model checking. In CAV, 2002.
12. P. Godefroid and R. Jagadeesan. On the expressiveness of 3-valued models. In VMCAI, 2003.
13. A. Gurfinkel, O. Wei, and M. Chechik. Systematic construction of abstractions for model-checking. In VMCAI, 2006.
14. M. Huth, R. Jagadeesan, and D. Schmidt. Modal transition systems: A foundation for three-valued program analysis. In ESOP, 2001.
15. D. Kozen. Results on the propositional μ-calculus. TCS, 27, 1983.
16. K. Larsen and B. Thomsen. A modal process logic. In LICS, 1988.
17. K. Larsen and L. Xinxin. Equation solving using modal transition systems. In LICS, 1990.
18. K. G. Larsen. Modal specifications. In Automatic Verification Methods for Finite State Systems, Grenoble, 1989.
19. K. Namjoshi. Abstraction for branching time properties. In CAV, 2003.
20. C. S. Pasareanu, R. Pelánek, and W. Visser. Concrete model checking with abstract matching and refinement. In CAV'05.
21. D. A. Schmidt. Closed and logical relations for over- and under-approximation of powersets. In SAS, 2004.
22. S. Shoham and O. Grumberg. A game-based framework for CTL counterexamples and 3-valued abstraction-refinement. In CAV, 2003. To appear in TOCL.
23. S. Shoham and O. Grumberg. Monotonie abstraction-refinement for CTL. In TACAS, 2004.