An equational framework for the flow analysis of higher order functional programs

Authors:
Dan Stefanescu;Yuli Zhou
Affiliations:
105, Aiken Computation Laboratory, Harvard University, 33 Oxford St, Cambridge, MA;NE43-253, MIT Lab for Computer Science, 545 Technology square, Cambridge, MA
Venue:
LFP '94 Proceedings of the 1994 ACM conference on LISP and functional programming
Year:
1994

Citing 17
Cited 11

Compilers: principles, techniques, and tools

Compilers: principles, techniques, and tools
Control flow analysis in scheme

PLDI '88 Proceedings of the ACM SIGPLAN 1988 conference on Programming Language design and Implementation
Automatic autoprojection of higher order recursive equations

Proceedings of the third European symposium on programming on ESOP '90
On determining lifetime and aliasing of dynamically allocated data in higher-order functional specifications

POPL '90 Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Strictness analysis: a new perspective based on type inference

FPCA '89 Proceedings of the fourth international conference on Functional programming languages and computer architecture
A syntactic approach to program transformations

PEPM '91 Proceedings of the 1991 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
A note on abstract interpretation of polymorphic functions

Proceedings of the 5th ACM conference on Functional programming languages and computer architecture
Polyvariant binding-time analysis for applicative languages

PEPM '93 Proceedings of the 1993 ACM SIGPLAN symposium on Partial evaluation and semantics-based program manipulation
Selective and lightweight closure conversion

POPL '94 Proceedings of the 21st ACM SIGPLAN-SIGACT 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
Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints

POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Automata, Languages, and Machines

Automata, Languages, and Machines
Systematic design of program analysis frameworks

POPL '79 Proceedings of the 6th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
A flexible approach to interprocedural data flow analysis and programs with recursive data structures

POPL '82 Proceedings of the 9th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Interprocedural Abstract Interpretation of Block Structured Languages with Nested Procedures, Aliasing and Recursivity

PLILP '90 Proceedings of the 2nd International Workshop on Programming Language Implementation and Logic Programming
A Suite of Analysis Tools Based on a General Purpose Abstract Interpreter

CC '94 Proceedings of the 5th International Conference on Compiler Construction
An Empirical Study of an Abstract Interpretation of Scheme Programs

An Empirical Study of an Abstract Interpretation of Scheme Programs

A unified treatment of flow analysis in higher-order languages

POPL '95 Proceedings of the 22nd ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Catching bugs in the web of program invariants

PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Lightweight closure conversion

ACM Transactions on Programming Languages and Systems (TOPLAS)
Call graph construction in object-oriented languages

Proceedings of the 12th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
From polyvariant flow information to intersection and union types

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Fast interprocedural class analysis

POPL '98 Proceedings of the 25th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Scalable propagation-based call graph construction algorithms

OOPSLA '00 Proceedings of the 15th ACM SIGPLAN conference on Object-oriented programming, systems, languages, and applications
A framework for call graph construction algorithms

ACM Transactions on Programming Languages and Systems (TOPLAS)
From Polyvariant flow information to intersection and union types

Journal of Functional Programming
Flow analysis of lazy higher-order functional programs

Theoretical Computer Science
Control-flow analysis of functional programs

ACM Computing Surveys (CSUR)

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a simple method for the general flow analysis of high-order functional programs. The method computes an abstraction of the program's runtime environment via a system of monotonic equations. As the environment can grow unbounded, we exploit patterns in the program's control structure (i.e., the call-tree) to determine some static partition of the environment, and merge points in the environment belonging to the same equivalent-class. High order functions are handled by embedding control information into closures. The method is proven correct with respect to a rewriting system based operational semantics. Various implementation issues are also considered.