Data reification in a concurrent rely-guarantee algebra

Specifications of significant systems can be made short and perspicuous by using abstract data types; data reification can provide a clear, stepwise, development history of programs that use more efficient concrete representations. Data reification (or "refinement") techniques for sequenti...

Full description

Saved in:
Bibliographic Details
Main Authors Meinicke, Larissa A, Hayes, Ian J, Jones, Cliff B
Format Journal Article
LanguageEnglish
Published 09.05.2024
Subjects
Computer Science - Logic in Computer Science
Computer Science - Software Engineering
Online AccessGet full text

Cover

More Information
Summary:Specifications of significant systems can be made short and perspicuous by using abstract data types; data reification can provide a clear, stepwise, development history of programs that use more efficient concrete representations. Data reification (or "refinement") techniques for sequential programs are well established. This paper applies these ideas to concurrency, in particular, an algebraic theory supporting rely-guarantee reasoning about concurrency. A concurrent version of the Galler-Fischer equivalence relation data structure is used as an example.
DOI:10.48550/arxiv.2405.05546