Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
This work was supported by Esprit B.R.A., action 3124 “Sémantique”.
Preview
Unable to display preview. Download preview PDF.
References
Samson Abramsky and Chris Hankin: “Abstract Interpretation of Declarative Languages”, Ellis Horwood Books in Computing Science (1987)
Aho, Sethi, Ullman: “Compilers — Principles, Techniques and Tools”, Addison-Wesley Publishing Company (1986)
John P. Banning: “An Efficient Way to Find the Side Effects of Procedure Calls and the Aliases of Variables” in Proc. of the 6th ACM Symp. on POPL (1979)
E.M. Clarke “Programming languages constructs for which it is impossible to obtain good Hoare axiom systems” in Proc. of the 4th ACM Symp. on POPL, pp 129–147 (1977)
E.M. Clarke “The characterization problem for Hoare logic” in Phil. Trans. R. Soc. Lond., pp 423–440
Patrick and Radhia Cousot: “Abstract Interpretation: a unified lattice model for static analysis of programs by construction of approximative fixpoints” in Proc. of the 4th ACM Symp. on POPL (1977)
Patrick and Radhia Cousot: “Static determination of dynamic properties of recursive procedures” in Formal Description of Programming Concepts, North Holland Publishing Company, pp 237–277 (1978)
Patrick Cousot: “Semantic foundations of program analysis” in Muchnick and Jones Eds., Program Flow Analysis, Theory and Applications, Prentice-Hall (1981)
Patrick Cousot and Nicolas Halbwachs: “Automatic discovery of linear constraints among variables of a program”, in Proc. of the 5th ACM Symp. on POPL, pp 84–97 (1978)
Alan J. Demers, Anne Neirynck, Prakash Panangaden: “Computation of Aliases and Support Sets” in Proc. of the 14th ACM Symp. on POPL (1987)
Philippe Granger: “Static analysis of arithmetical congruences”, in International Journal of Computer Mathematics, pp 165–190 (1989)
Philippe Granger: “Static analysis of linear congruences among variables of a program”, L.I.X. Internal Report (to appear)
Neil Jones and Steven Muchnick: “A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures”, in Proc. of the 9th ACM Symp. on POPL (1982)
Gordon D. Plotkin: “A structural approach to operational semantics” Aarhus University Internal Report, Denmark, (September 1981)
Micha Sharir, Amir Pnueli: “Two Approaches to Interprocedural Data Flow Analysis” in Muchnick and Jones Eds., Program Flow Analysis, Theory and Applications, Prentice-Hall (1981)
G.A. Venkatesh: “A Framework for Construction and Evaluation of Highlevel Specifications for Program Analysis Techniques”, in Proc. of SIGPLAN '89 Conference on Programming Language Design and Implementation (1989)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Bourdoncle, F. (1990). Interprocedural abstract interpretation of block structured languages with nested procedures, aliasing and recursivity. In: Deransart, P., Maluszyński, J. (eds) Programming Language Implementation and Logic Programming. PLILP 1990. Lecture Notes in Computer Science, vol 456. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0024192
Download citation
DOI: https://doi.org/10.1007/BFb0024192
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53010-7
Online ISBN: 978-3-540-46298-9
eBook Packages: Springer Book Archive