Separation Logic for Higher-Order Store

DOI10.1007/11874683_38zbMath1225.03033OpenAlexW1790417275MaRDI QIDQ3613364

Bernhard Reus, Jan Schwinghammer

Publication date: 12 March 2009

Published in: Computer Science Logic (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/11874683_38

Mathematics Subject Classification ID

Logic in computer science (03B70) Specification and verification (program logics, model checking, etc.) (68Q60) Data structures (68P05) Substructural logics (including relevance, entailment, linear logic, Lambek calculus, BCK and BCI logics) (03B47)

Related Items (4)

Symbolic execution proofs for higher order store programs ⋮ Automated Theorem Proving for Assertions in Separation Logic with All Connectives ⋮ Weak updates and separation logic ⋮ Nested Hoare Triples and Frame Rules for Higher-Order Store

This page was built for publication: Separation Logic for Higher-Order Store