Control-flow analysis of function calls and returns by abstract interpretation

Information and Computation

Volumn 211, Issue , 2012, Pages 49-76

  Midtgaard, Jan ^a   Jensen, Thomas P ^b  

^a AARHUS UNIVERSITY   (Denmark)

^b INRIA   (France)

Author keywords

Abstract interpretation; Control flow analysis

Indexed keywords

ABSTRACT INTERPRETATION TECHNIQUES; ABSTRACT INTERPRETATIONS; ABSTRACT MACHINES; CONSTRAINT-BASED; CONTINUATION-PASSING STYLE; CONTROL-FLOW; CONTROL-FLOW ANALYSIS; FUNCTION CALLS; FUNCTIONAL LANGUAGES; GALOIS CONNECTION; HIGHER ORDER; INTER-PROCEDURAL; RATIONAL RECONSTRUCTION;

COMPUTATIONAL METHODS; INFORMATION SYSTEMS;

ABSTRACTING;

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

References (45)

1. N.D. Jones, Flow analysis of lambda expressions, Technical Report PB-128, Aarhus University, Aarhus, Denmark, 1981.
2. N.D. Jones Flow analysis of lambda expressions (preliminary version) S. Even, O. Kariv, Automata, Languages and Programming, 8th Colloquium, Acre (Akko) Lecture Notes in Comput. Sci. vol. 115 1981 Springer-Verlag Israel 114 128
3. A.E. Ayers, Abstract analysis and optimization of scheme, PhD thesis, Massachusetts Institute of Technology, Cambridge, Massachusetts, 1993.
4. O. Shivers, Control-flow analysis in scheme, in: M.D. Schwartz (Ed.), Proceedings of the ACM SIGPLAN 1988 Conference on Programming Languages Design and Implementation, Atlanta, Georgia, pp. 164-174.
5. P. Sestoft, Replacing function parameters by global variables, Masters thesis, DIKU, Computer Science Department, University of Copenhagen, Copenhagen, Denmark, 1988.
6. F. Nielson, H.R. Nielson, Infinitary control flow analysis: a collecting semantics for closure analysis, in: N.D. Jones (Ed.), Proceedings of the 24th Annual ACM Symposium on Principles of Programming Languages, Paris, France, 1997, pp. 332-345.
7. J. Midtgaard, Control-flow analysis of functional programs, ACM Comput. Surv. (2012), in press.
8. P. Cousot The calculational design of a generic abstract interpreter M. Broy, R. Steinbrüggen, Calculational System Design NATO ASI Series F 1999 IOS Press Amsterdam
9. C. Flanagan, A. Sabry, B.F. Duba, M. Felleisen, The essence of compiling with continuations, in: D.W. Wall (Ed.), Proceedings of the ACM SIGPLAN 1993 Conference on Programming Languages Design and Implementation, Albuquerque, New Mexico, pp. 237-247.
10. J. Midtgaard, and T. Jensen A calculational approach to control-flow analysis by abstract interpretation M. Alpuente, G. Vidal, Static Analysis, 15th International Symposium, SAS 2008 Lecture Notes in Comput. Sci. vol. 5079 2008 Springer-Verlag Valencia, Spain 347 362
11. J. Midtgaard, T.P. Jensen, Control-flow analysis of function calls and returns by abstract interpretation, in: G. Hutton, A.P. Tolmach (Eds.), Proceedings of the 14th ACM SIGPLAN International Conference on Functional Programming (ICFP09), Edinburgh, Scotland, pp. 287-298.
12. P. Cousot, R. Cousot, Systematic design of program analysis frameworks, in: B.K. Rosen (Ed.), Proceedings of the Sixth Annual ACM Symposium on Principles of Programming Languages, San Antonio, Texas, pp. 269-282.
13. P. Cousot Semantic foundations of program analysis S.S. Muchnick, N.D. Jones, Program Flow Analysis: Theory and Applications 1981 Prentice-Hall 303 342
14. P. Cousot, and R. Cousot Abstract interpretation and application to logic programs J. Log. Program. 13 1992 103 179
15. P. Cousot, R. Cousot, Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages), invited paper, in: H. Bal (Ed.), Proceedings of the Fifth IEEE International Conference on Computer Languages, Toulouse, France, 1994, pp. 95-112.
16. B.A. Davey, and H.A. Priestley Introduction to Lattices and Order second edition 2002 Cambridge University Press Cambridge, England
17. P. Cousot, and R. Cousot Abstract interpretation of algebraic polynomial systems M. Johnson, Proceedings of the Sixth International Conference on Algebraic Methodology and Software Technology, AMAST97 Lecture Notes in Comput. Sci. vol. 1349 1997 Springer-Verlag Sydney, Australia 138 154 (Pubitemid 128006374)
18. P. Cousot, and R. Cousot Abstract interpretation frameworks J. Logic Comput. 2 1992 511 547
19. R. Giacobazzi, F. Ranzato, and F. Scozzari Making abstract interpretations complete J. ACM 47 2000 361 416
20. J.C. Reynolds Definitional interpreters for higher-order programming languages Higher-Order and Symbolic Computation 11 1998 363 397 reprinted from the proceedings of the 25th ACM National Conference, 1972 (Pubitemid 128513234)
21. F. Nielson, H.R. Nielson, and C. Hankin Principles of Program Analysis 1999 Springer-Verlag
22. P.J. Landin The mechanical evaluation of expressions Comput. J. 6 1964 308 320
23. A. Sabry, M. Felleisen, Is continuation-passing useful for data flow analysis?, in: V. Sarkar (Ed.), Proceedings of the ACM SIGPLAN 1994 Conference on Programming Languages Design and Implementation, Orlando, Florida, 1994, pp. 1-12.
24. R. Milner, and M. Tofte Co-induction in relational semantics Theoret. Comput. Sci. 87 1991 209 220 (Pubitemid 21710406)
25. A.E. Ayers Efficient closure analysis with reachability M. Billaud, P. Castéran, M.-M. Corsini, K. Musumbu, A. Rauzy, Actes WSA92 Workshop on Static Analysis 1992 Bigre, Atelier Irisa, IRISA, Campus de Beaulieu Bordeaux, France 126 134
26. J. Palsberg, and M.I. Schwartzbach Safety analysis versus type inference Inform. and Comput. 118 1995 128 141
27. S.K. Biswas, A demand-driven set-based analysis, in: N.D. Jones (Ed.), Proceedings of the 24th Annual ACM Symposium on Principles of Programming Languages, Paris, France, 1997, pp. 372-385.
28. K.L.S. Gasser, F. Nielson, H.R. Nielson, Systematic realisation of control flow analyses for CML, in: M. Tofte (Ed.), Proceedings of the Second ACM SIGPLAN International Conference on Functional Programming, Amsterdam, The Netherlands, pp. 38-51.
29. J. Palsberg Closure analysis in constraint form ACM Trans. Program. Lang. Syst. 17 1995 47 62
30. D. Cachera, T. Jensen, D. Pichardie, and V. Rusu Extracting a data flow analyser in constructive logic Theoret. Comput. Sci. 342 2005 56 78 (Pubitemid 41162455)
31. O. Danvy, Three steps for the CPS transformation, Technical Report CIS-92-2, Kansas State University, Manhattan, Kansas, 1991.
32. A. Deutsch, On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications, in: P. Hudak (Ed.), Proceedings of the Seventeenth Annual ACM Symposium on Principles of Programming Languages, San Francisco, California, 1990, pp. 157-168. (Pubitemid 20681749)
33. P. Cousot, R. Cousot, Static determination of dynamic properties of programs, in: Proceedings of the Second International Symposium on Programming, Dunod, Paris, France, 1976, pp. 106-130.
34. G. Kildall, A unified approach to global program optimization, in: J.D. Ullman (Ed.), Proceedings of the First Annual ACM Symposium on Principles of Programming Languages, Boston, Massachusetts, 1973, pp. 194-206.
35. P. Sestoft, Replacing function parameters by global variables, in: J.E. Stoy (Ed.), Proceedings of the Fourth International Conference on Functional Programming Languages and Computer Architecture, London, England, pp. 39-53.
36. N. Heintze, Set-based program analysis of ML programs, in: C.L. Talcott (Ed.), Proceedings of the 1994 ACM Conference on Lisp and Functional Programming, LISP Pointers, vol. VII, No. 3, Orlando, Florida, 1994, pp. 306-317.
37. J.M. Ashley, and R.K. Dybvig A practical and flexible flow analysis for higher-order languages ACM Trans. Program. Lang. Syst. 20 1998 845 868 (Pubitemid 128445832)
38. M. Might, O. Shivers, Environmental analysis via ΔCFA, in: S. Peyton Jones (Ed.), Proceedings of the 33rd Annual ACM Symposium on Principles of Programming Languages, Charleston, South Carolina, pp. 127-140.
39. J. Palsberg, and M. Wand CPS transformation of flow information J. Funct. Programming 13 2003 905 923 (Pubitemid 37080029)
40. D. Damian, and O. Danvy Syntactic accidents in program analysis: On the impact of the CPS transformation J. Funct. Programming 13 2003 867 904 a preliminary version was presented at the 2000 ACM SIGPLAN International Conference on Functional Programming (Pubitemid 37080028)
41. C. Consel, and O. Danvy For a better support of static data flow J. Hughes, Proceedings of the Fifth ACM Conference on Functional Programming Languages and Computer Architecture Lecture Notes in Comput. Sci. vol. 523 1991 Springer-Verlag Cambridge, Massachusetts 496 519
42. F. Spoto, and T.P. Jensen Class analyses as abstract interpretations of trace semantics ACM Trans. Program. Lang. Syst. 25 2003 578 630 (Pubitemid 41283896)
43. S.K. Debray, and T.A. Proebsting Interprocedural control flow analysis of first-order programs with tail-call optimization ACM Trans. Program. Lang. Syst. 19 1997 568 585 (Pubitemid 127447771)
44. H.R. Nielson, and F. Nielson Flow logic: a multi-paradigmatic approach to static analysis T.Æ. Mogensen, D.A. Schmidt, I.H. Sudborough, The Essence of Computation: Complexity, Analysis, Transformation. Essays Dedicated to Neil D. Jones Lecture Notes in Comput. Sci. vol. 2566 2002 Springer-Verlag 223 244 (Pubitemid 36185937)
45. D. Pichardie, Interprétation abstraite en logique intuitioniste: extraction danalyseurs Java certifiés, PhD thesis, Université de Rennes 1, 2005.