Add to ORKGIn this paper we propose a calculus for reasoning about concurrent programs inspired by the wp calculus for reasoning about sequential programs. We suggest predicate transformers for reasoning about progress properties and for deducing properties obtained by parallel composition. The paper presents theorems about the predicate transformers and suggests how they can be used in program design. Familiarity with the wp calculus is assumed
Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reaso...
Interference is the essence of concurrency and it is what makes reasoning about concurrent programs ...
AbstractIn a research report we have proposed an axiomatic semantics for the language of communicati...
In this paper we propose a calculus for reasoning about concurrent programs inspired by the wp calcu...
AbstractIn this paper we propose a calculus for reasoning about concurrent programs inspired by the ...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
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...
A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and conc...
This work aims at exploring the algebraic structure of concurrent processes and their behavior indep...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
In this paper we introduce an abstract algebra for reasoning about concurrent programs, that include...
AbstractThe development of programs is an activity that can be based on mathematical principles and ...
AbstractIn previous work we have developed a transition trace semantic framework, suitable for share...
This paper describes a logic of progress for concurrent programs. The logic is based on that of UNIT...
Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reaso...
Interference is the essence of concurrency and it is what makes reasoning about concurrent programs ...
AbstractIn a research report we have proposed an axiomatic semantics for the language of communicati...
In this paper we propose a calculus for reasoning about concurrent programs inspired by the wp calcu...
AbstractIn this paper we propose a calculus for reasoning about concurrent programs inspired by the ...
Predicate transformers that map the postcondition and all intermediate conditions of a command to a ...
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...
A concurrent Kleene algebra offers, next to choice and iteration, operators for sequential and conc...
This work aims at exploring the algebraic structure of concurrent processes and their behavior indep...
AbstractExample higher-order programs are presented in the style of Hoare logic and refinement calcu...
In this paper we introduce an abstract algebra for reasoning about concurrent programs, that include...
AbstractThe development of programs is an activity that can be based on mathematical principles and ...
AbstractIn previous work we have developed a transition trace semantic framework, suitable for share...
This paper describes a logic of progress for concurrent programs. The logic is based on that of UNIT...
Predicate transformers are formalized in higher order logic. This gives a basis for mechanized reaso...
Interference is the essence of concurrency and it is what makes reasoning about concurrent programs ...
AbstractIn a research report we have proposed an axiomatic semantics for the language of communicati...