Add to ORKGSummary. This paper shows how the theory of Communicating Sequential Processes (CSP) can be used to establish that a protocol guarantees sequential consistency. The protocol in question is an accepted design based upon lazy caching; it is an ideal example for the comparison of different formal description techniques
In distributed shared memory architectures, memory usually obeys weaker constraints than that of ord...
AbstractThe process-oriented design and implementation of concurrent systems have important advantag...
The parallel language CSP [9], an earlier version of which was described in [7], has become a major ...
AbstractIn a research report we have proposed an axiomatic semantics for the language of communicati...
In this paper we describe how the language of Communicating Sequential Processes (CSP) has been appl...
A memory model specifies a correctness requirement for a distributed shared memory protocol. Sequent...
Recently, distributed shared memory (DSM) systems have received much attention because such an abstr...
This paper presents a general approach for analysis and verification of authentication properties us...
This thesis presents proof rules for an extension of Hoare's Communicating Sequential Processes (CS...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
AbstractConsistency checking in the CSP ∥ B approach verifies that an individual controller process,...
Abstract. In shared-memory multiprocessors sequential consistency o ers a natural tradeo between the...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
This paper presents a general approach for analysis and verification of authentication properties in...
The semantics of communication in a distributed computing environment without shared objects are inv...
In distributed shared memory architectures, memory usually obeys weaker constraints than that of ord...
AbstractThe process-oriented design and implementation of concurrent systems have important advantag...
The parallel language CSP [9], an earlier version of which was described in [7], has become a major ...
AbstractIn a research report we have proposed an axiomatic semantics for the language of communicati...
In this paper we describe how the language of Communicating Sequential Processes (CSP) has been appl...
A memory model specifies a correctness requirement for a distributed shared memory protocol. Sequent...
Recently, distributed shared memory (DSM) systems have received much attention because such an abstr...
This paper presents a general approach for analysis and verification of authentication properties us...
This thesis presents proof rules for an extension of Hoare's Communicating Sequential Processes (CS...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
AbstractConsistency checking in the CSP ∥ B approach verifies that an individual controller process,...
Abstract. In shared-memory multiprocessors sequential consistency o ers a natural tradeo between the...
In this paper we present a proof of the sequential consistency of the lazy caching protocol of Afek,...
This paper presents a general approach for analysis and verification of authentication properties in...
The semantics of communication in a distributed computing environment without shared objects are inv...
In distributed shared memory architectures, memory usually obeys weaker constraints than that of ord...
AbstractThe process-oriented design and implementation of concurrent systems have important advantag...
The parallel language CSP [9], an earlier version of which was described in [7], has become a major ...