We describe the automatic generation of a provably correct com-piler for a non-trivial subset of Ada. The compiler is generated from RISC machine language that currently is assembled into code for the SPARC and the HP Precision Architecture. The generated code is an order of magnitude better than what is produced by compilers gener-ated by the classical systems of Mosses, Paulson, and Wand. The use of action semantics makes the processable language specification easy to read and pleasant to work with
In this thesis a compiler called SPASCAL is implemented which translates source programs in a simple...
The Ada Compiler Validation Capability (ACVC) is a large collection of programs used to verify that...
Most people write their programs in high-level languages because they want to develop their algorith...
We describe the automatic generation of a provably correct compiler for a non-trivial subset of Ada....
We have designed, implemented, and proved the correctness of a compiler generator that accepts actio...
We have designed, implemented, and proved the correctness of a compiler generator that accepts actio...
Given a complete, formal description of the semantics of a programming language, it should be possib...
We present a system, that generates a compiler and abstract machine from a Natural Semantics specifi...
Action Semantics is a new and interesting foundation for semantics based compiler generation. In th...
AbstractWe present an action compiler that can be used in connection with an action semantics based ...
Ada is a high-level imperative programming language with complex static semantics. In this paper we ...
We describe a technique for automatically proving compiler optimizations sound, meaning that their t...
The task of designing and implementing a compiler can be a di#cult and error-prone process. In this ...
AbstractWe present an action compiler that can be used in connection with an action semantics based ...
A compiler generator is described which produces compilers competitive with handwritten ones in comp...
In this thesis a compiler called SPASCAL is implemented which translates source programs in a simple...
The Ada Compiler Validation Capability (ACVC) is a large collection of programs used to verify that...
Most people write their programs in high-level languages because they want to develop their algorith...
We describe the automatic generation of a provably correct compiler for a non-trivial subset of Ada....
We have designed, implemented, and proved the correctness of a compiler generator that accepts actio...
We have designed, implemented, and proved the correctness of a compiler generator that accepts actio...
Given a complete, formal description of the semantics of a programming language, it should be possib...
We present a system, that generates a compiler and abstract machine from a Natural Semantics specifi...
Action Semantics is a new and interesting foundation for semantics based compiler generation. In th...
AbstractWe present an action compiler that can be used in connection with an action semantics based ...
Ada is a high-level imperative programming language with complex static semantics. In this paper we ...
We describe a technique for automatically proving compiler optimizations sound, meaning that their t...
The task of designing and implementing a compiler can be a di#cult and error-prone process. In this ...
AbstractWe present an action compiler that can be used in connection with an action semantics based ...
A compiler generator is described which produces compilers competitive with handwritten ones in comp...
In this thesis a compiler called SPASCAL is implemented which translates source programs in a simple...
The Ada Compiler Validation Capability (ACVC) is a large collection of programs used to verify that...
Most people write their programs in high-level languages because they want to develop their algorith...