Interprocedural analyses: a comparison

Journal of Logic Programming

Volumn 43, Issue 2, 2000, Pages 123-156

  Seidl, Helmut ^a   Fecht, Christian ^b  

^a UNIVERSITY OF TRIER   (Germany)

^b SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

APPROXIMATION THEORY; AUTOMATA THEORY; COMPUTATIONAL LINGUISTICS; FUNCTION EVALUATION; LOGIC PROGRAMMING; PROCEDURE ORIENTED LANGUAGES;

COINCIDENCE THEOREMS; INTERPROCEDURAL ANALYSIS; PUSHDOWN AUTOMATA; REACHABILITY ANALYSIS; RELATIONAL ANALYSIS;

PROGRAM DIAGNOSTICS;

EID: 0034190424     PISSN: 07431066     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-1066(99)00058-8     Document Type: Article

References (51)

1. M. Alt, F. Martin, Generation of efficient interprocedural analyzers with PAG, in: Proceedings of the Seconnd Static Analysis Symposium (SAS), LNCS 983, Springer, Berlin, 1995, pp. 33-50.
2. F. Bourdoncle, Interprocedural abstract interpretation of block-structured languages with nested procedures, aliasing and recursivity, in: International Workshop on Programming Language Implementation and Logic Programming (PLILP), LNCS 456, Springer, Berlin, 1990, pp. 307-323.
3. F. Bourdoncle, Abstract interpretation by dynamic partioning, Journal of Functional Programming 2 (4) (1992) 407-435.
4. F. Bourdoncle, Sémantiques des Langages Impératifs d'Ordre Supérieur et Interprétation Abstraite Ph.D. thesis, École Polytechnique, Paris, 1992.
5. B. Le Charlier, A. Cortesi, P. Van Hentenryck, Evaluation of the domain Prop, Journal of Logic Programming 23 (3) (1995) 237-278.
6. B. Le Charlier, P. Van Hentenryck, A universal top-down fixpoint algorithm, Technical Report CS-92-25, Brown University, Providence, RI 02912, 1992.
7. B. Le Charlier, P. VanHentenryck, A generic fixpoint semantics for Prolog and its application for abstract interpretation, Technical Report, Institute of Computer Science, University of Namur, Belgium, (also Brown University), January 1993. Presented at the LOPSTR'93-COMPUNET Program Development Joint Workshop, Louvain la Neuve, Belgium, July 1993, Published in Proc. of JFLP'95, Dijon, France, June 1995.
8. B. Le Charlier, P. Van Hentenryck, Experimental evaluation of a generic abstract interpretation algorithm for Prolog, ACM Transactions of Programming Languages and Systems (TOPLAS) 16 (1) (1994) 35-101.
9. B. Le Charlier, S. Rossi, P. VanHentenryck, An abstract interpretation framework which accurately handles Prolog search-rule and the cut, in: M. Bruynooghe (Ed.), Proceedings of the International Logic Programming Symposium (ILPS'94), Ithaca NY, USA, November 1994, MIT Press, Cambridge, MA.
10. A. Cortesi, G. Filé, W.H. Winsborough, Optimal groundness analysis using propositional logic, Journal of Logic Programming 27 (2) (1996) 137-167.
11. P. Cousot, Semantic foundations of program analysis, in: S.S. Muchnick, N.D. Jones (Eds.), Program Flow Analysis: Theory and Applications, ch. 10, Prentice-Hall, Englewood Cliffs, NJ, 1981, pp. 303-342.
12. P. Cousot, R. Cousot, Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints, in: Proceedings of the Fourth ACM Symposium on Principles of Programming Languages (POPL), ACM Press, New York, 1977, pp. 238-252.
13. P. Cousot, R. Cousot, Static determination of dynamic properties of recursive programs, in: E.J. Neuhold (Ed.), Formal Descriptions of Programming Concepts, North-Holland, Amesterdam, 1977, pp. 237-277.
14. P. Cousot, R. Cousot, Abstract interpretation and application to logic programs, Journal of Logic Programming 13 (2/3) 1992.
15. P. Cousot, R. Cousot, Higher-order abstract interpretation (and application to comportment analysis generalizing strictness, termination, projection and PER analysis of functional languages), in: Proceedings of the International IEEE Conference on Computer Languages (ICCL), 1994, pp. 95-112.
16. Eric Villemonte de la Clergerie, Automates à Piles et Programmation Dynamique: DyALog, Application à la Programmation en Logique, Ph.D. thesis, Université Paris VII, Paris, France, June 1993.
17. E. Villemonte de la Clergerie, F. Barthélemy, Information flow in tabular interpretations for generalized pushdown automata, Theoretical Computer Science 199 (1/2) (1998) 167-198.
18. S.K. Debray, Todd Proebsting, Inter-procedural control flow analysis of first order programs with tail call optimization, ACM Transactions on Programming Languages and Systems (TOPLAS) 19(4) (1997) 568-585.
19. A. Deutsch, On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications, in: Proceedings of the 17th ACM Symposium on Principles of Programming Languages (POPL), ACM Press, New York, 1990, pp. 157-168.
20. V. Englebert, B. Le Charlier, D. Roland, P. Van Hentenryck, Generic abstract interpretation algorithms for Prolog: two optimization techniques and their experimental evaluation, Software -Practice and Experience 23 (4) (1993) 419-459.
21. C. Fecht, Abstrakte Interpretation logischer Programme: Theorie, Implementierung, Generierung, Ph.D. thesis, Universität des Saarlandes, Saarbrücken, 1997.
22. C. Fecht, H. Seidl, An even faster solver for general systems of equations, in: Proceedings of the Third Static Analysis Symposium (SAS), LNCS 1145, Springer, Berlin, 1996, pp. 189-204. Long version to appear in Science of Computer Programming (SCP).
23. C. Fecht, H. Seidl, Propagating differences: an efficient new fixpoint algorithm for distributive constraint systems, in: European Symposium on Programming (ESOP), LNCS 1381, Springer, Berlin, 1998, pp. 90-104 Long version in Northern Journal of Computing 5 (1998) 304-329.
24. C. Fecht, H. Seidl, Propagating differences: an efficient new fixpoint algorithm for distributive constraint systems, in: European Symposium on Programming (ESOP), LNCS 1381, Springer, Berlin, 1998, pp. 90-104 Long version in Northern Journal of Computing 5 (1998) 304-329.
25. G. Filé, F. Ranzato, Improving abstract interpretations by systematic lifting to the powerset, in: Proceedings of the International Symposium on Logic Programming (SLP), MIT Press, Cambridge, MA, 1994, pp. 655-669.
26. M.S. Hecht, Flow Analysis of Computer Programs, Elsevier, Amsterdam, 1977.
27. P. Van Hentenryck, O. Degimbe, B. Le Charlier, L. Michel, Abstract Interpretation of Prolog Based on OLDT Resolution, Technical Report CS-93-05, Brown University, Providence, RI 02912, 1993.
28. P. Van Hentenryck, O. Degimbe, B. Le Charlier, L. Michel, The impact of granularity in abstract interpretation of Prolog, in: Proceedings of the Static Analysis, Third International Workshop (WSA), LNCS 724, Springer, Berlin, 1993, pp. 1-14.
29. S. Horwitz, T.W. Reps, M. Sagiv, Precise interprocedural dataflow analysis via graph reachability, in: Proceedings of the 22nd ACM Symposium on Principles of Programming Languages (POPL), ACM Press, New York, 1995, pp. 49-61.
30. S. Horwitz, T.W. Reps, M. Sagiv, Precise interprocedural dataflow analysis with applications to constant propagation, in: Proceedings of the Sixth International Conference on Theory and Practice of Software Development (TAPSOFT), LNCS 915, Springer, Berlin, 1995, pp. 651-665.
31. S. Horwitz, T.W. Reps, M. Sagiv, Precise interprocedural dataflow analysis with applications to constant propagation, Theoretical Computer Science 167 (1/2) (1996) 131-170.
32. J. Hughes, J. Launchbury, Reversing abstract interpretations, Science of Computer Programming (SCP) 22 (1994) 307-326.
33. D. Jacobs, A. Langen, Static analysis of logic programs for independent AND parallelism, Journal of Logic Programming 13 (1992) 291-314.
34. N.D. Jones, S.S. Muchnick, A flexible approach to interprocedural data flow analysis and programs with recursive data structures, in: Proceedings of the Ninth ACM Symposium on Principles of Programming Languages (POPL), ACM Press, New York, 1982, pp. 66-74.
35. N.D. Jones, A. Mycroft, Data flow analysis of applicative programs using minimal function graphs, in: Proceedings of the 13th ACM Symposium on Principles of Programming Languages (POPL), ACM Press, New York, 1986, pp. 296-306.
36. T. Kanamori, T. Kawamura, Abstract interpretation based on OLDT resolution, Journal of Logic Programming 15(1/2) (1993) 1-30.
37. J. Knoop, O. Rüthing, B. Steffen, Towards a tool kit for the automatic generation of interprocedural data flow analyses, Journal of Programming Languages 4 (1996) 211-246.
38. J. Knoop, B. Steffen, The interprocedural coincidence theorem, in: Proceedings of the Fourth International Conference on Compiler Construction, LNCS 641, Springer, Berlin, 1992, pp. 125-140.
39. A. Krall, T. Berger, Incremental global compilation of Prolog with the Vienna abstract machine, in: International Conference on Logic Programming (ICLP), MIT Press, Cambridge, MA, 1995, pp. 333-347.
40. B. Lang, Complete Evaluation of Horn Clauses: an Automata Theoretic Approach, Technical Report 913, INRIA, 1988.
41. K. Marriott, H. Søndergaard, Precise and efficient groundness analysis for logic programs, ACM Letters on Programming Languages and Systems (LOPLAS 2 (1993) 181-196.
42. K. Marriott, H. Søndergaard, N.D. Jones, Denotational abstract interpretation of logic programs, ACM Transactions of Programming Languages and Systems (TOPLAS) 16 (3) (1994) 607-648.
43. F. Martin, M. Alt, R. Wilhelm, Analysis of loops, in: Proceedings of the Compiler Construction, Seventh International Conference, LNCS 1383, Springer, Berlin, 1998, pp. 80-94.
44. U. Nilsson, Systematic semantic approximations of logic programs, in: International Workshop on Programming Language Implementation and Logic Programming (PLILP), LNCS 456, Springer, Berlin, 1990, pp. 293-306.
45. T.W. Reps, Personal Communication, February 1997.
46. T. Sato, H. Tamaki, OLD resolution with tabulation, in: E.Y. Shapiro (Ed.), Proceedings of the Third International Conference on Logic Programming (ICLP), LNCS 225, Springer, Berlin, 1986, pp. 84-98.
47. D.A. Schmidt, Abstract interpretation of small-step semantics, in: M. Dam (Ed.) Proceedings of the Fifth LOMAPS Workshop on Analysis and Verification of Multiple-Agent Languages, LNCS 1192, Springer, Berlin, 1996.
48. H. Seidl, C. Fecht, Disjunctive completion is not "optimal", in: International Logic Programming Symposium (ILPS), MIT Press, Cambridge, MA, 1997, p. 408.
49. H. Seidl, C. Fecht, Interprocedural analysis based on PDAs, in: Verification, Model Checking and Abstract Interpretation, A Workshop in Association with ILPS'97, 1997.
50. M. Sharir, A. Pnueli, Two approaches to interprocedural data flow analysis, in: S.S. Muchnick, N.D. Jones (Eds), Program Flow Analysis: Theory and Applications, ch. 7, Prentice-Hall, Englewood Cliffs, NJ, 1981, pp. 189-234.
51. H. Søndergaard, An application of abstract interpretation of logic programs: occur check reduction, in: Proceedings of the First European Symposium on Programming (ESOP), LNCS 213, Springer, Berlin, 1986, pp. 327-338.