(Enter summary)
Abstract: We have designed, implemented, and proved the correctness of a
compiler generator that accepts action semantic descriptions of imperative
programming languages. The generated compilers emit absolute
code for an abstract RISC machine language that currently is assembled
into code for the SPARC and the HP Precision Architecture. Our
machine language needs no run-time type-checking and is thus more
realistic than those considered in previous compiler proofs. We use
solely algebraic specifications; ... (Update)
Context of citations to this paper: More
.... and object oriented languages [17] not to mention the usual toy languages that computer scientists often provide as testing material [4, 5, 9, 19]. Action Semantics is derived from denotational semantics. It has been developed partly because of the lack of pragmatic features in...
.... extensions of Actress by Doh and Schmidt [12] to support techniques for typing and binding time analysis, and the Cantor system [41,42] which was used to generate a compiler of a subset of Ada from its action semantic description. The main emphasis in the last case was on...
Cited by: More
A Formal Semantics for the C Programming Language - Nikolaos Papaspyrou Doctoral (1998)
(Correct)
Specification Languages in Algebraic Compilers - Van Wyk (2000)
(Correct)
Theory and Practice of Action Semantics - Mosses (1996)
(Correct)
Similar documents (at the sentence level):
17.3%: An Automatically Generated and Provably Correct Compiler for a.. - Palsberg (1992)
(Correct)
Active bibliography (related documents): More All
1.6: Mechanical Verification of Compiler Correctness - Stringer-Calvert (1998)
(Correct)
0.9: Generating Action Compilers by Partial Evaluation - Bondorf, Palsberg (1996)
(Correct)
0.4: Compiling with Proofs - Necula (1997)
(Correct)
Similar documents based on text: More All
0.1: Eta-Expansion does the Trick - Danvy, Malmkjær, Palsberg (1996)
(Correct)
0.1: Three Discussions on Object-Oriented Typing - Palsberg, Schwartzbach (1992)
(Correct)
0.1: Making Type Inference Practical - Oxhoj, Palsberg, Schwartzbach (1992)
(Correct)
Related documents from co-citation: More All
9: Actress: an action semantics directed compiler generator
- Brown, Moura et al. - 1992
8: An automatically generated and provably correct compiler for a subset of ada
- Palsberg - 1992
7: Provably correct compiler generation (context) - Palsberg - 1992
BibTeX entry: (Update)
J. Palsberg, "A provably correct compiler generator," in ESOP'92, Proc. European Symposium on Programming, Rennes, vol. 582 of Lecture Notes in Computer Science, pp. 418-434, Springer-Verlag, 1992. [DART-104]. http://citeseer.ist.psu.edu/palsberg92provably.html More
@incollection{ palsberg92provably,
author = "Jens Palsberg",
title = "A Provably Correct Compiler Generator",
booktitle = "{ESOP} '92, 4th European Symposium on Programming, Rennes, France, February 1992, Proceedings",
volume = "582",
publisher = "Springer-Verlag",
address = "New York, N.Y.",
editor = "Bernd Krieg-Bruckner",
pages = "418-434",
year = "1992",
url = "citeseer.ist.psu.edu/palsberg92provably.html" }
Citations (may not include all citations):
906
A structural approach to operational semantics
- Plotkin - 1981
430
Structure and Interpretation of Computer Programs (context) - Abelson, Sussman et al. - 1985
346
Denotational Semantics: The Scott-Strachey Approach to Progr.. (context) - Stoy - 1977
253
Programming Perl (context) - Wall, Schwartz - 1991
233
Natural semantics (context) - Kahn - 1987
173
An initial algebra approach to the specification (context) - Goguen, Thatcher et al. - 1978
129
ACM Transactions on Programming Languages and Systems (context) - Amadio, Cardelli et al. - 1993
106
The categorical abstract machine (context) - Cousineau, Curien et al. - 1987
99
A partial evaluator for the untyped lambda-calculus
- Gomard, Jones - 1991
96
Automatic autoprojection of recursive equations with global ..
- Bondorf, Danvy - 1991
83
Automatic autoprojection of higher order recursive equations (context) - Bondorf - 1991
63
Realistic Compiler Generation (context) - Lee - 1989
61
Detecting global variables in denotational specifications (context) - Schmidt - 1985
56
A Theory of Programming Language Semantics (context) - Milne, Strachey - 1976
53
Realistic compilation by program transformation
- Kelsey, Hudak - 1989
53
Unified algebras and institutions (context) - Mosses - 1989
51
Two-Level Functional Languages (context) - Nielson, Nielson - 1992
51
Allyn and Bacon (context) - Schmidt - 1986
49
Correctness of a compiler for arithmetic expressions
- McCarthy, Painter - 1966
49
Microprocessor design verification
- Hunt - 1989
43
Data Structures = Programs (context) - Wirth - 1976
38
Proof of translation in natural semantics (context) - Despeyroux - 1986
38
An approach to systems verification
- Bevier, Hunt et al. - 1989
35
Two-level semantics and code generation (context) - Nielson, Nielson - 1988
33
A semantic prototyping system (context) - Wand - 1984
33
More on advice on structuring compilers and proving them cor.. (context) - Thatcher, Wagner et al. - 1981
29
A mechanically verified language implementation
- Moore - 1989
28
A mechanically verified code generator
- Young - 1989
28
Programming Language Syntax and Semantics (context) - Watt - 1991
28
Automatic binding time analysis for a typed -calculus (context) - Nielson, Nielson - 1988
22
SIS---semantics implementation system (context) - Mosses - 1979
22
Compiler Specification and Verification (context) - Polak - 1981
22
A semantics-directed compiler generator (context) - Paulson - 1982
20
Programs and their proofs: an algebraic approach (context) - Burstall, Landin - 1969
19
Totally verified systems: Linking verified software to verif.. (context) - Joyce - 1989
16
An automatically generated and provably correct compiler for..
- Palsberg - 1992
16
Provably Correct Compiler Generation (context) - Palsberg - 1992
15
Unified algebras and action semantics (context) - Mosses - 1989
14
Making abstract machines less abstract (context) - Hannan - 1991
13
A constructive approach to compiler correctness (context) - Mosses - 1980
13
Technical Report (context) - Microsystems, tutorial - 1988
12
A basic abstract semantic algebra (context) - Mosses - 1984
11
A verified compiler for a verified microprocessor (context) - Joyce - 1989
10
A realistic compiler generator based on highlevel semantics (context) - Lee, Pleban - 1987
9
Unified algebras and modules (context) - Mosses - 1989
8
Advice on structuring compilers and proving them correct (context) - Morris - 1973
8
Detecting stack-based environments in denotational semantics (context) - Schmidt - 1988
7
realistic compiler for an imperative programming language (context) - Pleban, Lee et al. - 1988
7
Compiler prototyping using formal semantics (context) - Pleban - 1984
7
Compiler Generators (context) - Tofte - 1990
5
Staging transformations for abstract machines (context) - Hannan - 1991
4
Number 26 Tracts in Theoretical Computer Science (context) - Mosses, Cambridge - 1992
3
Reduced Instruction Set Computers (context) - Stallings - 1986
3
the use of LISP in implementing denotational semantics (context) - Pleban, Lee - 1986
3
Lecture Notes for the Marktoberdorf'91 Summer School (context) - Mosses, to et al. - 1991
3
Compiler generation from relational semantics (context) - Dam, Jensen - 1986
3
Precision architecture and instruction (context) - Packard - 1987
3
A multi-language compiler system with automatically generate.. (context) - Schmidt, Voller - 1984
2
Verification of the level 0 compiling specification (context) - Gammelgaard, Nielson - 1990
2
an integrated approach to programming language semantics and.. (context) - Pleban, Lee - 1987
2
Experience with VDM in Norsk Data (context) - Schmidt, Voller - 1987
2
Towards an algebraic specification of code generation (context) - Berghammer, Ehler et al. - 1988
1
From operational semantics to abtract machines (context) - Hannan, Miller - 1991
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cs.purdue.edu/homes/palsberg/publications.html): More
Safety Analysis versus Type Inference for Partial Types - Palsberg, Schwartzbach (1992)
(Correct)
Comparing Flow-based Binding-time Analyses - Palsberg (1995)
(Correct)
Normal Forms have Partial Types - Palsberg (1993)
(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