A logic-based approach to program flow analysis

Acta Informatica

Volumn 35, Issue 6, 1998, Pages 457-504

  Sagiv, Mooly ^a   Francez, Nissim ^b   Rodeh, Michael ^b   Wilhelm, Reinhard ^c  

^a TEL AVIV UNIVERSITY   (Israel)

^b TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

^c SAARLAND UNIVERSITY   (Germany)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0032383388     PISSN: 00015903     EISSN: None     Source Type: Journal    
DOI: 10.1007/s002360050128     Document Type: Article

References (29)

1. A.V. Aho, R. Sethi, J.D. Ullman: Compilers: Principles, Techniques and Tools. Addison-Wesley, 1985.
2. R. Altucher, W. Landi: An Extended Form of Must Alias Analysis for Dynamic Allocation. In ACM Symposium on Principles of Programming Languages, pages 74-84, 1995.
3. J.P. Banning: An Efficient way to find the Side Effects of Procedure Calls and the Aliases of Variables. In ACM Symposium on Principles of Programming Languages, pages 29-41, 1979.
4. K. Cooper: Analyzing Aliases of Reference Formal Parameters. In ACM Symposium on Principles of Programming Languages, pages 281-290, 1985.
5. K. Cooper, K. Kennedy: Fast Intel-procedural Alias Analysis. In ACM Symposium on Principles of Programming Languages, pages 49-59, 1989.
6. P. Cousot, R. Cousot: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction of Approximation of Fixed Points. In ACM Symposium on Principles of Programming Languages, pages 238-252, 1977.
7. P. Cousot, R. Cousot: Systematic Design of Program Analysis Frameworks. In ACM Symposium on Principles of Programming Languages, pages 269-282, 1979.
8. A. Deutsch: Operational Models of Programming Languages and Representations of Relations on Regular Languages with Application to the Static Determination of Dynamic Aliasing Properties of Data. PhD thesis, LIX, The Computer Science Lab of École Polytechnique, 1992.
9. A. Deutsch: A Storeless Model for Aliasing and its Abstractions using Finite Representations of Right-Regular Equivalence Relations. In IEEE International Conference on Computer Languages, pages 2-13, 1992.
10. A. Deutsch: Interprocedural May-Alias Analysis for Pointers: Beyond k-limiting, In SIGPLAN Conference on Programming Languages Design and Implementation, 1994.
11. A. Deutsch: Semantic Models and Abstract Interpretation for Inductive Data Structures and Pointers. In Proc. of ACM Symposium on Partial Evaluation and Semantics-Based Program Manipulation, PEPM'95, pages 226-228, New York, June 1995. ACM Press.
12. M. Emami, R. Ghiya, L. Hendren: Context-sensitive Interprocedural Points-to Analysis in the Presence of Function Pointers. In SIGPLAN Conference on Programming Languages Design and Implementation, 1994.
13. R. Fagin, J. Ullman, G. Kuper, M. Vardi: Updating Logical Databases. Advances in Computing Research, 3:1-18 1986.
14. R. Fagin, J. Ullman, M. Vardi: On the semantics of updates in databases. In ACM Symposium on Principles of Database Systems, pages 352-365, 1983.
15. N. Jones, S. Muchnick: Flow Analysis and Optimization of Lisp-Like Structures. In S. Muchnick, N. Jones, editors, Program Flow Analysis: Theory and Applications, chapter 4, pages 102-131. Prentice-Hall, 1981.
16. G. Kildall: A Unified Approach to Global Program Optimization. In ACM Symposium on Principles of Programming Languages, pages 194-206, 1973.
17. W. Landi: Interprocedural Aliasing in the Presence of Pointers. PhD thesis, Department of Computer Science, Rutgers University, 1991.
18. W. Landi: Undecidability of Static Analysis. ACM Letters on Programming Languages and Systems, 1(4), 1992.
19. W. Landi, B. Ryder: Pointer Induced Aliasing: A problem classification. In ACM Symposium on Principles of Programming Languages, pages 93-103, 1991.
20. J. Larus, P. Hilfinger: Detecting Conflicts between Structure Accesses. In SIGPLAN Conference on Programming Languages Design and Implementation, pages 21-34, 1988.
21. J.W. Lloyd: Foundations of Logic Programming. 2nd edn. Berlin, Heidelberg, New York: Springer 1987.
22. J. Loeckx, K. Sieber: The Foundations of Program Verification. Wiley-Teubner, 1987.
23. E. Myers: A Precise Inter-Procedural Data Flow Algorithm. In ACM Symposium on Principles of Programming Languages, pages 219-230, 1981.
24. F. Nielson: Semantic Foundations of Data Flow Analysis. Technical Report DAIMI PB 131, Aarhus University, Aarhus, Denmark, February 1981
25. G. Ramalingam: The Undecidability of Aliasing. ACM Transactions on Programming Languages and Systems, 16(5): 1467-1471, 1994.
26. M. Rodeh, S. Sagiv: Analyzing Interprocedural Aliases through Pointer Equalities. Technical Report 88.298, IBM Israel Scientific Center, December 1990.
27. M. Sagiv, T. Reps, R. Wilhelm: Solving Shape-Analysis Problems in Languages with Destructive Updating. Technical Report TR-1276, Computer Sciences Department, University of Wisconsin, Madison, WI, July 1995. (Available on the WWW from URL http://www.cs.wisc.edu/trs.html).
28. M. Sagiv, T. Reps, R. Wilhelm: Solving Shape-Analysis Problems in Languages with Destructive Updating. In ACM Symposium on Principles of Programming Languages. ACM, New York, Jan. 1996. (Available on the WWW from URL http://www.cs.wisc.edu/wips/papers/pop196.ps).
29. S. Sagiv, N. Francez, M. Rodeh, R. Wilhelm: A Logic-Based Approach to Data Flow Analysis Problems. In: P. Deransart, J. Maluszynkski (eds.) 2nd Workshop on Programming Language Implementation and Logic Programming (LNCS Vol. 450) Berlin, Heidelberg, New York: Springer 1990.