Automated Engineering of Relational and Algebraic Methods in Isabelle/HOL
We present a new integration of relational and algebraic methods in the Isabelle/HOL theorem proving environment. It consists of a fine grained hierarchy of algebraic structures based on Isabelle’s type classes and locales, and a repository of more than 800 facts obtained by automated theorem proving. We demonstrate further benefits of Isabelle for hypothesis learning, duality reasoning, theorem instantiation, and reasoning across models and theories. Our work forms the basis for a reference repository and a program development environment based on algebraic methods. It can also be used by mathematicians for exploring and integrating new variants.
Unable to display preview. Download preview PDF.
- 18.Hurd, J.: System description: The Metis proof tactic. In: Benzmueller, C., Harrison, J., Schuermann, C. (eds.) ESHOL 2005, pp. 103–104. arXiv.org (2005)Google Scholar
- 19.Isabelle website, http://isabelle.in.tum.de/ (accessed February 20, 2011)
- 24.Krauss, A., Nipkow, T.: Proof pearl: Regular expression equivalence and relation algebra. Journal of Automated Reasoning (to appear, 2011)Google Scholar
- 33.Struth, G.: et al.: Isabelle algebraic methods repository (2011), http://www.dcs.shef.ac.uk/~georg/isa (accessed February 20, 2011)
- 34.Sutcliffe, G., Suttner, C.: The TPTP problem library for automated theorem proving, http://www.tptp.org (accessed February 20, 2011)
- 36.Wenzel, M.: Isabelle/Isar— a versatile environment for human-readable formal proof documents. Ph.D. thesis, Institut für Informatik, Technische Universität München, Germany (2002)Google Scholar