Reasoning about separation using abstraction and reification
From MaRDI portal
Publication:5268439
Recommendations
Cites work
- scientific article; zbMATH DE number 1612488 (Why is no real title available?)
- scientific article; zbMATH DE number 46957 (Why is no real title available?)
- scientific article; zbMATH DE number 3584897 (Why is no real title available?)
- scientific article; zbMATH DE number 2090840 (Why is no real title available?)
- A Marriage of Rely/Guarantee and Separation Logic
- A logic covering undefinedness in program proofs
- An axiomatic basis for computer programming
- Balancing expressiveness in formal approaches to concurrency
- Modular Safety Checking for Fine-Grained Concurrency
- Reasoning about separation using abstraction and reification
- Resources, concurrency, and local reasoning
- Splitting atoms safely
- Tentative steps toward a development method for interfering programs
- The dynamic frames theory
Cited in
(5)- Reasoning about separation using abstraction and reification
- Investigating the limits of rely/guarantee relations based on a concurrent garbage collector example
- Possible values: exploring a concept for concurrency
- Separation logic and abstraction
- Specifying and reasoning about shared-variable concurrency
This page was built for publication: Reasoning about separation using abstraction and reification
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5268439)