Add to ORKGThis paper presents adaptations of the Hoare triple for reasoning about concurrent programs. The rules for the Hoare triple, familiar to programmers from their experience with sequential programming, can be applied to develop proofs of concurrent programs as well. The basis for the adaptations of the Hoare triple is temporal logic
This thesis develops a new method for proving properties of concurrent programs and gives formal de...
In this paper, we suggest a method for proving the maximality of a program with respect to a given s...
In this paper the main approaches to constructing concurrent programs will be presented and compared...
This paper presents adaptations of the Hoare triple for reasoning about concurrent programs. The rul...
Classical Hoare triples are modified to specify and design distributed real-time systems. The assert...
AbstractThe formalism of Temporal Logic is suggested as an appropriate tool for formalizing the sema...
We survey the well-known algebraic laws of sequential programming, and extend them with some less fa...
Generalized Hoare Logic is a formal logical system for deriving invariance properties of programs. ...
AbstractA syntax-directed generalization of Owicki–Gries's Hoare logic for a parallel while language...
The algebraic laws for programming with concurrency are as simple as (and very similar to) the famil...
A logic for reasoning about timing properties of concurrent programs is presented. The logic is ba...
Abstract. We look at approaches to specifying concurrent program modules based on disjointness (the ...
AbstractIn this paper we propose a calculus for reasoning about concurrent programs inspired by the ...
In this thesis, we address the problem of verifying the functional correctness of concurrent program...
Specification and verification techniques for abstract data types that have been successful for sequ...
This thesis develops a new method for proving properties of concurrent programs and gives formal de...
In this paper, we suggest a method for proving the maximality of a program with respect to a given s...
In this paper the main approaches to constructing concurrent programs will be presented and compared...
This paper presents adaptations of the Hoare triple for reasoning about concurrent programs. The rul...
Classical Hoare triples are modified to specify and design distributed real-time systems. The assert...
AbstractThe formalism of Temporal Logic is suggested as an appropriate tool for formalizing the sema...
We survey the well-known algebraic laws of sequential programming, and extend them with some less fa...
Generalized Hoare Logic is a formal logical system for deriving invariance properties of programs. ...
AbstractA syntax-directed generalization of Owicki–Gries's Hoare logic for a parallel while language...
The algebraic laws for programming with concurrency are as simple as (and very similar to) the famil...
A logic for reasoning about timing properties of concurrent programs is presented. The logic is ba...
Abstract. We look at approaches to specifying concurrent program modules based on disjointness (the ...
AbstractIn this paper we propose a calculus for reasoning about concurrent programs inspired by the ...
In this thesis, we address the problem of verifying the functional correctness of concurrent program...
Specification and verification techniques for abstract data types that have been successful for sequ...
This thesis develops a new method for proving properties of concurrent programs and gives formal de...
In this paper, we suggest a method for proving the maximality of a program with respect to a given s...
In this paper the main approaches to constructing concurrent programs will be presented and compared...