AbstractIn this paper we propose a calculus for reasoning about concurrent programs inspired by the wp calculus for reasoning about sequential programs. The calculus uses a small set of familiar rules for dealing with safety, progress and parallel composition. A contribution of this paper is to demonstrate how predicate calculus in general, and predicate transformers in particular, can be used to reason about concurrent programs in which fairness plays a critical role
AbstractThis paper introduces open systems with non-trivial environment actions and proposes a coope...
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchan...
This paper presents adaptations of the Hoare triple for reasoning about concurrent programs. The rul...
AbstractIn this paper we propose a calculus for reasoning about concurrent programs inspired by the ...
In this paper we propose a calculus for reasoning about concurrent programs inspired by the wp calcu...
AbstractIn previous work we have developed a transition trace semantic framework, suitable for share...
We survey the well-known algebraic laws of sequential programming, and extend them with some less fa...
AbstractThis paper presents proof principles for establishing invariance and liveness properties of ...
The logic of Owicki and Gries is a well-known logic for verifying safety properties of concurrent pr...
This paper describes a logic of progress for concurrent programs. The logic is based on that of UNIT...
The logic of Owicki and Gries is a well known logic for verifying safety properties of concurrent pr...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
Most programming languages in use today have some way to express concurrent execution of proce...
A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and conc...
In this paper we introduce an abstract algebra for reasoning about concurrent programs, that include...
AbstractThis paper introduces open systems with non-trivial environment actions and proposes a coope...
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchan...
This paper presents adaptations of the Hoare triple for reasoning about concurrent programs. The rul...
AbstractIn this paper we propose a calculus for reasoning about concurrent programs inspired by the ...
In this paper we propose a calculus for reasoning about concurrent programs inspired by the wp calcu...
AbstractIn previous work we have developed a transition trace semantic framework, suitable for share...
We survey the well-known algebraic laws of sequential programming, and extend them with some less fa...
AbstractThis paper presents proof principles for establishing invariance and liveness properties of ...
The logic of Owicki and Gries is a well-known logic for verifying safety properties of concurrent pr...
This paper describes a logic of progress for concurrent programs. The logic is based on that of UNIT...
The logic of Owicki and Gries is a well known logic for verifying safety properties of concurrent pr...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
Most programming languages in use today have some way to express concurrent execution of proce...
A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and conc...
In this paper we introduce an abstract algebra for reasoning about concurrent programs, that include...
AbstractThis paper introduces open systems with non-trivial environment actions and proposes a coope...
A Concurrent Kleene Algebra offers two composition operators, related by a weak version of an exchan...
This paper presents adaptations of the Hoare triple for reasoning about concurrent programs. The rul...