The following pages link to (Q4474211):
Displaying 37 items.
- On the almighty wand (Q418137) (← links)
- Reasoning about sequences of memory states (Q636268) (← links)
- Quantitative separation logic and programs with lists (Q707740) (← links)
- Formal verification of C systems code. Structured types, separation logic and theorem proving (Q835768) (← links)
- Expressiveness and complexity of graph logic (Q870359) (← links)
- Relational separation logic (Q879369) (← links)
- Compositional entailment checking for a fragment of separation logic (Q1688543) (← links)
- Elimination of spatial connectives in static spatial logics (Q1763729) (← links)
- Strong-separation logic (Q2233486) (← links)
- Separation logic with one quantified variable (Q2411038) (← links)
- Elimination of quantifiers and undecidability in spatial logics for concurrency (Q2503043) (← links)
- A logic of reachable patterns in linked data-structures (Q2643337) (← links)
- Complexity Optimal Decision Procedure for a Propositional Dynamic Logic with Parallel Composition (Q2817938) (← links)
- Manipulating Trees with Hidden Labels (Q2864150) (← links)
- Two-Variable Separation Logic and Its Inner Circle (Q2957697) (← links)
- Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic (Q2961583) (← links)
- Tractable Reasoning in a Fragment of Separation Logic (Q3090833) (← links)
- Completeness for a First-Order Abstract Separation Logic (Q3179309) (← links)
- Undecidability of Propositional Separation Logic and Its Neighbours (Q3189649) (← links)
- Being and Change: Reasoning About Invariance (Q3449632) (← links)
- Automated Theorem Proving for Assertions in Separation Logic with All Connectives (Q3454118) (← links)
- On the Almighty Wand (Q3540188) (← links)
- Lightweight Separation (Q3543659) (← links)
- Beyond Shapes: Lists with Ordered Data (Q3617745) (← links)
- On Model Checking Boolean BI (Q3644756) (← links)
- Separation logics and modalities: a survey (Q4586138) (← links)
- Trakhtenbrot’s Theorem in Coq (Q5048993) (← links)
- (Q5090983) (← links)
- (Q5094147) (← links)
- (Q5111651) (← links)
- (Q5155678) (← links)
- Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction (Q5277913) (← links)
- A Decision Procedure for Guarded Separation Logic Complete Entailment Checking for Separation Logic with Inductive Definitions (Q5875940) (← links)
- Program Verification with Separation Logic (Q5883571) (← links)
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5918962) (← links)
- An auxiliary logic on trees: on the tower-hardness of logics featuring reachability and submodel reasoning (Q5925549) (← links)
- The logic of separation logic: models and proofs (Q6541164) (← links)
