Pages that link to "Item:Q4635608"

The following pages link to A decision procedure for satisfiability in separation logic with inductive predicates (Q4635608):

Displaying 23 items.

• The SAT-based approach to separation logic (Q862390) (← links)
• Compositional entailment checking for a fragment of separation logic (Q1688543) (← links)
• Unifying decidable entailments in separation logic with inductive definitions (Q2055854) (← links)
• Decision problems in a logic for reasoning about reconfigurable distributed systems (Q2104556) (← links)
• Separation logic with linearly compositional inductive predicates and set data constraints (Q2206230) (← links)
• Compositional satisfiability solving in separation logic (Q2234106) (← links)
• Separation logic with one quantified variable (Q2411038) (← links)
• A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints (Q2817951) (← links)
• Two-Variable Separation Logic and Its Inner Circle (Q2957697) (← 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)
• SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions (Q3502709) (← links)
• Separation logics and modalities: a survey (Q4586138) (← links)
• (Q4989410) (← links)
• Decision Procedure for Entailment of Symbolic Heaps with Arrays (Q5055997) (← links)
• On Temporal and Separation Logics (Q5079764) (← links)
• (Q5111651) (← links)
• The Bernays-Schönfinkel-Ramsey Class of Separation Logic with Uninterpreted Predicates (Q5121270) (← links)
• Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination (Q5387848) (← links)
• A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions (Q5875940) (← links)
• Completeness of cyclic proofs for symbolic heaps with inductive definitions (Q6536318) (← links)
• Testing the satisfiability of formulas in separation logic with permissions (Q6541165) (← links)