1 citations · 1 across the 2 of their papers we have counts for
6 papers
Distributive Laws for Parallel Composition in Rely-Guarantee Concurrency
Ian J. Hayes, Larissa A. Meinicke
The rely/guarantee approach supports the stepwise development of concurrent programs. Our goal is to develop a theory for reasoning algebraically about concurrent programs in a rel…
Reasoning about concurrent loops and recursion with rely-guarantee rules
Ian J. Hayes, Larissa A. Meinicke, Cliff B. Jones
The objective of this paper is to present general, mechanically verified, refinement rules for reasoning about recursive programs and while loops in the context of concurrency. We…
Reasoning about expression evaluation under interference
Ian J. Hayes, Cliff B. Jones, Larissa A. Meinicke
Hoare-style inference rules for program constructs permit the copying of expressions and tests from program text into logical contexts. It is known that this requires care even for…
Practical Rely/Guarantee Verification of an Efficient Lock for seL4 on Multicore Architectures
Robert J. Colvin, Ian J. Hayes, Scott Heiner +3
Developers of low-level systems code providing core functionality for operating systems and kernels must address hardware-level features of modern multicore architectures. A partic…
Restructuring a concurrent refinement algebra
Ian J. Hayes, Larissa A. Meinicke, Naso Evangelou-Oost
The concurrent refinement algebra has been developed to support rely/guarantee reasoning about concurrent programs. The algebra supports atomic commands and defines parallel compos…
Data reification in a concurrent rely-guarantee algebra
Larissa A. Meinicke, Ian J. Hayes, Cliff B. Jones
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 program…