Pages that link to "Item:Q2405271"
From MaRDI portal
The following pages link to Satisfiability of compositional separation logic with tree predicates and data constraints (Q2405271):
Displaying 8 items.
- Reasoning about block-based cloud storage systems via separation logic (Q2087457) (← links)
- Separation logic with linearly compositional inductive predicates and set data constraints (Q2206230) (← links)
- Compositional satisfiability solving in separation logic (Q2234106) (← links)
- Logics for Unordered Trees with Data Constraints on Siblings (Q2799171) (← links)
- (Q5111651) (← links)
- A proof procedure for separation logic with inductive definitions and data (Q6053843) (← links)
- An undecidability result for separation logic with theory reasoning (Q6161426) (← links)
- Testing the satisfiability of formulas in separation logic with permissions (Q6541165) (← links)