AbstractA weakest precondition semantics for communicating processes is presented, based on a centralized, one-level approach. Semantic equations are given for the CSP constructs and their continuity is proved. The equivalence of two weakest precondition definitions, one with certain order preferences, and another one, preference-free, is shown. The representation of various operational concepts, including delay, is discussed. Several examples of applying the rules are given
Recently, Aceto, Fokkink and Ingólfsdóttir proposed an algorithm to turn any sound and ground-comple...
AbstractIdealized CSP is a programming language combining simply typed, call-by-name procedures with...
A theory of timewise refinement is presented. This allows the translation of specifications and proo...
AbstractA weakest precondition semantics for communicating processes is presented, based on a centra...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
In C. A. R. Hoare, S. D. Brookes, and A. D. Roscoe (1984, J. Assoc. Comput. Mach. 31(3), 560) an abs...
In C. A. R. Hoare, S. D. Brookes, and A. D. Roscoe (1984, J. Assoc. Comput. Mach. 31(3), 560) an abs...
AbstractA previous paper by Hoare gives axioms and proof rules for communicating processes that prov...
In this paper we consider the relationship between refinement-oriented specification and specificati...
The author previously defined CSP-like operational semantics whose main restrictions were the automa...
AbstractIn this paper we present two languages that are refinements of timed CSP (Davies and Schneid...
(Brief abstract written by the author in 2011 since I don't have the original to hand.)This thesis i...
AbstractThe original CSP was a language for parallel imperative programs communicating by synchroniz...
This thesis presents proof rules for an extension of Hoare's Communicating Sequential Processes (CS...
Recently, Aceto, Fokkink and Ingólfsdóttir proposed an algorithm to turn any sound and ground-comple...
Recently, Aceto, Fokkink and Ingólfsdóttir proposed an algorithm to turn any sound and ground-comple...
AbstractIdealized CSP is a programming language combining simply typed, call-by-name procedures with...
A theory of timewise refinement is presented. This allows the translation of specifications and proo...
AbstractA weakest precondition semantics for communicating processes is presented, based on a centra...
AbstractDijkstra and Scholten (1990) present an axiomatic semantics for Dijkstra's guarded command l...
In C. A. R. Hoare, S. D. Brookes, and A. D. Roscoe (1984, J. Assoc. Comput. Mach. 31(3), 560) an abs...
In C. A. R. Hoare, S. D. Brookes, and A. D. Roscoe (1984, J. Assoc. Comput. Mach. 31(3), 560) an abs...
AbstractA previous paper by Hoare gives axioms and proof rules for communicating processes that prov...
In this paper we consider the relationship between refinement-oriented specification and specificati...
The author previously defined CSP-like operational semantics whose main restrictions were the automa...
AbstractIn this paper we present two languages that are refinements of timed CSP (Davies and Schneid...
(Brief abstract written by the author in 2011 since I don't have the original to hand.)This thesis i...
AbstractThe original CSP was a language for parallel imperative programs communicating by synchroniz...
This thesis presents proof rules for an extension of Hoare's Communicating Sequential Processes (CS...
Recently, Aceto, Fokkink and Ingólfsdóttir proposed an algorithm to turn any sound and ground-comple...
Recently, Aceto, Fokkink and Ingólfsdóttir proposed an algorithm to turn any sound and ground-comple...
AbstractIdealized CSP is a programming language combining simply typed, call-by-name procedures with...
A theory of timewise refinement is presented. This allows the translation of specifications and proo...
DOI
Add to ORKG