Reasoning about separation using abstraction and reification
DOI10.1007/978-3-319-22969-0_1zbMATH Open1366.68026OpenAlexW1596781519MaRDI QIDQ5268439FDOQ5268439
Cliff B. Jones, Nisansala Yatapanage
Publication date: 20 June 2017
Published in: Software Engineering and Formal Methods (Search for Journal in Brave)
Full work available at URL: https://eprint.ncl.ac.uk/fulltext.aspx?url=213823/8231E0BB-14FC-46C2-9034-E59A94F53B96.pdf&pub_id=213823
Recommendations
Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19)
Cites Work
- Title not available (Why is that?)
- Title not available (Why is that?)
- Balancing expressiveness in formal approaches to concurrency
- An axiomatic basis for computer programming
- Resources, concurrency, and local reasoning
- A logic covering undefinedness in program proofs
- Tentative steps toward a development method for interfering programs
- A Marriage of Rely/Guarantee and Separation Logic
- Title not available (Why is that?)
- Splitting atoms safely
- Title not available (Why is that?)
- Modular Safety Checking for Fine-Grained Concurrency
- The dynamic frames theory
- Reasoning about Separation Using Abstraction and Reification
Cited In (4)
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)