Frame rule for mutually recursive procedures manipulating pointers
From MaRDI portal
Publication:732009
Recommendations
Cites work
- scientific article; zbMATH DE number 1948157 (Why is no real title available?)
- scientific article; zbMATH DE number 1748069 (Why is no real title available?)
- scientific article; zbMATH DE number 2087445 (Why is no real title available?)
- scientific article; zbMATH DE number 1841809 (Why is no real title available?)
- scientific article; zbMATH DE number 3410595 (Why is no real title available?)
- A lattice-theoretical fixpoint theorem and its applications
- A proof outline logic for object-oriented programming
- An algebraic treatment of procedure refinement to support mechanical verification
- An axiomatic basis for computer programming
- BI as an assertion language for mutable data structures
- Computer Science Logic
- Higher-order separation logic in Isabelle/HOLCF
- Isabelle/HOL. A proof assistant for higher-order logic
- Refinement Calculus
- Relational Parametricity and Separation Logic
Cited in
(7)- Safe Modification of Pointer Programs in Refinement Calculus
- Completeness for recursive procedures in separation logic
- Verifying object-oriented programs with higher-order separation logic in Coq
- Mechanical verification of mutually recursive procedures
- Reasoning about assignments in recursive data structures
- Algebraic separation logic
- Algebra of monotonic Boolean transformers
This page was built for publication: Frame rule for mutually recursive procedures manipulating pointers
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q732009)