AbstractReasoning about program behaviour in programming languages based on the λ calculus requires reasoning in a unified way about control, data and environment structure. Previous analysis work has done an inadequate job on the environment component of this task. We develop a new analytic framework, ΔCFA, which is based on a new abstraction: frame strings, an enriched variant of procedure strings that can be used to model both control flow and environment allocation. This abstraction enables new environment-sensitive analyses and transformations that have not been previously attainable. We state the critical theorems needed to establish correctness of the entire technology suite, with their proofs
The syntactic theories of control and state are conservative extensions of the λv-calculus for equat...
We show that a non-duplicating transformation into continuation-passing style (CPS) has no effect on...
© 2016 The Author(s) Lambda-SF-calculus can represent programs as closed normal forms. In turn, all ...
AbstractReasoning about program behaviour in programming languages based on the λ calculus requires ...
Any analysis of higher-order languages must grapple with the tri-facetted nature of lambda. In one ...
dissertationControl-flow analysis of higher-order languages is a difficult problem, yet an importan...
dissertationl turns a first-order language into a higher-order one, introducing novel control and en...
AbstractThe syntactic theories of control and state are conservative extensions of the λυ-calculus f...
International audienceAbstract interpretation techniques are used to derive a control-flow analysis ...
We explore a novel approach to higher-order program analysis that brings ideas of on-demand lookup f...
International audienceWe derive a control-flow analysis that approximates the interproce- dural cont...
Scientific models are often expressed as large and complicated programs. These programs embody numer...
This dissertation investigates notions of program equivalence and metric for higher-order sequential...
AbstractScientific models are often expressed as large and complicated programs. These programs embo...
International audienceWe define a small-step semantics for the untyped λ-calculus, that traces the β...
The syntactic theories of control and state are conservative extensions of the λv-calculus for equat...
We show that a non-duplicating transformation into continuation-passing style (CPS) has no effect on...
© 2016 The Author(s) Lambda-SF-calculus can represent programs as closed normal forms. In turn, all ...
AbstractReasoning about program behaviour in programming languages based on the λ calculus requires ...
Any analysis of higher-order languages must grapple with the tri-facetted nature of lambda. In one ...
dissertationControl-flow analysis of higher-order languages is a difficult problem, yet an importan...
dissertationl turns a first-order language into a higher-order one, introducing novel control and en...
AbstractThe syntactic theories of control and state are conservative extensions of the λυ-calculus f...
International audienceAbstract interpretation techniques are used to derive a control-flow analysis ...
We explore a novel approach to higher-order program analysis that brings ideas of on-demand lookup f...
International audienceWe derive a control-flow analysis that approximates the interproce- dural cont...
Scientific models are often expressed as large and complicated programs. These programs embody numer...
This dissertation investigates notions of program equivalence and metric for higher-order sequential...
AbstractScientific models are often expressed as large and complicated programs. These programs embo...
International audienceWe define a small-step semantics for the untyped λ-calculus, that traces the β...
The syntactic theories of control and state are conservative extensions of the λv-calculus for equat...
We show that a non-duplicating transformation into continuation-passing style (CPS) has no effect on...
© 2016 The Author(s) Lambda-SF-calculus can represent programs as closed normal forms. In turn, all ...