The following pages link to Separation Logic Modulo Theories (Q2937786):
Displaying 15 items.
- Compositional entailment checking for a fragment of separation logic (Q1688543) (← links)
- Strong-separation logic (Q2233486) (← links)
- Compositional satisfiability solving in separation logic (Q2234106) (← links)
- Separation logic with one quantified variable (Q2411038) (← links)
- Automated mutual induction proof in separation logic (Q2414251) (← links)
- Horn Clause Solvers for Program Verification (Q2947164) (← links)
- Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic (Q2988661) (← links)
- Decision Procedure for Separation Logic with Inductive Definitions and Presburger Arithmetic (Q3179308) (← links)
- Automated Theorem Proving for Assertions in Separation Logic with All Connectives (Q3454118) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- A First-Order Logic with Frames (Q5041109) (← links)
- Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction (Q5277913) (← links)
- A proof procedure for separation logic with inductive definitions and data (Q6053843) (← links)
- Completeness of cyclic proofs for symbolic heaps with inductive definitions (Q6536318) (← links)
- Testing the satisfiability of formulas in separation logic with permissions (Q6541165) (← links)
