Pages that link to "Item:Q2055854"
From MaRDI portal
The following pages link to Unifying decidable entailments in separation logic with inductive definitions (Q2055854):
Displaying 8 items.
- Unifying decidable entailments in separation logic with inductive definitions (Q2055854) (← links)
- Decision problems in a logic for reasoning about reconfigurable distributed systems (Q2104556) (← links)
- Entailment is undecidable for symbolic heap separation logic formulæ with non-established inductive rules (Q2234797) (← links)
- Decision Procedure for Separation Logic with Inductive Definitions and Presburger Arithmetic (Q3179308) (← links)
- A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions (Q5875940) (← links)
- An undecidability result for separation logic with theory reasoning (Q6161426) (← links)
- Foundations for entailment checking in quantitative separation logic (Q6166785) (← links)
- Testing the satisfiability of formulas in separation logic with permissions (Q6541165) (← links)
