In this paper we introduce an abstract algebra for reasoning about concurrent programs, that includes an abstract algebra of atomic steps, with sub-algebras of program and environment steps, and an abstract synchronisation operator. We show how the abstract synchronisation operator can be instantiated as a synchronous parallel operator with interpretations in rely-guarantee concurrency for shared-memory systems, and in process algebras CCS and CSP. It is also instantiated as a weak conjunction operator, an operator that is useful for the specification of rely and guarantee conditions in rely/guarantee concurrency. The main differences between the parallel and weak conjunction instantiations of the synchronisation operator are how they combi...
As part of an effort to give a "truly concurrent" semantics to process algebra, we propose...
Modern concurrent and distributed software is highly complex. Techniques to reason about the correct...
Modern concurrent and distributed software is highly complex. Techniques to reason about the correct...
An algebra for rely/guarantee concurrency has been constructed via a hierarchy of algebraic theories...
In this paper we present a theory for the refinement of shared-memory concurrent algorithms from spe...
In this paper we present a theory for the refinement of shared-memory concurrent algorithms from spe...
The rely-guarantee technique allows one to reason compositionally about concurrent programs. To hand...
In this paper we present a theory for the refinement of shared-memory concurrent algorithms from spe...
Concurrent program refinement algebra provides a suitable basis for supporting mechanised reasoning ...
We survey the well-known algebraic laws of sequential programming, and extend them with some less fa...
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchan...
Our original goal was to develop a refinement calculus for shared-memory concurrent programs to supp...
A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and conc...
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchan...
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchan...
As part of an effort to give a "truly concurrent" semantics to process algebra, we propose...
Modern concurrent and distributed software is highly complex. Techniques to reason about the correct...
Modern concurrent and distributed software is highly complex. Techniques to reason about the correct...
An algebra for rely/guarantee concurrency has been constructed via a hierarchy of algebraic theories...
In this paper we present a theory for the refinement of shared-memory concurrent algorithms from spe...
In this paper we present a theory for the refinement of shared-memory concurrent algorithms from spe...
The rely-guarantee technique allows one to reason compositionally about concurrent programs. To hand...
In this paper we present a theory for the refinement of shared-memory concurrent algorithms from spe...
Concurrent program refinement algebra provides a suitable basis for supporting mechanised reasoning ...
We survey the well-known algebraic laws of sequential programming, and extend them with some less fa...
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchan...
Our original goal was to develop a refinement calculus for shared-memory concurrent programs to supp...
A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and conc...
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchan...
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchan...
As part of an effort to give a "truly concurrent" semantics to process algebra, we propose...
Modern concurrent and distributed software is highly complex. Techniques to reason about the correct...
Modern concurrent and distributed software is highly complex. Techniques to reason about the correct...