Control-Flow Analysis of Function Calls and Returns by Abstract Interpretation - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Research Report) Year : 2008

Control-Flow Analysis of Function Calls and Returns by Abstract Interpretation

Abstract

We derive a control-flow analysis for a simple higher-order functional language. Contrary to existing direct-style analyses, our analysis approximates the interprocedural control-flow of both function calls and returns in the presence of first-class functions and tail-call optimization. In addition to an abstract environment, our analysis computes for each expression an abstract call-stack, effectively approximating where function calls return. The analysis is systematically calculated by abstract interpretation of the stack-based CaEK abstract machine of Flanagan et al. using a series of Galois connections. From the analysis we extract an equivalent constraint-based formulation, thereby providing a rational reconstruction of a constraint-based CFA from abstract interpretation principles.
Fichier principal
Vignette du fichier
midtgaard-jensen-rr.pdf (375.15 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

inria-00328154 , version 1 (09-10-2008)
inria-00328154 , version 2 (10-10-2008)
inria-00328154 , version 3 (29-07-2009)

Identifiers

  • HAL Id : inria-00328154 , version 1

Cite

Jan Midtgaard, Thomas P. Jensen. Control-Flow Analysis of Function Calls and Returns by Abstract Interpretation. [Research Report] 2008. ⟨inria-00328154v1⟩

Collections

INRIA-RRRT
420 View
448 Download

Share

Gmail Mastodon Facebook X LinkedIn More