A Refinement Strategy for Circus

Formal Aspects of Computing

Volumn 15, Issue 2-3, 2003, Pages 146-181

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

^a UNIVERSITY OF KENT   (United Kingdom)

^b FEDERAL UNIVERSITY OF PERNAMBUCO   (Brazil)

Author keywords

Concurrency; CSP; Program development; Z

Indexed keywords

DATA STRUCTURES; OBJECT ORIENTED PROGRAMMING; SEMANTICS; SOFTWARE ENGINEERING;

CONCURRENCY; CSP; PROGRAM DEVELOPMENT; Z;

COMPUTER PROGRAMMING LANGUAGES;

EID: 0842268048     PISSN: 09345043     EISSN: None     Source Type: Journal    
DOI: 10.1007/s00165-003-0006-5     Document Type: Conference Paper

References (29)

1. [BaS90] Back, R. J. R. and Sere, K.: Stepwise refinement of parallel algorithms. Science of Computer Programming, 13:133-180, 1990.
2. [But96] Butler, M.: Stepwise refinement of communicating systems. Science of Computer Programming, 27:139-173, 1996.
3. [CSW02] Cavalcanti, A. L. C., Sampaio, A. C. A. and Woodcock, J. C. P.: Refinement of actions in Circus. In: Proceedings of REFINE'2002, Electronic Notes in Theoretical Computer Science, 2002. Invited paper.
4. [CaW99] Cavalcanti, A. L. C. and Woodcock, J. C. P.: ZRC-A Refinement Calculus for Z. Formal Aspects of Computing, 10(3):267-289, 1999.
5. [CaW02] Cavalcanti, A. L. C. and Woodcock, J. C. P.: A weakest precondition semantics for Circus. In: Proceedings of the Communicating Processing Architectures 2002. IOS Press, 2002.
6. [Fis98] Fischer, C.: How to Combine Z with a Process Algebra. In: J. Bowen and A. Fett and M. Hinchey, editors, ZUM'98: The Z Formal Specification Notation. Springer-Verlag, 1998.
7. [Fis00] Fischer, C.: Combination and Implementation of Processes and Data: from CSP-OZ to Java. PhD thesis, Fachbereich Informatik Universitat Oldenburg, 2000.
8. [Fow99] Fowler, M.: Refactoring. Addison-Wesley, 1999.
9. [GOM93] Gordon, M. J. C. and Melham, T. F.: Introduction to HOL: A Theorem Proving Environment for Higher Order Logic. Cambridge University Press, 1993.
10. [Hoa72] Hoare, C. A. R.: Proof of Correctness of Data Representations. Acta Informatica, 1:271-281, 1972.
11. [Hoa85] Hoare, C. A. R.: Communicating Sequential Processes. Prentice-Hall International, 1985.
12. [HoH98] Hoare, C. A. R. and Jifeng, H.: Unifying Theories of Programming. Prentice-Hall, 1998.
13. [HeJ89] Jifeng, H.: Process simulation and refinement. Formal Aspects of Computing, 1(3):229-241 1989.
14. [HHS86] Jifeng, H., Hoare, C. A. R. and Sanders, J. W.: Data refinement refined. In: Goos G and Hartmants H. editors, ESOP'86 European Symposium on Programming, volume 213 of Lecture Notes in Computer Science, 187-196 1986.
15. [Jon86] Jones, C. B.: Systematic Software Development Using VDM. Pentice-Hall International, 1986.
16. [Jos88] Josephs, M. B.: A state-based approach to communicating processes. Distributed Computing, 3:9-18, 1988.
17. [Mil89] Milner, R.: Communication and Concurrency. Series in Computer Science. Prentice Hall International, 1989.
18. [Mor94] Morgan, C. C.: Programming from Specifications, 2nd edition. Prentice-Hall, 1994
19. [MoG90] Morgan, C. C. and Gardiner, P. H. B.: Data Refinement by Calculation. Acta Informatica, 27(6):481-503, 1990.
20. [Old91] Olderog, E.: Towards a design calculus for communicating programs. In: Baeten J. C. M. and Groote J. F. editors, CONCUR'91: 2nd International Conference on Concurrency Theory, pages 61-77. Springer-Verlag, 1991.
21. [Ros98] Roscoe, A. W.: The Theory and Practice of Concurrency. Series in Computer Science. Prentice-Hall, 1998.
22. [SWC02] Sampaio, A. C. A., Woodcock, J. C. P. and Cavalcanti, A. L. C.: Refinement in Circus. In: L. Eriksson and P. A. Lindsay, editors, FME 2002: Formal Methods: Getting IT Right, volume 2391 of Lecture Notes in Computer Science pages 451-470. Springer-Verlag, 2002.
23. [SmD01] Smith, G. and Derrick, J.: Specification, refinement and verification of concurrent systems: An integration of Object-Z and CSP. Formal Methods in Systems Design, 18:249-284, May 2001.
24. [Spi92] Spivey, J. M.: The Z Notation: A Reference Manual. 2nd edition. Prentice-Hall, 1992.
25. [Toe92] Toetenel, W. J.: VDM + CCS + Time = MOSCA. In: Proceedings of the IFIP/IFAC Workshop on Real-time Programming, 1992.
26. [WoC01] Woodcock, J. C. P. and Cavalcanti, A. L. C.: Circus: a concurrent refinement language. Technical Report, Oxford University Computing Laboratory, 2001.
27. [WoC02] Woodcock, J. C. P., and Cavalcanti, A. L. C.: The Semantics of Circus. In: Bert D. Bowen J. P. Henson M. C. and Robinson K. editors, ZB 2002: Formal Specification and Development in Z and B, volume 2272 of Lecture Notes in Computer Science, pages 184-203, Springer-Verlag, 2002.
28. [WoD96] Woodcock, J. C. P. and Davies, J.: Using Z: Specification, Refinement, and Proof. Prentice-Hall, 1996.
29. [WoM90] Woodcock, J. C. P. and Morgan, C. C.: Refinement of state-based concurrent systems. In: Bjørner D. Hoare C. A. R. and Langmaack H. editors, VDM'90: VDM and Z: Formal Methods in Software Development, volume 428 of Lecture Notes in Computer Science, 340-351. Springer, 1990.