CPS transformation of flow information

Palsberg, Jens; Wand, Mitchell

doi:10.1017/s0956796802004513

Cited by 17 publications

(34 citation statements)

References 27 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…They attributed increased precision to the duplication of continuations and decreased precision to the confusion of return points. It was later pointed out [43,122], however, that Sabry and Felleisen were comparing a flow-sensitive analysis to a flow-insensitive analysis.…”

Section: Prior Term Transformationmentioning

confidence: 99%

“…They also proved that CPS transformation can improve and does not degrade the precision of binding-time analysis. Independently, Palsberg and Wand [122] proved that a non-duplicating Plotkin-style CPS transformation does not change the precision of a standard constraint-based 0-CFA, a result that Damian and Danvy [42] extended to a 'one-pass' CPS transformation that performs administrative reductions. In conclusion, a duplicating CPS transformation may improve the precision of a 0-CFA and a non-duplicating CPS transformation does not affect its precision.…”

Section: Prior Term Transformationmentioning

confidence: 99%

See 1 more Smart Citation

Control-flow analysis of functional programs

Midtgaard

2012

ACM Comput. Surv.

View full text Add to dashboard Cite

We present a survey of control-flow analysis of functional programs, which has been the subject of extensive investigation throughout the past 25 years. Analyses of the control flow of functional programs have been formulated in multiple settings and have led to many different approximations, starting with the seminal works of Jones, Shivers, and Sestoft. In this paper we survey control-flow analysis of functional programs by structuring the multitude of formulations and approximations and comparing them. * IT-parken,

show abstract

Section: Prior Term Transformationmentioning

confidence: 99%

Section: Prior Term Transformationmentioning

confidence: 99%

Control-flow analysis of functional programs

Midtgaard

2012

ACM Comput. Surv.

View full text Add to dashboard Cite

show abstract

“…A long-standing question in flow analysis is to characterize the impact of CPS transformation on the precision of program analysis [23,39,40]. The study of this question originated in binding-time analysis, for which the transformation is known to have a positive effect [41,40].…”

Section: Related Workmentioning

confidence: 99%

“…Damian and Danvy [40] related the analysis of a program and its CPS counterpart for a standard flowlogic CFA (as well as for two binding-time analyses), and Palsberg and Wand [39] related the analysis of a program and its CPS counterpart for a standard conditional constraint CFA. Hence the latter two fall into the second category.…”

Section: Related Workmentioning

confidence: 99%

Control-flow analysis of function calls and returns by abstract interpretation

Midtgaard

Jensen

2009

SIGPLAN Not.

View full text Add to dashboard Cite

. Control-flow analysis of function calls and returns by abstract interpretation. Information and Computation, Elsevier, 2012, 2012, pp.49-76. 10.1016/j.ic.2011 AbstractAbstract interpretation techniques are used to derive a control-flow analysis for a simple higher-order functional language. The 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, the analysis computes for each expression an abstract call-stack, effectively approximating where function calls return. The analysis is systematically derived by abstract interpretation of the stack-based C a EK abstract machine of Flanagan et al. using a series of Galois connections. We prove that the analysis is equivalent to an analysis obtained by first transforming the program into continuation-passing style and then performing control flow analysis of the transfored program. We then show how the analysis induces an equivalent constraint-based formulation, thereby providing a rational reconstruction of a constraint-based CFA from abstract interpretation principles.

show abstract

“…Meyer and Wand [11] have shown that typability is preserved by CPS transformation, and Damian and Danvy [4] and Palsberg and Wand [25] have shown that a set-based flow analysis is preserved by CPS transformation. Examples of end-to-end type-preserving compilers with proofs include the TIL compiler of Tarditi et al [33] and the compiler from System F to typed assembly language of Morrisett, Walker, Crary, and Glew [13].…”

Section: Correctnessmentioning

confidence: 99%