Abstract
Using a suitable notion of powerdomain we extend Abstract Interpretation to deal with partial functions so that non-termination is regarded as a specific value. We use this to validate a data flow analysis aimed at justifying when call-by-name can be implemented as call-by-value.
Preview
Unable to display preview. Download preview PDF.
References
K. Apt, G. Plotkin: A Cook's Tour of Countable Nondeterminism, Proceedings ICALP 1981, Lecture Notes in Computer Science 115, pp. 479–494, (Springer-Verlag, Berlin, 1981).
P. Cousot, R. Cousot: Abstract Interpretation: A Unified Lattice Model for Static Analysis of Programs by Construction or Approximation of Fixpoints, Conf. Record of the 4th ACM Symposium on Principles of Programming Languages, 1977.
P. Cousot, R. Cousot: Static Determination of Dynamic Properties of Recursive Procedures, in: E.J. Neuhold, Ed., Formal Descriptions of Programming Concepts, pp. 237–277, (North-Holland, Amsterdam, 1978).
P. Cousot, R. Cousot: Systematic Design of Program Analysis Frameworks, Conf. Record of the 6th ACM Symposium on Principles of Programming Languages, 1979.
V. Donzeau-Gouge: Utilisation de la Sémantique Dénotationelle Pour l'étude d'Interprétations Non-Standard, Rapport de Recherche, No. 273, INRIA, Rocquencourt, Le Chesnay, France, 1978.
M. Hennessy, G. Plotkin: Full Abstraction for a Simple Parallel Programming Language, Proceedings MFCS 1979, Lecture Notes in Computer Science 74, pp. 108–120, (Springer-Verlag, 1979).
M. Hennessy: Powerdomains and Nondeterministic Recursive Definitions, 5th Int. Symp. on Programming, Lecture Notes in Computer Science 137, (Springer-Verlag, 1982).
N. Jones: Flow Analysis of Lambda Expressions, Proceedings ICALP 1981, Lecture Notes in Computer Science 115, pp. 114–128, (Springer-Verlag, Berlin, 1981).
N. Jones, S. Muchnick: Complexity of Flow Analysis, Inductive Assertion Synthesis and a Language Due to Dijkstra, in S. Muchnick and N. Jones, Eds., Program Flow Analysis: Theory and Applications, pp. 380–393, (Prentice-Hall, New Jersey, 1981).
G. Kildall: A Unified Approach to Global Program Optimization, Conf. Record of ACM Symposium on Principles of Programming Languages, 1973.
J. Kam, J. Ullman: Monotonic Data Flow Analysis Frameworks, Acta Informatica 7, 1977.
R. Milne, C. Strachey: A Theory of Programming Language Semantics, Chapman and Hall, London, 1976.
A. Mycroft: The Theory and Practice of Transforming Call-by-need into Call-by-value. Proc. 4th Int. Symp. on Programming, Lecture Notes in Computer Science 83, (Springer-Verlag, 1980).
A. Mycroft: Abstract Interpretation and Optimising Transformations for Applicative Programs, Ph.D. thesis, University of Edinburgh, 1981.
F. Nielson: A Denotational Framework for Data Flow Analysis, Acta Informatica 18, 265–287 (1982).
F. Nielson: Towards Viewing Nondeterminism as Abstract Interpretation, University of Edinburgh, 1983.
G. Plotkin: A Powerdomain Construction, Siam J. Comput. 5,3 (1976), pp.452–487.
G. Plotkin: A Powerdomain for Countable Nondeterminism, Proceedings ICALP 1982, Lecture Notes in Computer Science 140, pp. 418–428, (Springer-Verlag, Berlin, 1982).
B. Rosen: Monoids for Rapid Data Flow Analysis, Siam J. Comput. 9, 1 (1980).
M. Sharir: Data Flow Analysis of Applicative Programs, Proceedings ICALP 1981, Lecture Notes in Computer Science 115, pp. 98–113, (Springer-Verlag, Berlin, 1981).
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1983 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Mycroft, A., Nielson, F. (1983). Strong abstract interpretation using power domains. In: Diaz, J. (eds) Automata, Languages and Programming. ICALP 1983. Lecture Notes in Computer Science, vol 154. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0036935
Download citation
DOI: https://doi.org/10.1007/BFb0036935
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-12317-0
Online ISBN: 978-3-540-40038-7
eBook Packages: Springer Book Archive