Pages that link to "Item:Q5410687"
From MaRDI portal
The following pages link to Foundations for Decision Problems in Separation Logic with General Inductive Predicates (Q5410687):
Displaying 20 items.
- Unifying decidable entailments in separation logic with inductive definitions (Q2055854) (← links)
- Separation logic with linearly compositional inductive predicates and set data constraints (Q2206230) (← links)
- Strong-separation logic (Q2233486) (← links)
- Separation logic with one quantified variable (Q2411038) (← links)
- A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints (Q2817951) (← 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)
- Disproving Inductive Entailments in Separation Logic via Base Pair Approximation (Q3455777) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- (Q4989410) (← links)
- Decision Procedure for Entailment of Symbolic Heaps with Arrays (Q5055997) (← links)
- (Q5090983) (← 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)
- An undecidability result for separation logic with theory reasoning (Q6161426) (← links)
- Foundations for entailment checking in quantitative separation logic (Q6166785) (← links)
- Completeness of cyclic proofs for symbolic heaps with inductive definitions (Q6536318) (← links)
- Restriction on cut rule in cyclic-proof system for symbolic heaps (Q6633582) (← links)
