Refinement in Circus

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

Volumn 2391, Issue , 2002, Pages 451-470

  Sampaio, Augusto ^a   Woodcock, Jim ^b   Cavalcanti, Ana ^a  

^a FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

^b UNIVERSITY OF KENT   (United Kingdom)

Author keywords

CSP; Distribution; Unifying theories of programming; Z

Indexed keywords

CALCULATIONS; SPECIFICATION LANGUAGES; SPECIFICATIONS;

DATA REFINEMENTS; DISTRIBUTED SYSTEMS; DISTRIBUTION; INTERNAL STATE; PROCESS REFINEMENT; REFINEMENT CALCULI; REFINEMENT LAWS; UNIFYING THEORIES OF PROGRAMMING;

FORMAL METHODS;

EID: 84937401865     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45614-7_26     Document Type: Conference Paper

References (21)

1. R. J. R. Back. Refinement of parallel and reactive programs. In Proceedings of the Summer School on Program Design Calculi, Lecture Notes in Computer Science. Springer-Verlag, 1992.
2. A. L. C. Cavalcanti and J. C. P. Woodcock. ZRC - A Refinement Calculus for Z. Formal Aspects of Computing, 10(3):267–289, 1999.
3. E. W. Dijkstra. Guarded commands, nondeterminacy and the formal derivation of programs. Communication of the ACM, 18:453–457, 1975.
4. C. Fischer. How to Combine Z with a Process Algebra. In J. Bowen, A. Fett, and M. Hinchey, editors, ZUM’98: The Z Formal Specification Notation. Springer- Verlag, 1998.
5. J. He, C. A. R. Hoare, and J. W. Sanders. Data Refinement Refined. In G. Goos and H. Hartmants, editors, ESOP’86 European Symposium on Programming, volume 213 of Lecture Notes in Computer Science, pages 187–196, March 1986.
6. C. A. R. Hoare. An Axiomatic Basis for Computer Programming. Communications of the ACM, 12:576–580, 1969.
7. C. A. R. Hoare. Proof of Correctness of Data Representations. Acta Informatica, 1:271–281, 1972.
8. C. A. R. Hoare. Communicating Sequential Processes. Prentice-Hall International, 1985.
9. C. A. R. Hoare and He Jifeng. Unifying Theories of Programming. Prentice-Hall, 1998.
10. C. C. Morgan. Programming from Specifications. Prentice-Hall, 2nd edition, 1994.
11. C. C. Morgan and P. H. B. Gardiner. Data Refinement by Calculation. Acta Informatica, 27(6):481–503, 1990.
12. J. M. Morris. A Theoretical Basis for Stepwise Refinement and the Programming Calculus. Science of Computer Programming, 9(3):287–306, 1987.
13. S. Owicki and D. Gries. An axiomatic proof technique for parallel programs I. Acta Informatica, 6:319–340, 1976.
14. S. Owicki and D. Gries. Verifying properties of parallel programs: an axiomatic approach. Communications of the ACM, 19(5):279–285, 1976.
15. A. W. Roscoe. The Theory and Practice of Concurrency. Prentice-Hall Series in Computer Science. Prentice-Hall, 1998.
16. J. M. Spivey. The Z Notation: A Reference Manual. Prentice-Hall, 2nd edition, 1992.
17. J. C. P. Woodcock and A. L. C. Cavalcanti. Circus: a concurrent refinement language. Technical report, Oxford University Computing Laboratory, Wolfson Building, Parks Road, Oxford OX1 3QD UK, July 2001.
18. J. C. P. Woodcock and A. L. C. Cavalcanti. A concurrent language for refinement. In Andrew Butterfield and Claus Pahl, editors, IWFM’01: 5th Irish Workshop in Formal Methods. Computer Science Department, Trinity College Dublin, July 2001.
19. J. C. P. Woodcock and A. L. C. Cavalcanti. The steam boiler in a unified theory of Z and CSP. In 8th Asia-Pacific Software Engineering Conference (APSEC 2001), 2001.
20. J. C. P. Woodcock and A. L. C. Cavalcanti. The Semantics of Circus. In ZB 2002 International Conference, 2002. To appear.
21. J. C. P. Woodcock and J. Davies. Using Z–Specification, Refinement, and Proof. Prentice-Hall, 1996.