Satisfiability of compositional separation logic with tree predicates and data constraints
From MaRDI portal
Publication:2405271
Recommendations
- Compositional satisfiability solving in separation logic
- Separation logic with linearly compositional inductive predicates and set data constraints
- A complete decision procedure for linearly compositional separation logic with data constraints
- Satisfiability in composition-nominative logics
- Constraint Satisfaction, Bounded Treewidth, and Finite-Variable Logics
- Satisfiability of a Spatial Logic with Tree Variables
- Satisfiability of \(\mathsf {ECTL}^*\) with tree constraints
- Logics for unordered trees with data constraints
- The SAT-based approach to separation logic
- scientific article; zbMATH DE number 1104359
Cited in
(10)- Reasoning about block-based cloud storage systems via separation logic
- Separation logic with linearly compositional inductive predicates and set data constraints
- Compositional satisfiability solving in separation logic
- A decidable logic for tree data-structures with measurements
- Logics for Unordered Trees with Data Constraints on Siblings
- Tractability of separation logic with inductive definitions: beyond lists
- An efficient decision procedure for imperative tree data structures
- A proof procedure for separation logic with inductive definitions and data
- An undecidability result for separation logic with theory reasoning
- Testing the satisfiability of formulas in separation logic with permissions
This page was built for publication: Satisfiability of compositional separation logic with tree predicates and data constraints
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2405271)
