Sound runtime assertion checking for memory properties via program transformation
From MaRDI portal
Cites work
- scientific article; zbMATH DE number 1214924 (Why is no real title available?)
- scientific article; zbMATH DE number 1324833 (Why is no real title available?)
- A Why3 proof of GMP algorithms
- A formally verified compiler back-end
- Avoiding exponential explosion: generating compact verification conditions
- Formal verification of a C-like memory model and its uses for verifying program transformations
- Interactive theorem proving and program development. Coq'Art: the calculus of inductive constructions. Foreword by Gérard Huet and Christine Paulin-Mohring.
- Mechanized semantics for the clight subset of the C language
- Producing certified functional code from inductive specifications
- Verified runtime assertion checking for memory properties
This page was built for publication: Sound runtime assertion checking for memory properties via program transformation
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q7028282)