Add to ORKGFifty years ago, John McCarthy and James Painter (1967) published the first paper on compiler verification, in which they showed how to formally prove the correctness of a compiler that translates arithmetic expressions into code for a register-based machine. In this article, we revisit this example in a modern context, and show how such a compiler can now be calculated directly from a specification of its correctness using simple equational reasoning techniques
International audienceThis article describes the development and formal verification (proof of seman...
Compilers, and especially optimizing compilers, are complicated programs. Bugs in compilers happen, ...
AbstractWe study issues in verifying compilers for modern imperative and object-oriented languages. ...
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...
In this article we present a new approach to the problem of calculating compilers. In particular, we...
International audienceGiven the complexity and sophistication of code generation and optimization al...
International audienceFormal verification of software or hardware systems — be it by model checking,...
In previous work we showed how to verify a compiler for a small language with exceptions. In this a...
Thesis (Ph.D.)--University of Washington, 2018Modern computer systems rely on the correctness of at ...
This paper presents an approach to compiler correctness in which the compiler generates a proof that...
Bahr and Hutton recently developed a new approach to calculating correct compilers directly from spe...
International audienceFloating-point arithmetic is known to be tricky: roundings, formats, exception...
Compilers are difficult to write, and difficult to get right. Bahr and Hutton recently developed a n...
Bahr and Hutton recently developed a new approach to calculating correct compilers directly from spe...
International audienceThis article describes the development and formal verification (proof of seman...
Compilers, and especially optimizing compilers, are complicated programs. Bugs in compilers happen, ...
AbstractWe study issues in verifying compilers for modern imperative and object-oriented languages. ...
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...
In this article we present a new approach to the problem of calculating compilers. In particular, we...
International audienceGiven the complexity and sophistication of code generation and optimization al...
International audienceFormal verification of software or hardware systems — be it by model checking,...
In previous work we showed how to verify a compiler for a small language with exceptions. In this a...
Thesis (Ph.D.)--University of Washington, 2018Modern computer systems rely on the correctness of at ...
This paper presents an approach to compiler correctness in which the compiler generates a proof that...
Bahr and Hutton recently developed a new approach to calculating correct compilers directly from spe...
International audienceFloating-point arithmetic is known to be tricky: roundings, formats, exception...
Compilers are difficult to write, and difficult to get right. Bahr and Hutton recently developed a n...
Bahr and Hutton recently developed a new approach to calculating correct compilers directly from spe...
International audienceThis article describes the development and formal verification (proof of seman...
Compilers, and especially optimizing compilers, are complicated programs. Bugs in compilers happen, ...
AbstractWe study issues in verifying compilers for modern imperative and object-oriented languages. ...