Abstract
Circus is a combination of Z, CSP, and the refinement calculus, and is based on Hoare & He’s Unifying Theories of Programming. A model checker is being constructed for the language to conduct refinement checking in the style of FDR, but supported by theorem proving for reasoning about the complex states and data types that arise from the use of Z. FDR deals with bounded labelled transition systems (LTSs), but the Circus model checker manipulates LTSs with possibly infinite inscriptions on arcs and in nodes, and so, in general, the success or failure of a refinement check depends on interaction with a theorem prover. An LTS is generated from a source text using an operational interpretation of Circus; we present a Structured Operational Semantics for Circus, including both its process-algebraic and state-rich features.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Cavalcanti, A.L.C., Sampaio, A.C.A., Woodcock, J.C.P.: Refinement of actions in Circus. In: REFINE 2002. Electronic Notes in Theor. Comp. Sci., vol. 70(3) (2002)
Cavalcanti, A.L.C., Sampaio, A.C.A., Woodcock, J.C.P.: A refinement strategy for Circus. Formal Aspects of Computing 15(2–3), 146–181 (2003)
Cavalcanti, A.L.C., Woodcock, J.C.P.: Predicate transformers in the semantics of Circus. IEE Proceedings Software 150(2), 85–94 (2003)
Fischer, C.: Combining CSP and Z.Technical Report. Univ. Oldenburg (1996)
Goldsmith, M.: FDR2 User’s Manual version 2.67. FSEL (May 2000)
Jifeng, H., Liu, Z., Li, X.: A Relational Model for Object-Oriented Programming. Tech. Rep. 231. UNU/IIST, P. O. Box 3058, Macau (May 2001)
Jifeng, H., Liu, Z., Li, X.: Towards a Refinement Calculus for Object Systems. In: Procs ICCI 2002, pp. 69–77. IEEE Computer Society Press, Los Alamitos (2002)
Jifeng, H., Liu, Z., Li, X.: Modelling Object-oriented Programming with Reference Type and Dynamic Binding. Tech. Rep. 280. UNU/IIST (2003)
Hoare, C.A.R.: Communicating Sequential Processes. Prentice-Hall, Englewood Cliffs (1985)
Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall, Englewood Cliffs (1998)
Information Technology — Z Formal Specification Notation — Syntax, Type System and Semantics. ISO/IEC 13568 (2002)
Lemma-One. ProofPower Tutorial (2003)
Jeremy, M., Martin, R., Huddart, Y.: Parallel Algorithms for Deadlock and Livelock Analysis of Concurrent Systems. In: Commun. Proc. Archs. IOS Press, Amsterdam (2000)
Meisels, I., Saaltink, M.: Z/Eves 1.5 Reference Manual. Technical Report TR-97-5493-03d. ORA Canada (September 1997)
Nuka, G., Woodcock, J.: Mechanising the alphabetised relational calculus. In: WMF2003. Electronic Notes in Theoretical Computer Science, vol. 95 (2004)
Oliveira, M., Cavalcanti, A., Woodcock, J.: Unifying theories in ProofPowerZ. Draft. University of York (January 2005)
Plotkin, G.D.: A Structural approach to Operational Semantics. Journal of Logic and Algebraic Programming 60/61, 19–140 (2004)
ProBE User’s Manual version 1.28. Formal Systems (Europe) Ltd. (May 2000)
Roscoe, A.W.: Model Checking CSP. In: [20], Ch. 21, pp. 353–378 (1994)
Roscoe, A.W.: A Classsical Mind: Essays for C.A.R. Hoare. Prentice Hall, Englewood Cliffs (1994)
Roscoe, A.W.: Theory and Practice of Concurrency. Prentice Hall, Englewood Cliffs (1997)
Saaltink, M.: Z/Eves 2.0 User’s Guide. Technical Report TR-99-5493-06a. ORA Canada (1999)
Sampaio, A.C.A., Woodcock, J.C.P., Cavalcanti, A.L.C.: Refinement in Circus. In: Eriksson, L.-H., Lindsay, P.A. (eds.) FME 2002. LNCS, vol. 2391, pp. 451–470. Springer, Heidelberg (2002)
Scattergood, B.: The Semantics and Implementation of Machine Readable CSP. PhD thesis. Oxford University (1998)
Schneider, S.: Concurrent and Real-Time Systems: The CSP Approach. Wiley, Chichester (2000)
Schneider, S., Treharne, H.: Communicating B Machines. In: Bert, D., et al. (eds.) B 2002 and ZB 2002. LNCS, vol. 2272, pp. 415–435. Springer, Heidelberg (2002)
Sherif, A., Jifeng, H.: Towards a time model for circus. In: George, C.W., Miao, H. (eds.) ICFEM 2002. LNCS, vol. 2495, pp. 613–624. Springer, Heidelberg (2002)
Tang, X., Woodcock, J.: Towards mobile processes in unifying theories. In: SEFM 2004. IEEE Computer Society, Los Alamitos (2004)
Tang, X., Woodcock, J.: Travelling processes. In: Kozen, D. (ed.) MPC 2004. LNCS, vol. 3125, pp. 381–399. Springer, Heidelberg (2004)
Woodcock, J.C.P.: Unifying Theories of Parallel Programming. In: Logic and Algebra for Engineering Software. IOS Press, Amsterdam (2002)
Woodcock, J., Cavalcanti, A.: A Concurrent Language for Refinement. In: 5th Irish Workshop on Formal Methods (2001)
Woodcock, J., Cavalcanti, A.: The semantics of circus. In: Bert, D., et al. (eds.) B 2002 and ZB 2002. LNCS, vol. 2272, pp. 184–203. Springer, Heidelberg (2002)
Woodcock, J., Davies, J.: Using Z: Specification, Refinement, and Proof. Prentice Hall, Englewood Cliffs (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2005 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Woodcock, J., Cavalcanti, A., Freitas, L. (2005). Operational Semantics for Model Checking Circus . In: Fitzgerald, J., Hayes, I.J., Tarlecki, A. (eds) FM 2005: Formal Methods. FM 2005. Lecture Notes in Computer Science, vol 3582. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11526841_17
Download citation
DOI: https://doi.org/10.1007/11526841_17
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-27882-5
Online ISBN: 978-3-540-31714-2
eBook Packages: Computer ScienceComputer Science (R0)