Abstract. Existing verified compilers are proved correct under a closed-world assumption, i.e., that the compiler will only be used to compile whole programs. We present a new methodology for verifying correct compilation of program components, while formally allowing linking with target code of arbitrary prove-nance. To demonstrate our methodology, we present a two-pass type-preserving open compiler and prove that compilation preserves semantics. The central novelty of our approach is that we define a combined language that embeds the source, intermediate, and target languages and formalizes a semantics of interoperability between them, using boundaries in the style of Matthews and Findler. Compiler correctness is stated as contextual equi...
This paper sketches a rigorous correctness proof of a compiler executable. We will emphasize the cen...
AbstractWe study issues in verifying compilers for modern imperative and object-oriented languages. ...
Programming language implementations bridge the gap between what the program developer sees and unde...
Though there has been remarkable progress on formally verified compilers in recent years, most of th...
Though there has been remarkable progress on formally verified compilers in recent years, most of th...
Verified compilers are typically proved correct under severe restrictions on what the compiler\u27s ...
I present Pyrosome1 , a generic framework for the verification of extensible, compositional compiler...
The paper shows how compiler correctness can be proved, provided that semanticsof the source languag...
Many real programs are written in multiple different programming languages, and supporting this patt...
AbstractCorrectness of compilation is important for the reliability of software. New techniques to g...
We present language-independent formal methods that are parameterized by the operational semantics o...
Abstract. Reasoning about programming languages with non-deter-ministic semantics entails many diffi...
AbstractSemantics preservation between source and target program is the commonly accepted minimum re...
AbstractSemantics preservation between source and target program is the commonly accepted minimum re...
Correctness of compilation is important for the reliability of software. New techniques to guarantee...
This paper sketches a rigorous correctness proof of a compiler executable. We will emphasize the cen...
AbstractWe study issues in verifying compilers for modern imperative and object-oriented languages. ...
Programming language implementations bridge the gap between what the program developer sees and unde...
Though there has been remarkable progress on formally verified compilers in recent years, most of th...
Though there has been remarkable progress on formally verified compilers in recent years, most of th...
Verified compilers are typically proved correct under severe restrictions on what the compiler\u27s ...
I present Pyrosome1 , a generic framework for the verification of extensible, compositional compiler...
The paper shows how compiler correctness can be proved, provided that semanticsof the source languag...
Many real programs are written in multiple different programming languages, and supporting this patt...
AbstractCorrectness of compilation is important for the reliability of software. New techniques to g...
We present language-independent formal methods that are parameterized by the operational semantics o...
Abstract. Reasoning about programming languages with non-deter-ministic semantics entails many diffi...
AbstractSemantics preservation between source and target program is the commonly accepted minimum re...
AbstractSemantics preservation between source and target program is the commonly accepted minimum re...
Correctness of compilation is important for the reliability of software. New techniques to guarantee...
This paper sketches a rigorous correctness proof of a compiler executable. We will emphasize the cen...
AbstractWe study issues in verifying compilers for modern imperative and object-oriented languages. ...
Programming language implementations bridge the gap between what the program developer sees and unde...