Reasoning about Separation Using Abstraction and Reification

DOI10.1007/978-3-319-22969-0_1zbMath1366.68026OpenAlexW1596781519MaRDI QIDQ5268439

Nisansala Yatapanage, Cliff B. Jones

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

zbMATH Keywords

separationconcurrencyabstractionownership

Mathematics Subject Classification ID

Other programming paradigms (object-oriented, sequential, concurrent, automatic, etc.) (68N19) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (3)

Possible values: exploring a concept for concurrency ⋮ Investigating the limits of rely/guarantee relations based on a concurrent garbage collector example ⋮ Reasoning about Separation Using Abstraction and Reification

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• The dynamic frames theory
• A logic covering undefinedness in program proofs
• Splitting atoms safely
• Resources, concurrency, and local reasoning
• Balancing expressiveness in formal approaches to concurrency
• A Marriage of Rely/Guarantee and Separation Logic
• Modular Safety Checking for Fine-Grained Concurrency
• Tentative steps toward a development method for interfering programs
• Reasoning about Separation Using Abstraction and Reification
• An axiomatic basis for computer programming

This page was built for publication: Reasoning about Separation Using Abstraction and Reification