论文信息 - A Modular, Extensible Proof Method for Small-Step Flow Analyses

A Modular, Extensible Proof Method for Small-Step Flow Analyses

We introduce a new proof technique for showing the correctness of 0CFA-like analyses with respect to small-step semantics. We illustrate the technique by proving the correctness of 0CFA for the pure ?-calculus under arbitrary s-reduction. This result was claimed by Pals-berg in 1995; unfortunately, his proof was flawed. We provide a correct proof of this result, using a simpler and more general proof method. We illustrate the extensibility of the new method by showing the correctness of an analysis for the Abadi-Cardelli object calculus under small-step semantics.

Mitchell Wand | Galen B. Williamson

[1] Matthias Felleisen,et al. Set-Based Analysis for Full Scheme and Its Use in Soft-Typing , 1995 .

[2] Flemming Nielson,et al. Infinitary control flow analysis: a collecting semantics for closure analysis , 1997, POPL '97.

[3] Martín Abadi,et al. A Theory of Primitive Objects , 1996 .

[4] Flemming Nielson,et al. Control Flow Analysis for the pi-calculus , 1998, CONCUR.

[5] Carolyn L. Talcott,et al. Analysis for concurrent objects , 1997 .

[6] Martín Abadi,et al. A Theory of Primitive Objects - Untyped and First-Order Systems , 1994, TACS.

[7] Peter Sestoft,et al. Replacing function parameters by global variables , 1989, FPCA.

[8] Jens Palsberg,et al. Closure analysis in constraint form , 1995, TOPL.

[9] Walter S. Brainerd,et al. Tree Generating Regular Systems , 1969, Inf. Control..

[10] Olin Shivers,et al. Control-flow analysis of higher-order languages of taming lambda , 1991 .

[11] Alexander Aiken,et al. Constraint-Based Program Analysis (Abstract) , 1996, SAS.

[12] John C. Mitchell,et al. Foundations for programming languages , 1996, Foundation of computing series.