Browse by author
Lookup NU author(s): Professor Ian Hayes,
Dr Andrius Velykis
Full text for this publication is not currently held within this repository. Alternative links are provided below where available.
This research started with an algebra for reasoning about rely/guarantee concurrency for a shared memory model. The approach taken led to a more abstract algebra of atomic steps, in which atomic steps synchronise (rather than interleave) when composed in parallel. The algebra of rely/guarantee concurrency then becomes an interpretation of the more abstract algebra. Many of the core properties needed for rely/guarantee reasoning can be shown to hold in the abstract algebra where their proofs are simpler and hence allow a higher degree of automation. Moreover, the realisation that the synchronisation mechanisms of standard process algebras, such as CSP and CCS/SCCS, can be interpreted in our abstract algebra gives evidence of its unifying power. The algebra has been encoded in Isabelle/HOL to provide a basis for tool support.
Author(s): Hayes IJ, Colvin RJ, Meinicke LA, Winter K, Velykis A
Publication type: Conference Proceedings (inc. Abstract)
Publication status: Published
Conference Name: FM 2016: Formal Methods
Year of Conference: 2016
Online publication date: 08/11/2016
Acceptance date: 01/01/1900
Library holdings: Search Newcastle University Library for this item
Series Title: Lecture Notes in Computer Science