Cited in
(42)- Separation logics and modalities: a survey
- Nested antichains for WS1S
- Juggrnaut: using graph grammars for abstracting unbounded heap structures
- Expressive completeness of separation logic with two variables and no separating conjunction
- Decision Procedure for Separation Logic with Inductive Definitions and Presburger Arithmetic
- Compositional entailment checking for a fragment of separation logic
- Tractability of separation logic with inductive definitions: beyond lists
- Decision Procedure for Entailment of Symbolic Heaps with Arrays
- A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions
- The tree width of separation logic with recursive definitions
- Two-Variable Separation Logic and Its Inner Circle
- Logic programming approach to automata-based decision procedures
- SeLoger
- Automated mutual induction proof in separation logic
- scientific article; zbMATH DE number 7350781 (Why is no real title available?)
- Predator
- HIP
- SLAyer
- Smallfoot
- VATA
- MTBDD
- Juggrnaut
- FunArray
- THOR
- Program Verification with Separation Logic
- coreStar
- Cyclist
- InKa
- Antichains
- Infer
- A complete decision procedure for linearly compositional separation logic with data constraints
- GRASShopper
- QuodLibet
- MSO_Regex_Equivalence
- Rely
- A decision procedure for separation logic in SMT
- Separation logic with one quantified variable
- Lazy automata techniques for WS1S
- Disproving inductive entailments in separation logic via base pair approximation
- On temporal and separation logics
- Unified reasoning about robustness properties of symbolic-heap separation logic
- Entailment is undecidable for symbolic heap separation logic formulæ with non-established inductive rules
This page was built for software: Slide
