The satisfiability problem in a separation logic of relations

DOI10.1007/978-3-031-99536-1_16MaRDI QIDQ6876451zbMATH OpenFDO

Authors Nicolas Peltier

Publication date 13 January 2026

Full work available at URL https://doi.org/10.1007/978-3-031-99536-1_16

Mathematics Subject Classification ID

Computer science (68-XX)

Cites work

• A decision procedure for satisfiability in separation logic with inductive predicates
• Alternation
• An EXPTIME-complete entailment problem in separation logic
• BI as an assertion language for mutable data structures
• Decision problems in a logic for reasoning about reconfigurable distributed systems
• Static Analysis

This page was built for publication: The satisfiability problem in a separation logic of relations

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6876451)