Add to ORKGWe present a theorem for deriving properties of a concurrent program by reasoning about a simpler, coarser-grained version. The theorem generalizes a result that Lipton proved for partial correctness and deadlock-freedom. Our theorem applies to all safety properties
Concurrent and reactive programs are specified by their behaviours in the presence of a nondetermini...
. Analysis of concurrent systems is plagued by the state explosion problem. We describe an analysis ...
We present a general unwinding framework for the definition of information flow security properties ...
Most proof methods for reasoning about concurrent programs are based upon the interleaving semantics...
Abstract. Modern concurrent algorithms are usually encapsulated in libraries, and complex algorithms...
AbstractThis paper presents proof principles for establishing invariance and liveness properties of ...
In this thesis, we address the problem of verifying the functional correctness of concurrent program...
We present a proof calculus and method for the static verification of assertions and procedure speci...
We are interested in identifying and enforcing the isolation requirements ofa concurrent program, i....
AbstractIn previous work we have developed a transition trace semantic framework, suitable for share...
This thesis develops a new method for proving properties of concurrent programs and gives formal de...
In concurrent programming, non-blocking synchronization is very efficient but difficult to design co...
The logic of Owicki and Gries is a well-known logic for verifying safety properties of concurrent pr...
Using the fiction of atomicity as a design abstraction and then refining atomicity as we develop an ...
Recent program logics based on separation logic emphasise a modular approach to proving functional c...
Concurrent and reactive programs are specified by their behaviours in the presence of a nondetermini...
. Analysis of concurrent systems is plagued by the state explosion problem. We describe an analysis ...
We present a general unwinding framework for the definition of information flow security properties ...
Most proof methods for reasoning about concurrent programs are based upon the interleaving semantics...
Abstract. Modern concurrent algorithms are usually encapsulated in libraries, and complex algorithms...
AbstractThis paper presents proof principles for establishing invariance and liveness properties of ...
In this thesis, we address the problem of verifying the functional correctness of concurrent program...
We present a proof calculus and method for the static verification of assertions and procedure speci...
We are interested in identifying and enforcing the isolation requirements ofa concurrent program, i....
AbstractIn previous work we have developed a transition trace semantic framework, suitable for share...
This thesis develops a new method for proving properties of concurrent programs and gives formal de...
In concurrent programming, non-blocking synchronization is very efficient but difficult to design co...
The logic of Owicki and Gries is a well-known logic for verifying safety properties of concurrent pr...
Using the fiction of atomicity as a design abstraction and then refining atomicity as we develop an ...
Recent program logics based on separation logic emphasise a modular approach to proving functional c...
Concurrent and reactive programs are specified by their behaviours in the presence of a nondetermini...
. Analysis of concurrent systems is plagued by the state explosion problem. We describe an analysis ...
We present a general unwinding framework for the definition of information flow security properties ...