Skip to main content
Conference ProceedingsOPEN ACCESS

A modular, extensible proof method for small-step flow analyses

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2002) 2305 213-227
DOI: 10.1007/3-540-45927-8_16
8Citations
Citations of this article
4Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

We introduce a new proof technique for showing the correctness of 0CFA-like analyses with respect to small-step semantics. Weillustrate the technique by proving the correctness of 0CFA for the pureλ-calculus under arbitrary β-reduction. This result was claimed by Palsbergin 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.

Cite

CITATION STYLE

APA

Wand, M., & Williamson, G. B. (2002). A modular, extensible proof method for small-step flow analyses. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 2305, pp. 213–227). Springer Verlag. https://doi.org/10.1007/3-540-45927-8_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free