A framework for the automatic formal verification of refinement from \textsc{Cogent} to C
From MaRDI portal
Publication:2829268
Recommendations
- Refinement through restraint: bringing down the cost of verification
- A formal basis for a program compilation proof tool
- Cogent: Accurate theorem proving for program verification
- Modular compiler verification. A refinement-algebraic approach advocating stepwise abstraction
- Cogent: uniqueness types and certifying compilation
Cites work
- A verification environment for sequential imperative programs in Isabelle/HOL
- CakeML
- Isabelle/HOL
- Isabelle/HOL. A proof assistant for higher-order logic
- Refinement through restraint: bringing down the cost of verification
- Secure Microkernels, State Monads and Scalable Refinement
- Types, bytes, and separation logic
Cited in
(6)- Refinement through restraint: bringing down the cost of verification
- Ready, set, verify! Applying hs-to-coq to real-world Haskell code
- Cogent: uniqueness types and certifying compilation
- Cogent: Accurate theorem proving for program verification
- Correctly compiling proofs about programs without proving compilers correct
- Formally verified suffix array construction
This page was built for publication: A framework for the automatic formal verification of refinement from \textsc{Cogent} to C
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2829268)