Skip to main content
SpringerLink
Log in
SpringerLink
Log in

Encoding Circus Programs in ProofPowerZ

  • Conference paper
Unifying Theories of Programming (UTP 2008)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5713))

Included in the following conference series:

Abstract

Circus combines elements from sequential and reactive programming, and is especially suited for the development and verification of state-rich, reactive systems. In this paper we illustrate, by example, how a mechanisation of the UTP, and of a Circus theory, more specifically, can be used to encode particular Circus specifications. This complements previous work which focused on using the mechanised UTP semantics to prove general laws. We propose a number of extensions to an existing mechanisation by Oliveira to deal with the problems of type constraints and theory instantiation. We also show what the strategies and practical solutions are for proving refinement conjectures.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Adams, M., Clayton, P.: ClawZ: Cost-Effective Formal Verification of Control Systems. In: Lau, K.-K., Banach, R. (eds.) ICFEM 2005. LNCS, vol. 3785, pp. 465–479. Springer, Heidelberg (2005)

    Chapter  Google Scholar 

  2. Camilleri, A.: A Higher Order Logic Mechanisation of the CSP Failure-Divergence Semantics. Technical Report HPL-90-194, HP Laboratories (September 1990)

    Google Scholar 

  3. Camilleri, A.: Mechanizing csp trace theory in higher order logic. IEEE Transactions on Software Engeneering 16(9), 993–1004 (1990)

    Article  Google Scholar 

  4. Cavalcanti, A., Sampaio, A., Woodcock, J.: A Refinement Strategy for Circus. Formal Aspects of Computing 15(2-3), 146–181 (2003)

    Article  MATH  Google Scholar 

  5. Dutertre, B., Schneider, S.: Using a PVS embedding of CSP to verify authentication protocols. In: Gunter, E.L., Felty, A.P. (eds.) TPHOLs 1997. LNCS, vol. 1275, pp. 121–136. Springer, Heidelberg (1997)

    Chapter  Google Scholar 

  6. Freitas, L., Cavalcanti, A., Woodcock, J.: Taking Our Own Medicine: Applying the Refinement Calculus to State-Rich Refinement Model Checking. In: Liu, Z., He, J. (eds.) ICFEM 2006. LNCS, vol. 4260, pp. 697–716. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  7. Freitas, L., Woodcock, J., Cavalcanti, A.: An Architecture for Circus Tools. In: SBMF 2007: Brazilian Symp. on Formal Methods, August 2007, pp. 6–21 (2007)

    Google Scholar 

  8. Groves, L., Nickson, R., Utting, M.: A Tactic Driven Refinement Tool. In: 5th Refinement Workshop, January 1992, pp. 272–297. Springer, Heidelberg (1992)

    Google Scholar 

  9. Hoare, C.A.R., Jifeng, H.: Unifying Theories of Programming. Prentice Hall Series in Computer Science. Prentice Hall, Englewood Cliffs (1998)

    Google Scholar 

  10. Morgan, C.: Programming from Specifications. Prentice-Hall International Series In Computer Science. Prentice Hall, Englewood Cliffs (1998)

    Google Scholar 

  11. Nuka, G., Woodcock, J.: Mechanising the Alphabetised Relational Calculus. Electronic Notes in Theoretical Computer Science 95, 209–225 (2004)

    Article  Google Scholar 

  12. Nuka, G., Woodcock, J.: Mechanising a Unifying Theory. In: Dunne, S., Stoddart, B. (eds.) UTP 2006. LNCS, vol. 4010, pp. 217–235. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  13. Oliveira, M.: Formal Derivation of State-Rich Reactive Programs using Circus. PhD thesis, Department of Computer Science, University of York, UK (2005)

    Google Scholar 

  14. Oliveira, M., Cavalcanti, A.: ArcAngelC: a Refinement Tactic Language for Circus. Electronic Notes in Theoretical Computer Science 214, 203–229 (2008)

    Article  Google Scholar 

  15. Oliveira, M., Cavalcanti, A., Woodcock, J.: Unifying Theories in ProofPower-Z. In: Dunne, S., Stoddart, B. (eds.) UTP 2006. LNCS, vol. 4010, pp. 123–140. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  16. Oliveira, M., Cavalcanti, A., Woodcock, J.: A UTP semantics for Circus. Formal Aspects of Computing (2007) (Online First)

    Google Scholar 

  17. Xavier, M., Cavalcanti, A., Sampaio, A.: Type Checking Circus Specifications. In: SBMF 2006: Brazilian Symposium on Formal Methods, pp. 105–120 (2006)

    Google Scholar 

  18. Zeyda, F., Cavalcanti, A.: Mechanical Reasoning about Families of UTP Theories. In: SBMF 2008: Brazilian Symp. on Formal Methods, pp. 145–160 (2008)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, University of York, U.K.

    Frank Zeyda & Ana Cavalcanti

Authors
  1. Frank Zeyda
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Ana Cavalcanti
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. O’Reilly Institute, School of Computer Science and Statistics, University of Dublin, Trinity College, Dublin 2, Ireland

    Andrew Butterfield

Rights and permissions

Reprints and permissions

Copyright information

© 2010 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Zeyda, F., Cavalcanti, A. (2010). Encoding Circus Programs in ProofPowerZ . In: Butterfield, A. (eds) Unifying Theories of Programming. UTP 2008. Lecture Notes in Computer Science, vol 5713. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-14521-6_13

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-14521-6_13

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-14520-9

  • Online ISBN: 978-3-642-14521-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation