The algebraic laws for programming with concurrency are as simple as (and very similar to) the familiar laws of arithmetic. Yet they are stronger for reasoning about the properties of programs than the axioms of Hoare Logic and the rules of an operational semantics put together
A programming calculus is presented which will yield programs with simple, suitable, and safe concur...
An algebra for rely/guarantee concurrency has been constructed via a hierarchy of algebraic theories...
The EXPRESS workshops aim at bringing together researchers interested in the relations between vario...
We survey the well-known algebraic laws of sequential programming, and extend them with some less fa...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
In this paper we introduce an abstract algebra for reasoning about concurrent programs, that include...
AbstractIn this methodology, programming problems which can be specified by an input/output assertio...
This paper studies algebraic models for concurrency, in light of recent work on Concurrent Kleene Al...
Program algebras abstract the essential properties of programming languages in the form of algebraic...
This is an attempt to combine the two research areas of programming methodology and automated theore...
Abstract. The views framework of Dinsdale-Young and others unifies several compositional techniques ...
This paper has the purpose of reviewing some of the established relationships between logic and conc...
This paper presents adaptations of the Hoare triple for reasoning about concurrent programs. The rul...
A programming calculus is presented which will yield programs with simple, suitable, and safe concur...
An algebra for rely/guarantee concurrency has been constructed via a hierarchy of algebraic theories...
The EXPRESS workshops aim at bringing together researchers interested in the relations between vario...
We survey the well-known algebraic laws of sequential programming, and extend them with some less fa...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
One might think that specifying and reasoning about concurrent programs would be easier with more ex...
In this paper we introduce an abstract algebra for reasoning about concurrent programs, that include...
AbstractIn this methodology, programming problems which can be specified by an input/output assertio...
This paper studies algebraic models for concurrency, in light of recent work on Concurrent Kleene Al...
Program algebras abstract the essential properties of programming languages in the form of algebraic...
This is an attempt to combine the two research areas of programming methodology and automated theore...
Abstract. The views framework of Dinsdale-Young and others unifies several compositional techniques ...
This paper has the purpose of reviewing some of the established relationships between logic and conc...
This paper presents adaptations of the Hoare triple for reasoning about concurrent programs. The rul...
A programming calculus is presented which will yield programs with simple, suitable, and safe concur...
An algebra for rely/guarantee concurrency has been constructed via a hierarchy of algebraic theories...
The EXPRESS workshops aim at bringing together researchers interested in the relations between vario...
DOI
Add to ORKG