Separation Logic with One Quantified Variable

DOI10.1007/978-3-319-06686-8_10zbMath1408.68036OpenAlexW21201483MaRDI QIDQ4981154

Stéphane P. Demri, Didier Galmiche, Dominique Larchey-Wendling, Daniel Méry

Publication date: 24 June 2014

Published in: Computer Science - Theory and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-06686-8_10

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Logic in computer science (03B70) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items

Expressive Completeness of Separation Logic with Two Variables and No Separating Conjunction, Automated Theorem Proving for Assertions in Separation Logic with All Connectives, Completeness for a First-Order Abstract Separation Logic, Separation logic with one quantified variable, Separation logics and modalities: a survey, A proof procedure for separation logic with inductive definitions and data, Two-Variable Separation Logic and Its Inner Circle, Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic, An algebraic glimpse at bunched implications and separation logic, Strong-separation logic