(Enter summary)
Abstract: In a series of papers in the early 80's we proposed a paradigm for semanticsbased
compiler correctness. In this paradigm, the source and target languages
are given denotational semantics in the same -theory, so correctness
proofs can be carried out within this theory. In many cases, the proofs have
a highly structured form. We show how a simple proof strategy, based on
an algorithm for ff-matching, can be used to build a tool that can automate
the routine cases of these proofs.
1 Introduction... (Update)
Active bibliography (related documents): More All
0.4: Advice On Structuring Compiler Back Ends And Proving Them Correct - Oliva (1994)
(Correct)
0.4: Compiler Correctness for Concurrent Languages - Gladstein, Wand (1994)
(Correct)
0.3: Compiler Correctness for Parallel Languages - Wand (1994)
(Correct)
Similar documents based on text: More All
0.2: Denotational Semantics Using an Operationally-Based Term Model - Wand, Sullivan (1997)
(Correct)
0.1: An Extensional Metalanguage with I/O and a Dynamic Store.. - Wand, al. (1995)
(Correct)
0.1: Proving the Correctness of Storage Representations - Wand, Oliva
(Correct)
BibTeX entry: (Update)
@techreport{ wand95little,
author = "Mitchell Wand and Gregory T. Sullivan",
title = "A Little Goes a Long Way: {A} Simple Tool to Support Denotational Compiler-Correctness Proofs",
number = "NU-CCS-95-19",
year = "1995",
url = "citeseer.ist.psu.edu/wand95little.html" }
Citations (may not include all citations):
729
The Lambda Calculus: Its Syntax and Semantics (context) - Barendregt - 1981
392
A Computational Logic (context) - Boyer, Moore - 1979
210
Logic Programming in the LF Logical Framework
- Pfenning - 1991
166
An Overview of -Prolog (context) - Nadathur, Miller - 1988
129
The Foundation of a Generic Theorem Prover
- Paulson - 1989
106
Essentials of Programming Languages (context) - Friedman, Wand et al. - 1992
50
Proving Properties of Programs by Structural Induction (context) - Burstall - 1969
40
Compiler Verification in LF
- Hannan, Pfenning - 1992
40
Deriving Target Code as a Representation of Continuation Sem.. (context) - Wand - 1982
35
Super Combinators: A New Implementation Method for Applicati.. (context) - Hughes - 1982
31
What Is a Model of the Lambda Calculus (context) - Meyer - 1982
28
The Scheme 311 Compiler: An Exercise in Denotational Semanti.. (context) - Clinger - 1984
27
Proving the Correctness of Storage Representations
- Wand, Oliva - 1992
24
Semantics-Directed Machine Architecture (context) - Wand - 1982
21
A Theory of Binding Structures and Applications to Rewriting
- Talcott - 1993
13
The VLISP Verified PreScheme Compiler
- Oliva, Ramsdell et al. - 1995
13
Compiler Correctness for Parallel Languages
- Wand - 1994
12
Lisp and Symbolic Computation (context) - Guttman, Swarup et al. - 1995
11
Loops in Combinator-Based Compilers (context) - Wand - 1983
5
Using the Theorem Prover Isabelle-91 to Verify a Simple Proo.. (context) - Ciesielski, Wand - 1991
3
Conditional Lambda-Theories and the Verification of Static P.. (context) - Wand, Wang - 1990
1
Nigher-Order Critical Pairs (context) - Nipkow - 1991
Documents on the same site (http://fermivista.math.jussieu.fr/ftp/ftp.ccs.neu.edu.html): More
Incremental Testing of Adaptive Software - Keszenheimer, Lieberherr (1994)
(Correct)
Experience with a Graph-Based Propagation Programming.. - Lieberherr, Hürsch.. (1992)
(Correct)
Understanding Diagrams in Technical Documents - Futrelle, Kakadiaris.. (1992)
(Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC