Escape Analysis: Correctness Proof, Implementation and Experimental Results

Escape Analysis: Correctness Proof, Implementation and Experimental Results (1998)

by Bruno Blanchet

Venue:	In Conference Record of the 25th Annual ACM Symposium on Principles of Programming Languages
Citations:	59 - 2 self

User correction supplied by SystemCorrections

Datum	Value	Source
TITLE	Escape Analysis: Correctness Proof, Implementation and Experimental Results	INFERENCE
AUTHOR NAME	Bruno Blanchet	SVM HeaderParse 0.1
AUTHOR AFFIL	ENS and INRIA Rocquencourt	SVM HeaderParse 0.2
ABSTRACT	We describe an escape analysis [32, 14], used to determine whether the lifetime of data exceeds its static scope. We give a new correctness proof starting directly from a semantics. Contrary to previous proofs, it takes into account all the features of functional languages, including imperative features and polymorphism. The analysis has been designed so that it can be implemented under the small complexity bound of O(n log 2 n) where n is the size of the analyzed program. We have included it in the Caml Special Light compiler (an implementation of ML), and applied it to very large programs. We plan to apply these techniques to the Java programming language. Escape analysis has been applied to stack allocation. We improve the optimization technique by determining minimal lifetime for stack allocated data, and using inlining. We manage to stack allocate 25% of data in the theorem prover Coq. We analyzed the effect of this optimization, and noticed that its main effect is to improve ...	user correction - Legacy Corrections
YEAR	1998	INFERENCE
VENUE	In Conference Record of the 25th Annual ACM Symposium on Principles of Programming Languages	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	25--37	INFERENCE
CITATIONS	20 found	ParsCit 1.0