Flemming Nielson
ABSTRACT
This paper provides a link between the formulation of static program analyses using the framework of abstract interpretation (popular for functional languages and using the more classical framework of data flow anlysis (popular for imperative languages). In particular we show how the classical notions of fastness, rapidity and k-boundedness carry over to the abstract interpretation framework and how this may be used to bound the number of times a functional should be unfolded in order to yield the fixed point. This is supplemented with a number of results on how to calculate the bounds for iterative forms (as for tail recursion), for linear forms (as for one nested recursive call), and for primitive recursive forms. In some cases this improves the “worst case” results of, but more importantly it gives much better“average case” results.
- 1.A.V. Aho, R. Sethi, J.D. Ullman: Compilers - Principles, Techniques and Tools, Addison - Wesley (1986). Google Scholar
Digital Library
- 2.R.M. Burstall, J. Darlington: A Transformation System for Developing Recursive Programs, Journal of the A CM 24 i (1977). Google ScholarDigital Library
- 3.A.J. Field, P.G. Harrison: Functional Programming, Addison - Wesley (1988).Google Scholar
- 4.G. Gr~tzer: Lattice Theory- First Concepts and Distributive Lattices, W.H. Freeman and Company (1971).Google Scholar
- 5.T.J. Marlowe, B.G. Ryder: Properties of Data Flow Frameworks - A Unified Model, Acta Informatica 28 (1990). Google ScholarDigital Library
- 6.A. Mycroft: Abstract Interpretation and Optimizing Transformations for Applicative Programs, University of Edinburgh Ph.D.- thesis (1981).Google Scholar
- 7.F. Nielson (editor): Design, Analysis and Reasoning about Tools: Abstracts from the First Workshop, Aarhus University report DAIMI PB-367 (1991).Google Scholar
- 8.F. Nielson: Two-Level Semantics and Abstract Interpretation, Theoretical Computer Science 69 (1989). Google ScholarDigital Library
- 9.H.R. Nielson, F. Nielson: Bounded Fixed Point Iteration, Proceedings of the A CM Symposium on Principles of Programming Languages (1992). Google ScholarDigital Library
- 10.F. Nielson, H.R. Nielson: Finiteness Conditions for Fixed Point Iteration, report DAIMI PB-384, Aarhus University, Denmark (February 1992).Google Scholar
- 11.H.R. Nielson, F. Nielson: Transformations on Higher-Order Functions~ Proceedings FPCA '89 (1989). Google ScholarDigital Library
- 12.P. Wadler, R.J.M. Hughes' Projections for Strictness Analysis, Proceedings FPCA '8% Springer Lecture Notes in Computer Science 274 (1987). Google ScholarDigital Library
Index Terms
- Finiteness conditions for fixed point iteration
Recommendations
Finiteness conditions for fixed point iteration
This paper provides a link between the formulation of static program analyses using the framework of abstract interpretation (popular for functional languages and using the more classical framework of data flow anlysis (popular for imperative languages)...
Mizoguchi-Takahashi's type fixed point theorem
Recently, Eldred [A.A. Eldred, J. Anuradha, P. Veeramani, On equivalence of generalized multi-valued contactions and Nadler's fixed point theorem, J. Math. Anal. Appl. (2007) doi:10.1016/j.jmaa.2007.01.087] claimed that Nadler's [S.B. Nadler Jr., ...
Four functionals fixed point theorem
The Four Functionals Fixed Point Theorem is a generalization of the original, as well as the functional generalizations, of the Leggett-Williams Fixed Point Theorem. In the Four Functionals Fixed Point Theorem, neither the upper nor the lower boundary ...
Comments