CPL - Chalmers Publication Library
| Utbildning | Forskning | Styrkeområden | Om Chalmers | In English In English Ej inloggad.

A new verified compiler backend for CakeML

Yong Kiam Tan ; Magnus O. Myreen (Institutionen för data- och informationsteknik, Programvaruteknik (Chalmers)) ; Ramana Kumar ; Anthony C. J. Fox ; Scott Owens ; Michael Norrish
Proceedings of the 21st ACM SIGPLAN International Conference on Functional Programming, ICFP 2016; Nara, JAPAN; 18-24 Sept 2016 (0362-1340). Vol. 51 (2016), 9, p. 60-73.
[Konferensbidrag, refereegranskat]

We have developed and mechanically verified a new compiler backend for CakeML. Our new compiler features a sequence of intermediate languages that allows it to incrementally compile away high-level features and enables verification at the right levels of semantic detail. In this way, it resembles mainstream (unverified) compilers for strict functional languages. The compiler supports efficient curried multi-argument functions, configurable data representations, exceptions that unwind the call stack, register allocation, and more. The compiler targets several architectures: x86-64, ARMv6, ARMv8, MIPS-64, and RISC-V. In this paper, we present the overall structure of the compiler, including its 12 intermediate languages, and explain how everything fits together. We focus particularly on the interaction between the verification of the register allocator and the garbage collector, and memory representations. The entire development has been carried out within the HOL4 theorem prover.

Nyckelord: Compiler verification; ML; verified optimisations



Den här publikationen ingår i följande styrkeområden:

Läs mer om Chalmers styrkeområden  

Denna post skapades 2017-02-01. Senast ändrad 2017-03-22.
CPL Pubid: 247962

 

Läs direkt!


Länk till annan sajt (kan kräva inloggning)