Robert Muller
ABSTRACT
We introduce a class of semantic domains, weak powerdomains, that are intended to serve as value spaces for abstract interpretations in which safety is a concern. We apply them to the analysis of PCF programs. In the classical abstract interpretation approach, abstract domains are constructed explicitly and the abstract semantics is then related to the concrete semantics. In the approach presented here, abstract domains are derived directly from concrete domains. The conditions for deriving the domains are intended to be as general as possible while still guaranteeing that the derived domain has sufficient structure so that it can be used as a basis for computing correct information about the concrete semantics. We prove three main theorems, the last of which ensures the correctness of abstract interpretation of PCF programs given safe interpretations of the constants. This generalizes earlier results obtained for the special case of strictness analysis.
- Abr86.S. Abramsky. Strictness analysis and polymorphic invariance. In Programs as Data Objects (H. Ganzinger and N. Jones editors), pages 1-23. Springer-Verlag LNCS Vol. 217, 1986. Google Scholar
Cross Ref
- Abr90.S. Abramsky. Abstract interpretation, logical relations and kan extensions. Journal o/Logic and Computation, 1, 1990.Google Scholar
- Abr91.S. Abramsky. Domain theory in logical form. Annals of Pure and Applied Logic, 51:1-77, 1991.Google ScholarCross Ref
- AJ91.S. Abramsky and T. P. Jensen. A relational approach to strictness analysis for higher-order polymorphic functions. In Proceedings o/ the Eighteenth A CM Symposzum on Principles o/Programming Languages, pages 49-54, 1991. Google ScholarDigital Library
- BHA86.G. Burns, C. Hankin, and S. Abramsky. Strictness analysis for higher-order functions. Science o/Computer Programming, 7:249-278, 1986.Google Scholar
- CC77.P. Cousot and R. Cousot. Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximations of fixpoints. In Proceedings o/the Fourteenth A CM Symposium on Principles of Programming Languages, pages 238-252, 1977. Google ScholarDigital Library
- EM91.C Ernoult and A Mycroft. Uniform ideals and strictness analysis. Ia Proceedings of IUALP'91. Springer-Verlag Lecture Notes in Computer Science, 1991. Google ScholarDigital Library
- HH91.S. Hunt and C. Hankin. Fixed points and frontiers: A new perspective. Journal o/Functional Programming, 1:91-120, 1991.Google Scholar
- HS91.S. Hunt and D. Sands. Binding time analysis: A new perspective. In Proceedings of the Symposium on Partial Evaluation and Semantics-Based Program Manipulation, pages 154-165, 1991. Google ScholarDigital Library
- Hug88.J. Hughes. Abstract interpretation of first-order polymorphic functions. Technical Report 89/R4, University of Glasgow, Department of Computing Science, 1988.Google Scholar
- JC87.S.P. Jones and C. Clack. Finding fixpoints in abstract interpretation, in Abstract Interpretation of Declarative Languages, pages 246-265. Ellis Hotwood Limited, 1987.Google Scholar
- Jen91.T.P. Jensen. Strictness analysis in logical form. In Proceedings of the A CM Conference on Functional Programming Languages and Computer Architecture, pages 352-366, 1991. Google ScholarDigital Library
- JM86.N. Jones and A. Mycroft. Data flow analysis of applicative programs using minimal function graphs. In Proceedings o/the Thirteenth A CM Symposium on Principles of Programming Languages, pages 296-306, 1986. Google ScholarDigital Library
- KM89.T. Kuo and P. Mishra. Strictness analysis: A new perspective based on type inference. In Proceed. zngs o/the A CM Conference on Functional Programming Languages and Computer Architecture, pages 260-272, 1989. Google Scholar
- MJ86.A. Mycroft and N. Jones. A relational framework for abstract interpretation, in Programs as Data Objects (H. Ganzinger and N. jones editors), pages 156-171. Springer-Verlag LNCS Vol. 217, 1986. Google Scholar
- MN83.A. Mycroft and F. Nielson. Strong abstract interpretation using power domains (extended abstract). International Colloquim on Automata, Languages and Programming, Springer- Verlag, Lecture Notes in Computer Science, 154:336-547, 1983. Google ScholarDigital Library
- MPS86.D. MacQueen, G. Plotkin, and R. Sethi. An ideal model for recursive polymorphic types. In/ormation and Computation, 71, No. 1/2:95-130; 1986. Google ScholarDigital Library
- Myc81.A. Mycroft. Abstract Interpretation and Optiraising Trans/ormations .for Applicative Programs. PhD thesis, University of Edinburgh, 1981.Google Scholar
- Nie84.F. Nielson. Abstract Interpretation o} Denotational Definitions. PhD thesis, University of Edinburgh, 1984.Google Scholar
- Nie89.F. Nielson. Two-level semantics and abstract interpretation. Theoretical Computer Science, 69:117-241, 1989. Google ScholarDigital Library
- Plo77.G. Plotkin. LCF considered as a programming language. Theoretical Computer Science, 5:223- 255, 1977.Google ScholarCross Ref
- Sch86.D. Schmidt. Denotational Semantics: .4 Methodology/or Language Development. Allyn and Bacon, 1986. Google ScholarDigital Library
- SW77.A. Shamir and W. Wadge. Data types; as objects. In ~th Colloquium on Automata, Languages and Programming, Lecture Notes in Computer Science, Volume 52, pages 465-479, 1977. Google ScholarDigital Library
- Wad86.P. Wadler. Strictness analysis on non-fiat domains (by abstract interpretation over finite domains). In Abstract Interpretation o/Declarative Languages, pages 266-275. Ellis Horwood Limited, 1986.Google Scholar
Index Terms
- Abstract interpretation in weak powerdomains
Recommendations
Abstract interpretation in weak powerdomains
We introduce a class of semantic domains, weak powerdomains, that are intended to serve as value spaces for abstract interpretations in which safety is a concern. We apply them to the analysis of PCF programs. In the classical abstract interpretation ...
Characterizing Consistent Smyth Powerdomains by FS--domains
In this paper, we introduce FS--domains, and show that the category with FS--domains as objects and Scott continuous functions as morphisms is a Cartesian closed category. Moreover, we characterize the consistent Smyth powerdomain over a Lawson compact ...
Comments