Work

Data reification in a concurrent rely-guarantee algebra

Year: 2024

Type: preprint

Abstract: 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.

Source: arXiv (Cornell University)

DOI: 10.48550/arxiv.2405.05546

Authors: Meinicke, Larissa A., Hayes, Ian J., Jones, Cliff B.

Institutions: Queensland University of Technology, The University of Queensland, Newcastle University

Language: English

Topic: Logic, programming, and type systems

Subfield: Artificial Intelligence

Field: Computer Science

Domain: Physical Sciences

Open Access status: green

OpenAlex ID: W4396822141

Cites:

Cited by:

Related to: 10