Unifying theories of parallel programming

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2495, Issue , 2002, Pages 24-37

  Woodcock, Jim ^a   Hughes, Arthur ^a  

^a UNIVERSITY OF KENT   (United Kingdom)

Author keywords

[No Author keywords available]

Indexed keywords

BIOMINERALIZATION; CALCULATIONS; FORMAL METHODS; PARALLEL PROGRAMMING; SEMANTICS;

ACTION SYSTEMS; FORMAL SEMANTICS; FORMALISATION; PARALLEL COMPOSITION; REFINEMENT CALCULI; SEQUENTIAL COMPOSITIONS; SHARED VARIABLES; UNIFYING THEORIES OF PROGRAMMING;

PROGRAMMING THEORY;

EID: 33746044880     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-36103-0_5     Document Type: Conference Paper

References (13)

1. R-J.R. Bac k and R. Kurki-Suonio. Decentralization of process nets with centralized control. In Proc 2nd Annual Symposium on Principles of Distributed Computing, Montreal, 1983.
2. R.J.R. Back and J. Wright. Refinement Calculus: A Systematic Introduction. Graduate Texts in Computer Science. Springer-Verlag, 1998.
3. Willem-Paul de Roever, Frank S. de Boer, Ulrich Hannemann, Jozef Hooman, Yassine Lakhnech, Mannes Poel, and Job Zwiers. Concurrency Verification : Introduction to Compositional and Noncompositional Methods. Number 54 in Cambridge Tracts in Theoretical Computer Science. Cam bridge University Press, 2001.
4. E.W. Dijkstra. A Discipline of Programming. Pren tice-Hall International, 1976.
5. C.A.R. Hoare and He Jifeng. Unifying Theories of Programming. Series in Computer Science.Pren tice Hall, 1998.
6. C.A.R. Hoare. An axiomatic basis for computer programming. Communications of the ACM, 12(10):576–583, October 1969.
7. C.B. Jones. Development methods for computer programs including a notion of interference. PhD thesis, University of Oxford, 1981.
8. Leslie Lamport and Fred B. Schneider. The ‘Hoare Logic’ of CSP, and All That. ACMT ransactions on Programming Languages and Systems, 6(2):281–296, April 1984.
9. Leslie Lamport. The ‘Hoare Logic’ of Concurrent Programs. Acta Informatica, 14:21–37, 1980.
10. C.C. Morgan. Programming from Specifications. Pren tice-Hall, 1990.
11. J.M. Morris. A Theoretical Basis for Stepwise Refinement and the Programming Calculus. Science of Computer Programming, 9(3):287–306, 1987.
12. Susan Owicki and David Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6:319–340, 1976.
13. Jim Woodcock and Arthur Hughes. Validation of Lamport’s Concurrent Hoare Logic.T echnical report, Computing Laboratory, University of Kent, Canterbury, UK, 2002.