Abstract: In previous work we showed how to verify a compiler for a small language with exceptions. In this article we show how to calculate, as opposed to verify, an abstract machine for this language. The key step is the use of Reynold’s defunctionalization, an old program transformation technique that has recently been rejuvenated by the work of Danvy et al. 1.
We present a complete set of staging transformations for translating a class of interpreters into co...
This dissertation discusses several problems loosely related, because they all involve a verificatio...
International audienceGiven the complexity and sophistication of code generation and optimization al...
Abstract: In previous work we showed how to verify a compiler for a small language with exceptions. ...
In previous work we showed how to verify a compiler for a small language with exceptions. In this a...
In this article we present a new approach to the problem of calculating compilers. In particular, we...
Fifty years ago, John McCarthy and James Painter (1967) published the first paper on compiler verifi...
In this article we present a new approach to the problem of calculating compilers. In particular, we...
Compilers are not always correct due to the complexity of language semantics and transformation algo...
Developing a verifying compiler---a compiler that proves that components are correct with respect to...
The thesis deals with correctness of a compiler of a simple language featuring exceptions. We presen...
Abstract. Reasoning about programming languages with non-deter-ministic semantics entails many diffi...
Compilers are not always correct due to the complexity of language semantics and transformation algo...
Current methodology for compiler construction evolved from the need to release programmers form the ...
AbstractSemantics preservation between source and target program is the commonly accepted minimum re...
We present a complete set of staging transformations for translating a class of interpreters into co...
This dissertation discusses several problems loosely related, because they all involve a verificatio...
International audienceGiven the complexity and sophistication of code generation and optimization al...
Abstract: In previous work we showed how to verify a compiler for a small language with exceptions. ...
In previous work we showed how to verify a compiler for a small language with exceptions. In this a...
In this article we present a new approach to the problem of calculating compilers. In particular, we...
Fifty years ago, John McCarthy and James Painter (1967) published the first paper on compiler verifi...
In this article we present a new approach to the problem of calculating compilers. In particular, we...
Compilers are not always correct due to the complexity of language semantics and transformation algo...
Developing a verifying compiler---a compiler that proves that components are correct with respect to...
The thesis deals with correctness of a compiler of a simple language featuring exceptions. We presen...
Abstract. Reasoning about programming languages with non-deter-ministic semantics entails many diffi...
Compilers are not always correct due to the complexity of language semantics and transformation algo...
Current methodology for compiler construction evolved from the need to release programmers form the ...
AbstractSemantics preservation between source and target program is the commonly accepted minimum re...
We present a complete set of staging transformations for translating a class of interpreters into co...
This dissertation discusses several problems loosely related, because they all involve a verificatio...
International audienceGiven the complexity and sophistication of code generation and optimization al...