A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
A Program Construction and Verification Tool for Separation Logic
[chapter]
2015
Lecture Notes in Computer Science
An algebraic approach to the design of program construction and verification tools is applied to separation logic. The control-flow level is modelled by power series with convolution as separating conjunction. A generic construction lifts resource monoids to assertion and predicate transformer quantales. The data domain is captured by concrete store-heap models. These are linked to the separation algebra by soundness proofs. Verification conditions and transformation or refinement laws are
doi:10.1007/978-3-319-19797-5_7
fatcat:o4cbszfqz5cxvfaj3v5sk4q2l4