Abstract
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 β-reduction. This result was claimed by Palsberg 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.
Chapter PDF
References
M. Abadi and L. Cardelli. A theory of primitive objects: Untyped and first-order systems. Information and Computation, 125(2):78–102, Mar. 1996.
A. Aiken and N. Heintze. Constraint-based program analysis. In POPL’95 Tutorial, January 1995.
P. D. Blasio, K. Fisher, and C. Talcott. Analysis for concurrent objects. In H. Bowman and J. Derrick, editors, Proc. 2nd IFIP Workshop on Formal Methods for Open Object-Based Distributed Systems (FMOODS), pages 73–88, Canterbury, UK, July 1997. Chapman and Hall, London.
C. Bodei, P. Degano, F. Nielson, and H. R. Nielson. Control flow analysis for the π-calculus. In Proceedings of CONCUR’98, pages 611–638, Berlin, Heidelberg, and New York, 1998. Springer-Verlag.
W. S. Brainerd. Tree generating regular systems. Information and Control, 14(2):217–231, 1969.
C. Flanagan and M. Felleisen. Set-based analysis for full scheme and its use in softtyping. Technical Report COMP TR95-253, Department of Computer Science, Rice University, Oct. 1995.
J. C. Mitchell. Foundations for Programming Languages. MIT Press, Cambridge, MA, 1996.
F. Nielson and H. R. Nielson. Infinitary control flow analysis: a collecting semantics for closure analysis. In Proceedings 24th Annual ACM Symposium on Principles of Programming Languages, pages 332–345. ACM, Jan. 1997.
J. Palsberg. Closure analysis in constraint form. ACM Transactions on Programming Languages and Systems, 17(1):47–62, January 1995.
P. Sestoft. Replacing function parameters by global variables. Master’s thesis, DIKU, University of Copenhagen, Copenhagen, 1989.
P. Sestoft. Analysis and efficient implementation of functional programs. PhD thesis, DIKU, University of Copenhagen, Copenhagen, 1991.
O. Shivers. Control-Flow Analysis of Higher-Order Languages. PhD thesis, Carnegie-Mellon University, May 1991.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2002 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Wand, M., Williamson, G.B. (2002). A Modular, Extensible Proof Method for Small-Step Flow Analyses. In: Le Métayer, D. (eds) Programming Languages and Systems. ESOP 2002. Lecture Notes in Computer Science, vol 2305. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45927-8_16
Download citation
DOI: https://doi.org/10.1007/3-540-45927-8_16
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-43363-7
Online ISBN: 978-3-540-45927-9
eBook Packages: Springer Book Archive