An Automatically Generated and Provably Correct Compiler for a Subset of Ada

Palsberg, Jens

doi:10.7146/dpb.v21i383.6615

Cited by 3 publications

(4 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Our example programs are a bubblesort program (written in both HypoPL and Ada), and programs for performing the sieve of Erathosthenes and the algorithm of Euclid (written in Ada). These programs may be found in Palsberg (1992a).…”

Section: Binding Time Improvementsmentioning

confidence: 99%

Generating action compilers by partial evaluation

Bondorf¹,

Palsberg²

1996

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

Compiler generation based on Mosses' action semantics has been studied by Brown, Moura, and Watt, and also by the second author. The core of each of their systems is a handwritten action compiler, producing either C or machine code. We have obtained an action compiler in a much simpler way: by partial evaluation of an action interpreter. Even though our compiler produces Scheme code, the code runs as fast as that produced by the previous action compilers.

show abstract

Section: Binding Time Improvementsmentioning

confidence: 99%

Generating action compilers by partial evaluation

Bondorf¹,

Palsberg²

1996

J. Funct. Prog.

Self Cite

View full text Add to dashboard Cite

show abstract

“…Additional experiments, see [43], have shown that the code runs at least two orders of magnitude slower than a corresponding target program produced by the C compiler (without optimization). This is somewhat disappointing but still an improvement compared to the classical systems of Mosses, Paulson, and Wand where a slow-down of three orders of magnitude has been reported [22].…”

Section: Performance Evaluationmentioning

confidence: 99%

“…Most definitions and proofs are omitted. For an overview of our experiments with generating a compiler for a subset of Ada, see [43].…”

Section: Introductionmentioning

confidence: 99%

A provably correct compiler generator

Palsberg

1992

Esop '92

Self Cite

View full text Add to dashboard Cite

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; proofs are given in the initial model.

show abstract

“…As reported in his PhD thesis [58] and papers [57,59] at ESOP and ICCL in 1992, Palsberg has designed, implemented, and proved the correctness of a compiler generator that accepts action-semantic descriptions of imperative programming languages. He has used it to generate compilers for both a toy language and a non-trivial subset of Ada.…”

Section: Provably-correct Compiler Generationmentioning

confidence: 99%

Theory and Practice of Action Semantics

Mosses¹

1996

BRICS

View full text Add to dashboard Cite

Action Semantics is a framework for the formal description of programming languages. Its main advantage over other frameworks is pragmatic: action-semantic descriptions (ASDs) scale up smoothly to realistic programming languages. This is due to the inherent extensibility and modifiability of ASDs, ensuring that extensions and changes to the described language require only proportionate changes in its description. (In denotational or operational semantics, adding an unforeseen construct to a language may require a reformulation of the entire description.) After sketching the background for the development of action semantics, we summarize the main ideas of the framework, and provide a simple illustrative example of an ASD. We identify which features of ASDs are crucial for good pragmatics. Then we explain the foundations of action semantics, and survey recent advances in its theory and practical applications. Finally, we assess the prospects for further development and use of action semantics. The action semantics framework was initially developed at the University of Aarhus by the present author, in collaboration with David Watt (University of Glasgow). Groups and individuals scattered around five continents have since contributed to its theory and practice.

show abstract

An Automatically Generated and Provably Correct Compiler for a Subset of Ada

Cited by 3 publications

References 15 publications

Generating action compilers by partial evaluation

Generating action compilers by partial evaluation

A provably correct compiler generator

Theory and Practice of Action Semantics

Contact Info

Product

Resources

About