A calculus of logical relations for over- and underapproximating static analyses

Science of Computer Programming

Volumn 64, Issue 1 SPEC. ISS., 2007, Pages 29-53

  Schmidt, David A ^a,b  

^a Sunflower Networking Group   (United States)

^b ECOLE POLYTECHNIQUE   (France)

Author keywords

Abstract interpretation; Galois connections; Hennessy Milner logic; Powerdomains; State transition systems; Underapproximation

Indexed keywords

ABSTRACTING; APPROXIMATION THEORY; DIGITAL ARITHMETIC; MATHEMATICAL MODELS; STATE SPACE METHODS;

ABSTRACT INTERPRETATION; GALOIS CONNECTIONS; HENNESSY-MILNER LOGIC; POWERDOMAINS; STATE TRANSITION SYSTEMS; UNDERAPPROXIMATION;

FORMAL LOGIC;

EID: 33751091011     PISSN: 01676423     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.scico.2006.03.008     Document Type: Article

References (46)

1. Abramsky S. Abstract interpretation, logical relations, and Kan extensions. J. Logic Comput. 1 (1990) 5-41
2. Abramsky S. Domain theory in logical form. Ann. Pure Appl. Logic 51 (1991) 1-77
3. Blanchet B., et al. Design and implementation of a special-purpose static program analyzer for safety-critical real-time embedded software. In: Mogensen T., Schmidt D., and Sudborough I.H. (Eds). The Essence of Computation. LNCS vol. 2566 (2002), Springer
4. Baader F., et al. The Description Logic Handbook (2003), Cambridge Univ. Press
5. Backhouse K., and Backhouse R. Galois connections and logical relations. Mathematics of Program Construction. LNCS vol. 2386 (2002), Springer-Verlag
6. P. Buneman, S. Davidson, A. Watters, A semantics for complex objects and approximate queries, in: 7th ACM Symp. Principles of Database Systems, 1988
7. Burn G., Hankin C., and Abramsky S. Strictness analysis for higher-order functions. Sci. Comput. Programming 7 (1986) 249-278
8. Clarke E.M., Grumberg O., and Peled D.A. Model Checking (2000), MIT Press
9. Cousot P., and Cousot R. Abstract interpretation: A unified lattice model for static analysis of programs. Proc. 4th ACM Symp. on Principles of Programming Languages (1977), ACM Press 238-252
10. Cousot P., and Cousot R. Systematic design of program analysis frameworks. Proc. 6th ACM Symp. on Principles of Programming Languages (1979), ACM Press 269-282
11. Cousot P., and Cousot R. Abstract interpretation frameworks. J. Logic Comput. 2 (1992) 511-547
12. P. Cousot, R. Cousot, Higher-order abstract interpretation, in: Proceedings IEEE Int. Conf. Computer Lang., 1994
13. D. Dams, Abstract interpretation and partition refinement for model checking, Ph.D. Thesis, Technische Universiteit Eindhoven, The Netherlands, 1996
14. D. Dams, Personal communication, 2004
15. Dams D., Gerth R., and Grumberg O. Abstract interpretation of reactive systems. ACM Trans. Prog. Lang. Systems 19 (1997) 253-291
16. Davey B.A., and Priestly H.A. Introduction to Lattices and Order. second ed. (2002), Cambridge Univ. Press
17. Erné M., Koslowski J., Melton A., and Strecker G. A primer on Galois connections. Summer Conference on General Topology and Applications. Annuals of N.Y. Academy of Sciences vol. 704 (1993) 103-125
18. Giacobazzi R., and Quintarelli E. Incompleteness, counterexamples, and refinements in abstract model checking. Static Analysis Symposium. LNCS vol. 2126 (2001), Springer-Verlag 356-373
19. Giacobazzi R., Ranzato F., and Scozzari F. Making abstract interpretations complete. J. ACM 47 (2000) 361-416
20. Grumberg O., Lerda F., Strichman O., and Theobald M. Proof-guided underapproximation-widening for multi-process systems. Symp. Princ. of Programming Languages (2005), ACM
21. Gunter C. The mixed power domain. Theoret. Comput. Sci. 103 (1992) 311-334
22. Hartmanis J., and Stearns R.E. Pair algebras and their application to automata theory. J. Inf. Control 7 (1964) 485-507
23. Hecht M. Flow Analysis of Computer Programs (1977), Elsevier
24. R. Heckmann, Power domain constructions, Ph.D. Thesis, Univ. Saarbrücken, 1990
25. Heckmann R. Set domains. Proc. European Symp. Programming. LNCS (1990), Springer-Verlag 177-196
26. Hennessy M., and Plotkin G. Full abstraction for a simple parallel programming language. Mathematical Foundations of Computer Science. LNCS vol. 74 (1979), Springer-Verlag 108-120
27. Hennessy M.C.B., and Milner R. Algebraic laws for non-determinism and concurrency. J. ACM 32 (1985) 137-161
28. Huth M., Jagadeesan R., and Schmidt D.A. Modal transition systems: A foundation for three-valued program analysis. Proc. European Symp. Programming. LNCS (2001), Springer-Verlag 155-169
29. Huth M., Jagadeesan R., and Schmidt D.A. A domain equation for refinement of partial systems. Math. Structures Comput. Sci. 14 (2004) 469-505
30. Jones N., and Nielson F. Abstract interpretation: A semantics-based tool for program analysis. In: Abramsky S., Gabbay D., and Maibaum T. (Eds). Handbook of Logic in Computer Science vol. 4 (1995), Oxford Univ. Press 527-636
31. P. Kelb, Model checking and abstraction: A framework preserving both truth and failure information, Technical Report, OFFIS, University of Oldenburg, Germany, 1994
32. Loiseaux C., Graf S., Sifakis J., Bouajjani A., and Bensalem S. Property preserving abstractions for verification of concurrent systems. Form. Methods Syst. Des. 6 (1995) 1-36
33. Milner R. Communication and Concurrency (1989), Prentice-Hall
34. Mycroft A., and Jones N.D. A relational framework for abstract interpretation. Programs as Data Objects. LNCS vol. 217 (1985), Springer-Verlag 156-171
35. Nielson F. Two-level semantics and abstract interpretation. Theoret. Comput. Sci. 69 (1989) 117-242
36. Nielson F., Nielson H.R., and Hankin C. Principles of Program Analysis (1999), Springer-Verlag
37. Park D. Concurrency and Automata in Infinite Strings. Lecture Notes in Computer Science vol. 104 (1981), Springer 167-183
38. Pasäreanu C., Pelánek R., and Visser W. Concrete model checking with abstract matching and refinement. Computer-Aided Verification. CAV'05. LNCS (2005), Springer-Verlag
39. G. Plotkin, Domains, Lecture notes, Univ. Pisa, Edinburgh, 1983
40. Ranzato F., and Tapparo F. Strong preservation as completeness in abstract interpretation. Proc. European Symp. Programming. LNCS vol. 2986 (2004), Springer-Verlag 18-32
41. Ranzato F., and Tapparo F. An abstract-interpretation-based refinement algorithm for strong preservation. Proc. 11th Conf. on Tools and Algs. for Const. and Anal. of Systems. LNCS vol. 3440 (2005), Springer-Verlag 140-156
42. M. Sagiv, T. Reps, R. Wilhelm, Parametric shape analysis via 3-valued logic, in: Proceedings 28th ACM POPL, 1999
43. Schmidt D.A. Structure-preserving binary relations for program abstraction. The Essence of Computation. LNCS vol. 2566 (2002), Springer-Verlag 246-266
44. Schmidt D.A. Closed and logical relations for over- and under-approximation of powersets. In: Giacobazzi R. (Ed). Static Analysis Symposium. SAS'04. LNCS vol. 3148 (2004), Springer-Verlag 22-37
45. Shmuely Z. The structure of Galois connections. Pacific J. Math. 54 (1974) 209-225
46. Smyth M. Powerdomains. J. Comput. System Sci. 16 (1978) 23-36