The following pages link to Slide (Q40256):
Displaying 23 items.
- Logic programming approach to automata-based decision procedures (Q347398) (← links)
- Juggrnaut: using graph grammars for abstracting unbounded heap structures (Q746781) (← links)
- Compositional entailment checking for a fragment of separation logic (Q1688543) (← links)
- Nested antichains for WS1S (Q1733101) (← links)
- A decision procedure for separation logic in SMT (Q1990511) (← links)
- Entailment is undecidable for symbolic heap separation logic formulæ with non-established inductive rules (Q2234797) (← links)
- Separation logic with one quantified variable (Q2411038) (← links)
- Automated mutual induction proof in separation logic (Q2414251) (← links)
- A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints (Q2817951) (← links)
- Two-Variable Separation Logic and Its Inner Circle (Q2957697) (← 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)
- Lazy Automata Techniques for WS1S (Q3303905) (← links)
- Disproving Inductive Entailments in Separation Logic via Base Pair Approximation (Q3455777) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- The Tree Width of Separation Logic with Recursive Definitions (Q4928426) (← links)
- (Q4989410) (← links)
- Decision Procedure for Entailment of Symbolic Heaps with Arrays (Q5055997) (← links)
- On Temporal and Separation Logics (Q5079764) (← links)
- (Q5111651) (← links)
- Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction (Q5277913) (← links)
- A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions (Q5875940) (← links)
- Program Verification with Separation Logic (Q5883571) (← links)
