Expressive completeness of separation logic with two variables and no separating conjunction

DOI10.1145/2603088.2603142MaRDI QIDQ4635622zbMATH OpenOpenAlexWikidataFDO

Authors Stéphane Demri, Morgan Deters

Publication date 23 April 2018

Published in Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1145/2603088.2603142

zbMATH Keywords

separation logicexpressive completeness

Mathematics Subject Classification ID

Logic in computer science (03B70)

Recommendations

• Expressive completeness of separation logic with two variables and no separating conjunction
• Two-Variable Separation Logic and Its Inner Circle
• Semipositivity in separation logic with two variables
• Separation logic with one quantified variable
• Separation logic with one quantified variable

Cited in

(9)

• Automated theorem proving for assertions in separation logic with all connectives
• On the almighty wand
• Separation logics and modalities: a survey
• Separation logic with one quantified variable
• Expressive completeness of separation logic with two variables and no separating conjunction
• Two-Variable Separation Logic and Its Inner Circle
• Semipositivity in separation logic with two variables
• Separation logic with one quantified variable
• Strong-separation logic

This page was built for publication: Expressive completeness of separation logic with two variables and no separating conjunction

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