The following pages link to (Q4783297):
Displaying 22 items.
- Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic (Q2988661) (← links)
- The Relationship between Separation Logic and Implicit Dynamic Frames (Q3000593) (← links)
- Verification of the Schorr-Waite Algorithm – From Trees to Graphs (Q3003486) (← links)
- Partiality, State and Dependent Types (Q3007667) (← links)
- Verifying Object-Oriented Programs with Higher-Order Separation Logic in Coq (Q3087993) (← links)
- A Machine-Checked Framework for Relational Separation Logic (Q3095237) (← links)
- Completeness for a First-Order Abstract Separation Logic (Q3179309) (← links)
- A Formalisation of Smallfoot in HOL (Q3183546) (← links)
- Automatic Parallelization and Optimization of Programs by Proof Rewriting (Q3392920) (← links)
- Bottom-Up Shape Analysis (Q3392926) (← links)
- Automated Theorem Proving for Assertions in Separation Logic with All Connectives (Q3454118) (← links)
- Safe Modification of Pointer Programs in Refinement Calculus (Q3521993) (← links)
- Lightweight Separation (Q3543659) (← links)
- On Temporal and Separation Logics (Q5079764) (← links)
- (Q5111651) (← links)
- Propositional Dynamic Logic with Storing, Recovering and Parallel Composition (Q5179014) (← links)
- Separation Logic Semantics for Communicating Processes (Q5415605) (← links)
- Multimodal Separation Logic for Reasoning About Operational Semantics (Q5415628) (← links)
- Higher-Order Separation Logic in Isabelle/HOLCF (Q5415649) (← links)
- A Resource Analysis of the π-calculus (Q5739364) (← links)
- A proof procedure for separation logic with inductive definitions and data (Q6053843) (← links)
- Concise outlines for a complex logic: a proof outline checker for TaDA (Q6145023) (← links)
