Pages that link to "Item:Q2234106"
From MaRDI portal
The following pages link to Compositional satisfiability solving in separation logic (Q2234106):
Displaying 8 items.
- Separating signs in the propositional satisfiability problem (Q1977918) (← links)
- Separation logic with linearly compositional inductive predicates and set data constraints (Q2206230) (← links)
- Satisfiability of compositional separation logic with tree predicates and data constraints (Q2405271) (← links)
- Combining preorder and postorder resolution in a satisfiability solver (Q2741518) (← links)
- Deciding Separation Logic Formulae by SAT and Incremental Negative Cycle Elimination (Q5387848) (← links)
- A proof procedure for separation logic with inductive definitions and data (Q6053843) (← links)
- Single-domain free logic and the problem of compositionality (Q6067309) (← links)
- Testing the satisfiability of formulas in separation logic with permissions (Q6541165) (← links)