A first-order logic with frames
From MaRDI portal
Recommendations
Cites work
- A Basis for Verifying Multi-threaded Programs
- A decidable fragment of separation logic
- A semantics for concurrent separation logic
- Analysis of algorithms on threaded trees
- Automated cyclic entailment proofs in separation logic
- Automated mutual explicit induction proof in separation logic
- Coming to terms with quantified reasoning
- Dafny: an automatic program verifier for functional correctness
- Decision procedures for algebraic data types with abstractions
- GRASShopper
- Local reasoning about programs that alter data structures
- Local reasoning for global invariants. I: Region logic
- Local reasoning for global invariants. II: Dynamic boundaries
- Modular reasoning about heap paths via effectively propositional formulas
- Programming Languages and Systems
- Recursive proofs for inductive tree data-structures
- Separation and information hiding
- Separation logic and abstraction
- Separation logic modulo theories
- Separation logics and modalities: a survey
- Smallfoot
- The dynamic frames theory
- The relationship between separation logic and implicit dynamic frames
- Tractable Reasoning in a Fragment of Separation Logic
Cited in
(5)
This page was built for publication: A first-order logic with frames
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5041109)