Trace-Based Control-Flow Analysis - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

Trace-Based Control-Flow Analysis


We define a small-step semantics for the untyped λ-calculus, that traces the β-reductions that occur during evaluation. By abstracting the computation traces, we reconstruct-CFA using abstract interpretation, and justify constraint-based-CFA in a semantic way. The abstract interpretation of the trace semantics also paves the way for introducing widening operators in CFA that go beyond existing analyses, that are all based on exploring a finite state space. We define ∇CFA, a widening-based analysis that limits the cycles in call stacks, and can achieve better precision than-CFA at a similar cost.
Fichier principal
Vignette du fichier
pldi21main-p165-p-e884afc4e7-51105-final.pdf (311.52 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03266981 , version 1 (22-06-2021)



Benoît Montagu, Thomas Jensen. Trace-Based Control-Flow Analysis. PLDI 2021 - 42nd ACM SIGPLAN International Conference on Programming Language Design and Implementation, Jun 2021, Virtual, Canada. pp.1-15, ⟨10.1145/3453483.3454057⟩. ⟨hal-03266981⟩
178 View
443 Download



Gmail Mastodon Facebook X LinkedIn More