Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis (1997)
| Citations: | 59 - 8 self |
BibTeX
@INPROCEEDINGS{Nielson97infinitarycontrol,
author = {Flemming Nielson and Hanne Riis Nielson},
title = {Infinitary Control Flow Analysis: a Collecting Semantics for Closure Analysis},
booktitle = {},
year = {1997},
pages = {332--345},
publisher = {ACM Press}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
Defining the collecting semantics is usually the first crucial step in adapting the general methodology of abstract interpretation to the semantic framework or programming language at hand. In this paper we show how to define a collecting semantics for control flow analysis; due to the generality of the formulation we need to appeal to coinduction (or greatest fixed points) in order to define the analysis. We then prove the semantic soundness of the collecting semantics and that all totally deterministic instantiations have a least solution; this incorporates k-CFA, polymorphic splitting and a new class of uniform-k-CFA analyses. 1 Introduction Control flow analysis [16, 17] is known by many names: closure analysis [13, 15], set-based analysis [9] (touching upon other constraint-based analyses [1]), and flow analysis [6]. Although the fine formulational details differ they are all variations over a theme, producing analyses of di#erent precision: 0-CFA [16], k-CFA [16, 10], poly-k-CF...
