A formally verified compiler back-end

Author: A Dold, A Dold, A Hobor, A Pnueli, ACJ Fox, AJ Chlipala, AW Appel, AW Appel, AW Appel, BK Rosen, C Lindig, CW Barrett, D Cachera, D Lacey, D Leinenbach, D Leinenbach, E Eide, F Henderson, G Barthe, G Barthe, G Barthe, G Barthe, G Clemmensen, G Goos, G Klein, G Li, G Li, G Morrisett, G Morrisett, GA Kildall, GC Necula, GC Necula, GC Necula, GC Necula, GJ Chaitin, GP Huet, H-J Boehm, IBM Corporation, J Chen, J Guttman, J Knoop, J Knoop, J McCarthy, J-B Tristan, J-B Tristan, JO Blech, JR Ellis, JS Moore, JS Moore, L Beringer, L Chirica, L George, L Rideau, LD Zuck, M Huisman, M Mçller-Olm, M Strecker, MA Dave, N Benton, P Letouzey, P Letouzey, PH Hartel, PW O‚ÄôHearn, Q Huang, R Milner, R St√§rk, S Beyer, S Blazy, S Blazy, S Coupet-Grimal, S Gulwani, S Lerner, SL Peyton Jones, SS Muchnick, TC Hales, WM McKeeman, X Feng, X Leroy, X Leroy, X Leroy, X Leroy, X Rival, Xavier Leroy, Y Bertot, Y Bertot, Z Shao
Publisher: Springer Science and Business Media LLC

ABOUT BOOK

This article describes the development and formal verification (proof of semantic preservation) of a compiler back-end from Cminor (a simple imperative intermediate language) to PowerPC assembly code, using the Coq proof assistant both for programming the compiler and for proving its correctness. Such a verified compiler is useful in the context of formal methods applied to the certification of critical software: the verification of the compiler guarantees that the safety properties proved on the source code hold for the executable compiled code as well

Privacy Policy
Powered by: