Article ID | Journal | Published Year | Pages | File Type |
---|---|---|---|---|
423900 | Electronic Notes in Theoretical Computer Science | 2011 | 17 Pages |
Abstract
This paper presents a new soundness proof for concurrent separation logic (CSL) in terms of a standard operational semantics. The proof gives a direct meaning to CSL judgments, which can easily be adapted to accommodate extensions of CSL, such as permissions and storable locks, as well as more advanced program logics, such as RGSep. Further, it explains clearly why resource invariants should be ‘precise’ in proofs using the conjunction rule.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics