论文信息 - A Framework for the Automatic Formal Verification of Refinement from Cogent to C

A Framework for the Automatic Formal Verification of Refinement from Cogent to C

Our language Cogent simplifies verification of systems software using a certifying compiler, which produces a proof that the generated C code is a refinement of the original Cogent program. Despite the fact that Cogent itself contains a number of refinement layers, the semantic gap between even the lowest level of Cogent semantics and the generated C code remains large.

[1] Ramana Kumar,et al. CakeML: a verified implementation of ML , 2014, POPL.

[2] Michael Norrish,et al. seL4: formal verification of an OS kernel , 2009, SOSP '09.

[3] Michael Norrish,et al. Types, bytes, and separation logic , 2007, POPL '07.

[4] Xavier Leroy,et al. Formal verification of a realistic compiler , 2009, CACM.

[5] Norbert Schirmer,et al. Verification of sequential imperative programs in Isabelle-HOL , 2006 .

[6] Sidney Amani,et al. Refinement through restraint: bringing down the cost of verification , 2016, ICFP 2016.

[7] Magnus O. Myreen,et al. Translation validation for a verified OS kernel , 2013, PLDI.

[8] Norbert Schirmer,et al. A Verification Environment for Sequential Imperative Programs in Isabelle/HOL , 2005, LPAR.

[9] Gerwin Klein,et al. Secure Microkernels, State Monads and Scalable Refinement , 2008, TPHOLs.

[10] Gerwin Klein,et al. Don't sweat the small stuff: formal verification of C code without the pain , 2014, PLDI.

[11] Sidney Amani,et al. Cogent: Verifying High-Assurance File System Implementations , 2016, ASPLOS.

[12] Lawrence Charles Paulson,et al. Isabelle/HOL: A Proof Assistant for Higher-Order Logic , 2002 .

[13] Amr Sabry,et al. Reasoning about programs in continuation-passing style , 1992, LFP '92.