Strong-separation logic
From MaRDI portal
Publication:2233486
DOI10.1007/978-3-030-72019-3_24zbMath1473.03015arXiv2001.06235OpenAlexW3151003345MaRDI QIDQ2233486
Publication date: 18 October 2021
Full work available at URL: https://arxiv.org/abs/2001.06235
Related Items (1)
Cites Work
- Unnamed Item
- On the almighty wand
- Resources, concurrency, and local reasoning
- The effects of adding reachability predicates in propositional separation logic
- A separation logic with data: small models and automation
- A decision procedure for separation logic in SMT
- A decidable fragment in separation logic with inductive predicates and arithmetic
- Strong-separation logic
- The Bernays-Schönfinkel-Ramsey class of separation logic on arbitrary domains
- A Complete Decision Procedure for Linearly Compositional Separation Logic with Data Constraints
- Separation Logic Modulo Theories
- Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic
- Tractable Reasoning in a Fragment of Separation Logic
- Deciding Entailments in Inductive Separation Logic with Tree Automata
- Separation Logic with Monadic Inductive Definitions and Implicit Existentials
- Expressive completeness of separation logic with two variables and no separating conjunction
- The Tree Width of Separation Logic with Recursive Definitions
- Separation Logic with One Quantified Variable
- BI as an assertion language for mutable data structures
- Permission accounting in separation logic
- Compositional Shape Analysis by Means of Bi-Abduction
- Decidable logics combining heap structures and data
- Foundations for Decision Problems in Separation Logic with General Inductive Predicates
- FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
- Programming Languages and Systems
- Program Logics for Certified Compilers
This page was built for publication: Strong-separation logic
