Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Projections for strictness analysis
Proc. of a conference on Functional programming languages and computer architecture
Transformations on higher-order functions
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
A composition approach to time analysis of first order lazy functional programs
FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
Properties of data flow frameworks: a unified model
Acta Informatica
Semantics with applications: a formal introduction
Semantics with applications: a formal introduction
Higher-order strictness analysis in untyped lambda calculus
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Data flow analysis of applicative programs using minimal function graphs
POPL '86 Proceedings of the 13th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Finiteness conditions for fixed point iteration
LFP '92 Proceedings of the 1992 ACM conference on LISP and functional programming
Precise interprocedural dataflow analysis via graph reachability
POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the complexity of escape analysis
Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
On the complexity of flow-sensitive dataflow analyses
Proceedings of the 27th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Efficient abstract interpretation using component-wise homomorphisms
Proceedings of the 2nd ACM SIGPLAN international conference on Principles and practice of declarative programming
Logic Programs as Compact Denotations
PADL '03 Proceedings of the 5th International Symposium on Practical Aspects of Declarative Languages
A New Class of Functions for Abstract Interpretation
SAS '99 Proceedings of the 6th International Symposium on Static Analysis
NostraXtalk: a predictive framework for accurate static timing analysis in udsm vlsi circuits
Proceedings of the 17th ACM Great Lakes symposium on VLSI
Logic programs as compact denotations
Computer Languages, Systems and Structures
| Hi-index | 0.00 |
In the context of abstract interpretation we study the number of times a functional need to be unfolded in order to give the least fixed point. For the cases of the total or monotone functions we obtain an exponential bound and in the case of strict and additive (or distributive) functions we obtain a quadratic bound. These bounds are shown to be tight. Specialising the case of strict and additive functions to functionals of a form that would correspond to iterative programs we show that a linear bound is tight. We demonstrate the relation to several analyses studied in the literature (including strictness analysis).