article · 2005

Type-sensitive control-flow analysis

Cited by 0Abstract and details only

Abstract

Higher-order typed languages, such as ML, provide strong support for data and type abstraction. While such abstraction is often viewed as costing performance, there are situations where it may provide opportunities for more aggressive program optimization. Specifically, we can exploit the fact that type abstraction guarantees representation independence, which allows the compiler to specialize data representations. This paper describes a first step in supporting such optimizations; namely a modular control-flow analysis that uses the program’s type information to compute more precise results. We present our algorithm as an extension of Serrano’s version of 0-CFA and we show that it respects types. We also discuss applications of the analysis with a specific focus on optimizing Concurrent ML programs. 1

Cite this paper

APA 7

(2005). Type-sensitive control-flow analysis.

MLA 9

“Type-sensitive control-flow analysis.” 2005.

Chicago

2005. “Type-sensitive control-flow analysis.”

Harvard

(2005) ‘Type-sensitive control-flow analysis’.

BibTeX

@article{anon2005type,
  title = {{Type-sensitive control-flow analysis}},
  year = {2005}
}

Made from the index record. Check names, capitalisation and page numbers against the paper. Need another style? AI for Research has over 10,000.