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