Skip to main content
SpringerLink
Log in

Refactoring Proofs with Tactician

  • Conference paper
  • First Online:
Software Engineering and Formal Methods (SEFM 2015)

Part of the book series: Lecture Notes in Computer Science ((LNPSE,volume 9509))

Included in the following conference series:

Abstract

Tactician is a tool for refactoring tactic proof scripts for the HOL Light theorem prover. Its core operations are packaging up a series of tactic steps into a compact proof with tactical connectives, and the reverse operation of unravelling compact proofs into interactive steps. This can be useful for novices learning from legacy proof scripts, as well as for experienced users maintaining their proofs. In this paper, we give an overview of Tactician’s core capabilities and provide insight into how it is implemented.

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

Notes

  1. 1.

    This is similar to a trick used in HOL Light to capture the theorem values in the ML session, implemented in HOL Light’s update_database.ml.

References

  1. Adams, M., Aspinall, D.: Recording and refactoring HOL light tactic proofs. In: Workshop on Automated Theory eXploration, in Association with the 6th International Conference on Automated Reasoning (2012)

    Google Scholar 

  2. Arthan, R., Jones, R.: Z in HOL in ProofPower. In Issue 2005-1 of the British Computer Society Specialist Group Newsletter on Formal Aspects of Computing Science (2005)

    Google Scholar 

  3. Aspinall, D., Denney, E., Lüth, C.: Tactics for hierarchical proof. Math. Comput. Sci. 3(3), 309–330 (2010). Springer

    Article  MATH  MathSciNet  Google Scholar 

  4. Bertot, Y., Casteran, P.: Interactive Theorem Proving and Program Development: Coq’Art: The Calculus of Inductive Constructions. Texts in Theoretical Computer Science an EATCS Series. Springer, Heidelberg (2004)

    Book  Google Scholar 

  5. Hales, T., Adams, M., Bauer, G., Dat, T.D., Harrison, J., Truong, H.L., Kaliszyk, C., Magron, V., McLaughlin, S., Thang, N.T., Truong, N.Q., Nipkow, T., Obua, S., Pleso, J., Rute, J., Solovyev, A., An, T.H., Trung, T.N., Diep, T.T., Urban, J., Ky, V.K., Zumkeller, R.: A Formal Proof of the Kepler Conjecture. arXiv:1501.02155v1 [math.MG]. arxiv.org (2015)

  6. Harrison, J.: HOL light: an overview. In: Berghofer, S., Nipkow, T., Urban, C., Wenzel, M. (eds.) TPHOLs 2009. LNCS, vol. 5674, pp. 60–66. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  7. Klein, G., Elphinstone, K., Heiser, G., Andronick, J., Cock, D., Derrin, P., Elkaduwe, D., EngelHardt, K., Kolanski, R., Norrish, M., Sewell, T., Tuch, H., Winwood, S.: seL4: formal verification of an OS Kernel. In: Proceedings of the ACM SIGOPS 22nd Symposium on Operating Systems Principles, pp. 207–220. ACM (2009)

    Google Scholar 

  8. Nipkow, T., Paulson, L., Wenzel, M.: Isabelle/HOL: A Proof Assistant for Higher-Order Logic. LNCS, vol. 2283. Springer, Heidelberg (2002)

    Google Scholar 

  9. Paulson, L.: Logic and Computation: Interactive proof with Cambridge LCF. Cambridge University Press, Cambridge (1987)

    Book  MATH  Google Scholar 

  10. Slind, K., Norrish, M.: A brief overview of HOL4. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 28–32. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  11. Wenzel, M., Paulson, L.C., Nipkow, T.: The Isabelle framework. In: Mohamed, O.A., Muñoz, C., Tahar, S. (eds.) TPHOLs 2008. LNCS, vol. 5170, pp. 33–38. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  12. Tactician homepage: http://www.proof-technologies.com/tactician/

Download references

Author information

Authors and Affiliations

  1. Proof Technologies Ltd., Worcester, UK

    Mark Adams

  2. Radboud University, Nijmegen, The Netherlands

    Mark Adams

Authors
  1. Mark Adams
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mark Adams .

Editor information

Editors and Affiliations

  1. Interdisciplinary Centre for ICT Se, University of Luxembourg (UL)., Luxembourg

    Domenico Bianculli

  2. University of York, York, United Kingdom

    Radu Calinescu

  3. LS Software Engineering, RWTH Aachen Universität, Aachen, Nordrhein-Westfalen, Germany

    Bernhard Rumpe

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Adams, M. (2015). Refactoring Proofs with Tactician. In: Bianculli, D., Calinescu, R., Rumpe, B. (eds) Software Engineering and Formal Methods. SEFM 2015. Lecture Notes in Computer Science(), vol 9509. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-49224-6_6

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-49224-6_6

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-49223-9

  • Online ISBN: 978-3-662-49224-6

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation