Nothing Special   »   [go: up one dir, main page]

Skip to main content

‘The Tinker’ for Rodin

  • Conference paper
  • First Online:
Abstract State Machines, Alloy, B, TLA, VDM, and Z (ABZ 2016)

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

  • 819 Accesses

Abstract

PSGraph [3] is a graphical proof strategy language, which uses the formalisation of labelled hierarchical graphs to provide support for the development and maintenance of large and complex proof tactics. PSGraph has been implemented as the Tinker system, which previously supported the Isabelle and ProofPower theorem provers [4]. In this paper we present a Rodin version of Tinker, which allows Rodin users to encode, analyse and debug their proof strategies in Tinker.

This work has been supported by EPSRC grants EP/J001058, EP/K503915, EP/M018407 and EP/N014758.

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

Access this chapter

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

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

Similar content being viewed by others

Notes

  1. 1.

    Composition of two graphs is formalised as a categorical push-out [1].

References

  1. Dixon, L., Kissinger, A.: Open graphs and monoidal theories. CoRR, abs/1011.4114 (2010)

    Google Scholar 

  2. Gordon, M.J.: Edinburgh LCF: A Mechanised Logic of Computation. LNCS. Springer, Heidelberg (1979)

    Book  MATH  Google Scholar 

  3. Grov, G., Kissinger, A., Lin, Y.: A graphical language for proof strategies. In: McMillan, K., Middeldorp, A., Voronkov, A. (eds.) LPAR-19 2013. LNCS, vol. 8312, pp. 324–339. Springer, Heidelberg (2013)

    Chapter  Google Scholar 

  4. Grov, G., Kissinger, A., Lin, Y.: Tinker, tailor, solver, proof. In: UITP, ENTCS, vol. 167, pp. 23–34. Open Publishing Association (2014)

    Google Scholar 

  5. Lin, Y.: The Use of Rippling to Automate Event-B Invariant Preservation Proofs. Ph.D. thesis (2015)

    Google Scholar 

  6. Lin, Y., O’Halloran C. Grov, G.P.G.: A super industrial application of PSGraph. In: ABZ (2016). (to appear)

    Google Scholar 

  7. Lin, Y., Le Bras, P., Grov, G.: Developing & debugging proof strategies by tinkering. In: TACAS (2016). to appear

    Google Scholar 

  8. Su, W., Abrial, J.-R.: Aircraft landing gear system: approaches with event-b to the modeling of an industrial system. In: Boniol, F., Wiels, V., Ait Ameur, Y., Schewe, K.-D. (eds.) ABZ 2014. CCIS, vol. 433, pp. 19–35. Springer, Heidelberg (2014)

    Chapter  Google Scholar 

  9. Liang, Y., Lin, Y., Grov, G.: Tinker - ABZ 16 paper ressources. http://ggrov.github.io/tinker/abz2016/. Accessed 3 Feb 2016

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Yuhui Lin .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2016 Springer International Publishing Switzerland

About this paper

Cite this paper

Liang, Y., Lin, Y., Grov, G. (2016). ‘The Tinker’ for Rodin. In: Butler, M., Schewe, KD., Mashkoor, A., Biro, M. (eds) Abstract State Machines, Alloy, B, TLA, VDM, and Z. ABZ 2016. Lecture Notes in Computer Science(), vol 9675. Springer, Cham. https://doi.org/10.1007/978-3-319-33600-8_19

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-33600-8_19

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-33599-5

  • Online ISBN: 978-3-319-33600-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics