This paper describes how the latest CakeML compiler supports verified compilation down to multiple realistically modelled target architectures. In particular, we describe how the compiler definition, the various language semantics, and the correctness proofs were organised to minimize target specific overhead. With our setup we have incorporated compilation to four 64-bit architectures, ARMv8, x86-64, MIPS-64, RISC-V, and one 32-bit architecture, ARMv6. Our correctness theorem allows interference from the environment: the top-level correctness statement takes into account execution of foreign code and per-instruction interference from external processes, such as interrupt handlers in operating systems. The entire CakeML development is forma...
Machine-readable specifications for the Armv8 instruction set architecture have become publicly avai...
Machine-readable specifications for the Armv8 instruction set architecture have become publicly avai...
Many theorem provers can generate functional programs from definitions or proofs. However, this code...
This paper describes how the latest CakeML compiler supports verified compilation down to multiple r...
This paper describes how the latest CakeML compiler supports verified compilation down to multiple r...
We have developed and mechanically verified a new compiler backend for CakeML. Our new compiler feat...
We have developed and mechanically verified a new compiler backend for CakeML. Our new compiler feat...
We have developed and mechanically verified a new compiler backend for CakeML. Our new compiler feat...
We have developed and mechanically verified a new compiler backend for CakeML. Our new compiler feat...
The CakeML compiler is, to the best of our knowledge, the most realistic verified compiler for a fun...
We have developed and mechanically verified a new compiler backend for CakeML. Our new compiler feat...
The CakeML compiler is, to the best of our knowledge, the most realistic veri?ed compiler for a func...
Developing technology for building verified stacks, i.e., computer systems with comprehensive proofs...
We have designed an intermediate language (IL) for the CakeML compiler that supports the verified, e...
We have designed an intermediate language (IL) for the CakeML compiler that supports the verified, e...
Machine-readable specifications for the Armv8 instruction set architecture have become publicly avai...
Machine-readable specifications for the Armv8 instruction set architecture have become publicly avai...
Many theorem provers can generate functional programs from definitions or proofs. However, this code...
This paper describes how the latest CakeML compiler supports verified compilation down to multiple r...
This paper describes how the latest CakeML compiler supports verified compilation down to multiple r...
We have developed and mechanically verified a new compiler backend for CakeML. Our new compiler feat...
We have developed and mechanically verified a new compiler backend for CakeML. Our new compiler feat...
We have developed and mechanically verified a new compiler backend for CakeML. Our new compiler feat...
We have developed and mechanically verified a new compiler backend for CakeML. Our new compiler feat...
The CakeML compiler is, to the best of our knowledge, the most realistic verified compiler for a fun...
We have developed and mechanically verified a new compiler backend for CakeML. Our new compiler feat...
The CakeML compiler is, to the best of our knowledge, the most realistic veri?ed compiler for a func...
Developing technology for building verified stacks, i.e., computer systems with comprehensive proofs...
We have designed an intermediate language (IL) for the CakeML compiler that supports the verified, e...
We have designed an intermediate language (IL) for the CakeML compiler that supports the verified, e...
Machine-readable specifications for the Armv8 instruction set architecture have become publicly avai...
Machine-readable specifications for the Armv8 instruction set architecture have become publicly avai...
Many theorem provers can generate functional programs from definitions or proofs. However, this code...