Verifying object-oriented programs with higher-order separation logic in Coq
From MaRDI portal
Recommendations
Cites work
- A very modal model of a modern, major, general type system
- Abstract Predicates and Mutable ADTs in Hoare Type Theory
- BI hyperdoctrines and higher-order separation logic
- Frame rule for mutually recursive procedures manipulating pointers
- Higher-order separation logic in Isabelle/HOLCF
- scientific article; zbMATH DE number 944097 (Why is no real title available?)
- Local reasoning about programs that alter data structures
- Nested Hoare Triples and Frame Rules for Higher-Order Store
- Separation logic and abstraction
- Separation logic, abstraction and inheritance
- Step-indexed Kripke models over recursive worlds
Cited in
(14)- Formally verifying exceptions for low-level code with separation logic
- A formal C memory model for separation logic
- On models of higher-order separation logic
- Implementing a program logic of objects in a higher-order logic theorem prover
- Extensible and efficient automation through reflective tactics
- Crowfoot: A Verifier for Higher-Order Store Programs
- Charge! A framework for higher-order separation logic in Coq
- Effective interactive proofs for higher-order imperative programs
- Separation Logic
- Verification of the interface of a small proof system in Coq
- Connecting higher-order separation logic to a first-order outside world
- Bringing Order to the Separation Logic Jungle
- Extending Coq with Imperative Features and Its Application to SAT Verification
- From OBJ to ML to Coq
This page was built for publication: Verifying object-oriented programs with higher-order separation logic in Coq
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3087993)