Encoding Circus Programs in ProofPowerZ

  • Frank Zeyda
  • Ana Cavalcanti
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5713)

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.

Keywords

UTP semantics theorem proving refinement 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 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)CrossRefGoogle Scholar
  2. 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. 3.
    Camilleri, A.: Mechanizing csp trace theory in higher order logic. IEEE Transactions on Software Engeneering 16(9), 993–1004 (1990)CrossRefGoogle Scholar
  4. 4.
    Cavalcanti, A., Sampaio, A., Woodcock, J.: A Refinement Strategy for Circus. Formal Aspects of Computing 15(2-3), 146–181 (2003)MATHCrossRefGoogle Scholar
  5. 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)CrossRefGoogle Scholar
  6. 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)CrossRefGoogle Scholar
  7. 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. 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. 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. 10.
    Morgan, C.: Programming from Specifications. Prentice-Hall International Series In Computer Science. Prentice Hall, Englewood Cliffs (1998)Google Scholar
  11. 11.
    Nuka, G., Woodcock, J.: Mechanising the Alphabetised Relational Calculus. Electronic Notes in Theoretical Computer Science 95, 209–225 (2004)CrossRefGoogle Scholar
  12. 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)CrossRefGoogle Scholar
  13. 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. 14.
    Oliveira, M., Cavalcanti, A.: ArcAngelC: a Refinement Tactic Language for Circus. Electronic Notes in Theoretical Computer Science 214, 203–229 (2008)CrossRefGoogle Scholar
  15. 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)CrossRefGoogle Scholar
  16. 16.
    Oliveira, M., Cavalcanti, A., Woodcock, J.: A UTP semantics for Circus. Formal Aspects of Computing (2007) (Online First)Google Scholar
  17. 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. 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

Copyright information

© Springer-Verlag Berlin Heidelberg 2010

Authors and Affiliations

  • Frank Zeyda
    • 1
  • Ana Cavalcanti
    • 1
  1. 1.Department of Computer ScienceUniversity of YorkU.K.

Personalised recommendations