Skip to main content
SpringerLink
Log in

A Stepwise Approach to Linking Theories

  • Conference paper
  • First Online:
Unifying Theories of Programming (UTP 2016)

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

Included in the following conference series:

Abstract

Formal modelling of complex systems requires catering for a variety of aspects. The Unifying Theories of Programming (UTP) distinguishes itself as a semantic framework that promotes unification of results across different modelling paradigms via linking functions. The naive composition of theories, however, may yield unexpected or undesirable semantic models. Here, we propose a stepwise approach to linking theories where we deal separately with the definition of the relation between the variables in the different theories and the identification of healthiness conditions. We explore this approach by deriving healthiness conditions for  via calculation, based on the healthiness conditions of CSP and a small set of principles underlying the timed model.

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 EPUB and 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

References

  1. Hoare, C.A.R., He, J.: Unifying Theories of Programming. Prentice Hall International Series in Computer Science. Prentice Hall, Upper Saddle River (1998)

    MATH  Google Scholar 

  2. Roscoe, A.W.: Understanding Concurrent Systems. Springer, London (2010)

    Book  MATH  Google Scholar 

  3. Oliveira, M., Cavalcanti, A., Woodcock, J.: A UTP semantics for Circus. Formal Aspects Comput. 21(1), 3–32 (2007)

    MATH  Google Scholar 

  4. Sherif, A., Cavalcanti, A.L.C., He, J., Sampaio, A.C.A.: A process algebraic framework for specification and validation of real-time systems. Formal Aspects Comput. 22(2), 153–191 (2010)

    Article  MATH  Google Scholar 

  5. Wei, K., Woodcock, J., Cavalcanti, A.: Circus Time with reactive designs. In: Wolff, B., Gaudel, M.-C., Feliachi, A. (eds.) UTP 2012. LNCS, vol. 7681, pp. 68–87. Springer, Berlin (2013). doi:10.1007/978-3-642-35705-3_3

    Chapter  Google Scholar 

  6. Cavalcanti, A., Sampaio, A., Woodcock, J.: A Refinement Strategy for Circus. Formal Aspects Comput. 15, 146–181 (2003)

    Article  MATH  Google Scholar 

  7. Harwood, W., Cavalcanti, A., Woodcock, J.: A theory of pointers for the UTP. In: Fitzgerald, J.S., Haxthausen, A.E., Yenigun, H. (eds.) ICTAC 2008. LNCS, vol. 5160, pp. 141–155. Springer, Heidelberg (2008). doi:10.1007/978-3-540-85762-4_10

    Chapter  Google Scholar 

  8. Woodcock, J., Davies, J.: Using Z: Specification, Refinement, and Proof. Prentice Hall, Upper Saddle River (1996)

    MATH  Google Scholar 

  9. Schneider, S.: Concurrent and Real-Time Systems: the CSP Approach. Worldwide Series in Computer Science. Wiley, New York (2000)

    Google Scholar 

  10. Wei, K., Woodcock, J., Cavalcanti, A.: New Circus Time. Technical report, University of York (2012). https://www.cs.york.ac.uk/circus/publications/techreports/reports/Circus%20Time.pdf

  11. Butterfield, A., Gancarski, P., Woodcock, J.: State visibility and communication in unifying theories of programming. In: Third IEEE International Symposium on Theoretical Aspects of Software Engineering, TASE 2009, pp. 47–54, July 2009

    Google Scholar 

  12. Canham, S., Woodcock, J.: Three approaches to timed external choice in UTP. In: Naumann, D. (ed.) UTP 2014. LNCS, vol. 8963, pp. 1–20. Springer, Heidelberg (2015). doi:10.1007/978-3-319-14806-9_1

    Google Scholar 

  13. Morgan, C.: Programming from Specifications. Prentice Hall, Upper Saddle River (1994)

    MATH  Google Scholar 

  14. Woodcock, J., Cavalcanti, A.: A tutorial introduction to designs in unifying theories of programming. In: Boiten, E.A., Derrick, J., Smith, G. (eds.) IFM 2004. LNCS, vol. 2999, pp. 40–66. Springer, Berlin (2004). doi:10.1007/978-3-540-24756-2_4

    Chapter  Google Scholar 

  15. Cavalcanti, A., Woodcock, J.: A tutorial introduction to CSP in unifying theories of programming. In: Cavalcanti, A., Sampaio, A., Woodcock, J. (eds.) PSSE 2004. LNCS, vol. 3167, pp. 220–268. Springer, Berlin (2006). doi:10.1007/11889229_6

    Chapter  Google Scholar 

  16. Spivey, J.M.: The Z Notation: A Reference Manual. Prentice Hall, Upper Saddle River (1989)

    MATH  Google Scholar 

  17. Ribeiro, P.: Super-Theories. Technical report, University of York (2016). https://www-users.cs.york.ac.uk/pfr/reports/super-theories.pdf

  18. Foster, S., Zeyda, F., Woodcock, J.: Isabelle/UTP: A Mechanised Theory Engineering Framework. In: Naumann, D. (ed.) UTP 2014. LNCS, vol. 8963, pp. 21–41. Springer, Heidelberg (2015). doi:10.1007/978-3-319-14806-9_2

    Google Scholar 

  19. Banks, M.J., Jacob, J.L.: On integrating confidentiality and functionality in a formal method. Formal Aspects Comput. 26(5), 963–992 (2013)

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgments

We would like to thank Simon Foster for his support regarding Isabelle/UTP. This work is funded by EPSRC grants EP/H017461/1 and EP/M025756/1.

Author information

Authors and Affiliations

  1. Department of Computer Science, University of York, York, UK

    Pedro Ribeiro, Ana Cavalcanti & Jim Woodcock

Authors
  1. Pedro Ribeiro
    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

  3. Jim Woodcock
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Pedro Ribeiro .

Editor information

Editors and Affiliations

  1. London South Bank University, London, United Kingdom

    Jonathan P. Bowen

  2. East China Normal University, Shanghai, China

    Huibiao Zhu

Rights and permissions

Reprints and permissions

Copyright information

© 2017 Springer International Publishing AG

About this paper

Cite this paper

Ribeiro, P., Cavalcanti, A., Woodcock, J. (2017). A Stepwise Approach to Linking Theories. In: Bowen, J., Zhu, H. (eds) Unifying Theories of Programming. UTP 2016. Lecture Notes in Computer Science(), vol 10134. Springer, Cham. https://doi.org/10.1007/978-3-319-52228-9_7

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-52228-9_7

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-52227-2

  • Online ISBN: 978-3-319-52228-9

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation