3-Valued abstraction: More precision at less cost

Information and Computation

Volumn 206, Issue 11, 2008, Pages 1313-1333

  Shoham, Sharon ^a   Grumberg, Orna ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; BOOLEAN FUNCTIONS; INFORMATION THEORY;

ABSTRACT MODELING; ABSTRACTION-REFINEMENT FRAMEWORK; BRANCHING TIME LOGICS; EFFICIENT ALGORITHMS; NEW CLASS; VALUED SEMANTICS;

MODEL CHECKING;

EID: 53449100391     PISSN: 08905401     EISSN: 10902651     Source Type: Journal    
DOI: 10.1016/j.ic.2008.07.004     Document Type: Article

References (32)

1. S. Shoham, O. Grumberg, 3-valued abstraction: more precision at less cost, in: Twenty-First Annual IEEE Symposium on Logic in Computer Science (LICS), Seattle, Washington, 2006, pp. 399-410.
2. Clarke E., Grumberg O., and Peled D. Model Checking (1999), MIT Press
3. G. Bruns, P. Godefroid, Model checking partial state spaces with 3-valued temporal logics, in: Computer Aided Verification, 1999, pp. 274-287.
4. D. Kozen, Results on the Propositional μ-Calculus, TCS 27.
5. Larsen K.G. Modal specifications. In: Sifakis J. (Ed). Proceedings of the 1989 International Workshop on Automatic Verification Methods for Finite State Systems, Grenoble, France. LNCS vol. 407 (1989), Springer-Verlag
6. Larsen K., and Thomsen B. A modal process logic. Proceedings of the Third Annual Symposium on Logic in Computer Science (LICS) (1988), IEEE Computer Society Press 203-210
7. D. Dams, R. Gerth, O. Grumberg, Abstract interpretation of reactive systems, ACM Transactions on Programming Languages and Systems (TOPLAS) 19 (2).
8. Namjoshi K. Abstraction for branching time properties. Proceedings of the 15th International Conference on Computer Aided Verification (CAV'03). LNCS vol. 2725 (2003), Springer, Boulder, CO, USA 288-300
9. Dams D., and Namjoshi K. The existence of finite abstractions for branching time model checking. 19th IEEE Symposium on Logic in Computer Science (LICS) (2004), IEEE Computer Society 335-344
10. de Alfaro L., Godefroid P., and Jagadeesan R. Three-valued abstractions of games: uncertainty, but with precision. Proceedings of the 19th Annual IEEE Symposium on Logic in Computer Science (LICS) (2004) 170-179
11. S. Shoham, O. Grumberg, Monotonic abstraction-refinement for CTL, in: 10th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS), vol. 2988, LNCS, Barcelona, Spain, 2004, pp. 546-560.
12. Larsen K., and Xinxin L. Equation solving using modal transition systems. In: Mitchell J. (Ed). Proceedings of the Fifth Annual IEEE Symposium on Logic in Computer Science (LICS) (1990), IEEE Computer Society Press 108-117
13. Cousot P., and Cousot R. Abstract interpretation frameworks. Journal of Logic and Computation 2 (1992) 511-547
14. Cousot P., and Cousot R. Comparing the Galois connection and widening/narrowing approaches to abstract interpretation. Proceedings of the Conference on Programming Language Implementation and Logic Programming (PLILP'92). LNCS vol. 631 (1992), Springer-Verlag 269-295
15. R. Cleaveland, P. Iyer, D. Yankelevich, Optimality in abstraction of model checking, in: Static Analysis Symposium (SAS), 1995, pp. 51-63.
16. D.A. Schmidt, Closed and logical relations for over- and under-approximation of powersets, in: Static Analysis Symposium (SAS), 2004, pp. 22-37.
17. A. Gurfinkel, O. Wei, M. Chechik, Systematic construction of abstractions for model-checking, in: Conference on Verification, Model Checking and Abstract Interpretation (VMCAI), 2006.
18. P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: popl4, Los Angeles, California, 1977, pp. 238-252.
19. P. Godefroid, M. Huth, R. Jagadeesan, Abstraction-based model checking using modal transition systems, in: Proceedings of CONCUR'01, 2001.
20. G. Bruns, P. Godefroid, Generalized model checking: reasoning about partial state spaces, in: CONCUR'00, vol. 1877, 2000, pp. 168-182.
21. Godefroid P., and Jagadeesan R. Automatic abstraction using generalized model checking. Proceedings of Conference on Computer-Aided Verification (CAV). LNCS vol. 2404 (2002), Springer-Verlag, Copenhagen, Denmark 137-150
22. C.S. Pasareanu, R. Pelánek, W. Visser, Concrete model checking with abstract matching and refinement, in: Computer Aided Verification (CAV), 2005, pp. 52-66.
23. Tarski A. A lattice-theoretical fixpoint theorem and its applications. Pacific Journal of Mathematics 5 (1955) 285-309
24. M. Huth, R. Jagadeesan, D. Schmidt, Modal transition systems: a foundation for three-valued program analysis, in: European Symposium on Programming (ESOP'01), vol. 2028, 2001, pp. 155-169.
25. Godefroid P., and Jagadeesan R. On the expressiveness of 3-valued models. Proceedings of VMCAI'2003 (4th Conference on Verification, Model Checking and Abstract Interpretation). LNCS vol. 2575 (2003), Springer-Verlag, New York 206-222
26. Cousot P., and Cousot R. Systematic design of program analysis frameworks. Proceedings of the 6th ACM SIGACT-SIGPLAN Symposium on Principles of Programming Languages (POPL) (1979), ACM, New York, NY, USA 269-282
27. Giacobazzi R., Ranzato F., and Scozzari F. Making abstract interpretations complete. Journal of the ACM 47 2 (2000) 361-416
28. Giacobazzi R., and Quintarelli E. Incompleteness, counterexamples, and refinements in abstract model checking. Static Analysis Symposium (SAS). LNCS vol. 2126 (2001), Springer-Verlag 356-373
29. Schmidt D. Comparing completeness properties of static analyses and their logics. Asian Symp. Prog. Lang. Systems (APLAS'06). LNCS vol. 4279 (2006), Springer-Verlag 183-199
30. Ranzato F., and Tapparo F. Strong preservation as completeness in abstract interpretation. Proceedings of the European Symposium Programming. LNCS vol. 2986 (2004), Springer-Verlag 18-32
31. Ranzato F., and Tapparo F. Strong preservation of temporal fixpoint-based operators by abstract interpretation. Conference on Verification, Model Checking and Abstract Interpretation (VMCAI). LNCS vol. 3855 (2006), Springer-Verlag 332-347
32. Shoham S., and Grumberg O. A game-based framework for CTL counterexamples and 3-valued abstraction-refinement. Proceedings of the 15th International Conference on Computer Aided Verification (CAV'03). LNCS vol. 2725 (2003), Springer, Boulder, CO, USA 275-287 (to appear in TOCL)