Comparing completeness properties of static analyses and their logics

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

Volumn 4279 LNCS, Issue , 2006, Pages 183-199

  Schmidt, David A ^a  

^a KANSAS STATE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ABSTRACTING; DATABASE SYSTEMS; OBJECT ORIENTED PROGRAMMING; THEOREM PROVING;

ABSTRACT STATES; FUNDAMENTAL GALOIS CONNECTIONS; LOGICAL COMPLETENESS; STATIC ANALYSES;

FORMAL LOGIC;

EID: 33845957914     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11924661_12     Document Type: Conference Paper

References (29)

1. T. Ball, A. Podelski, and S.K. Rajamani. Boolean and cartesian abstractions for model checking C programs. In TACAS'01, pages 268-283. LNCS 2031, 2001.
2. T. Ball, A. Podelski, and S.K. Rajamani. Relative completeness of abstraction refinement for software model checking. In TACAS'02, pages 158-172. Springer LNCS 2280, 2002.
3. E.M. Clarke, O. Grumberg, S. Jha, Y. Lu, and H. Veith. Counterexample-guided abstraction refinement. In CAV'00, pages 154-169. Springer LNCS 1855, 2000.
4. E.M. Clarke, O. Grumberg, and D.E. Long. Model checking and abstraction. ACM Transactions on Programming Languages and Systems, 16(5):1512-1542, 1994.
5. R. Cleaveland, P. Iyer, and D. Yankelevich. Optimality in abstractions of model checking. In Proc. SAS'95. Springer LNCS 983, 1995.
6. P. Cousot. Méthodes itératives de construction et d'approximation de points fixes d'opérateurs monotones sur un treillis, analyse sémantique de programmes. PhD thesis, University of Grenoble, 1978.
7. P. Cousot and R. Cousot. Abstract interpretation: a unified lattice model for static analysis of programs. In Proc. 4th ACM Symp. POPL, pages 238-252, 1977.
8. P. Cousot and R. Cousot. Systematic design of program analysis frameworks. In Proc. 6th ACM Symp. POPL, pages 269-282, 1979.
9. P. Cousot and R. Cousot. Higher-order abstract interpretation. In Proceedings IEEE Int. Conf. Computer Lang., 1994.
10. P. Cousot and R. Cousot. Compositional and inductive semantic definitions in fixpoint, equational, constraint, closure-condition, rule-based and game theoretic form. In Proc. CAV'95, pages 293-308. Springer LNCS 939, 1995.
11. P. Cousot and R. Cousot. Temporal abstract interpretation. In Proc. 27th ACM Symp. on Principles of Programming Languages, pages 12-25. ACM Press, 2000.
12. D. Dams. Abstract interpretation and partition refinement for model checking. PhD thesis, Technische Universiteit Eindhoven, The Netherlands, 1996.
13. D. Dams, R. Gerth, and O. Grumberg. Abstract interpretation of reactive systems. ACM Trans. Prog. Lang. Systems, 19:253-291, 1997.
14. D. Dams and K. Namjoshi. The existence of finite abstractions for branching time model checking. In Proc. IEEE Symp. LICS'04, pages 335-344, 2004.
15. B.A. Davey and H.A Priestley. Introduction to Lattices and Order, 2d ed. Cambridge Univ. Press, 2002.
16. R. Giacobazzi and E. Quintarelli. Incompleteness, counterexamples, and refinements in abstract model checking. In SAS'01, pages 356-373. LNCS 2126, 2001.
17. R. Giacobazzi, F. Ranzato, and F. Scozzari. Making abstract interpretations complete. J. ACM, 47:361-416, 2000.
18. S. Graf and H. Saldi. Verifying invariants using theorem proving. In Proc. CAV'96, Springer LNCS 1102, 1996.
19. C. Loiseaux, S. Graf, J. Sifakis, A. Bouajjani, and S. Bensalem. Property preserving abstractions for verification of concurrent systems. Formal Methods in System Design, 6:1-36, 1995.
20. I. Mastroeni. Abstract non-interference: an abstract-intepretation- based approach to secure information flow. PhD thesis, University of Verona, IT, 2006.
21. A. Melton, G. Strecker, and D. Schmidt. Galois connections and computer science applications. In Category Theory and Computer Programming, pages 299-312. Springer LNCS 240, 1985.
22. A. Mycroft. Completeness and predicate-based abstract interpretation. In Proc. ACM Symp. Partial Evaluation (PEPM'93), pages 179-185, 1993.
23. F. Ranzato and F. Tapparo. Strong preservation as completeness in abstract interpretation. In Proc. ESOP, LNCS 2986, pages 18-32. Springer, 2004.
24. F. Ranzato and F. Tapparo. An abstract interpretation-based refinement algorithm for strong preservation. In TACAS'05, LNCS 3440, pages 140-156. Springer, 2005.
25. F. Ranzato and F. Tapparo. Strong preservation of temporal fixpoint-based operators by abstract interpretation. In Proc. Conf. VMCAI'06, LNCS 3855, pages 332-347. Springer Verlag, 2006.
26. M. Sagiv, T. Reps, and R. Wilhelm. Parametric shape analysis via 3-valued logic. ACM TOPLAS, 24:217-298, 2002.
27. H. Saidi. Model checking guided abstraction and analysis. In Proc. SAS'00, pages 377-396. Springer LNCS 1824, 2000.
28. D.A. Schmidt. Comparing completeness properties of static analyses and their logics. Technical Report 06-03, Kansas State University, 2006.
29. D.A. Schmidt. Underapproximating predicate transformers. In Proc. SAS'06, LNCS. Springer, 2006.