Abstract
This paper introduces the concept of controlled automation as a balanced medium between high-level automated reasoning and low-level primitive tactics in HOL. We created a new tactic that subsumes many existing low-level tactics for logical operations and three new tactics that simplify common uses of term rewriting: definition expansion, simplification, and equational rewriting. To implement the tactics, we extended HOL with a facility to label assumptions and operate uniformly on both goals and assumptions. We select automatically and predictably which low-level tactic to apply by examining the structure of the selected assumption or goal. A simple and uniform set of hints enable users to provide the minimal information needed to guide the tactics. We performed two case studies and achieved a 60% reduction in the number of unique tactics used.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Aagaard, M.D., Day, N.A., Lou, M.: Relating multi-step and single-step microprocessor correctness statements. In: Aagaard, M.D., O’Leary, J.W. (eds.) FMCAD 2002. LNCS, vol. 2517, pp. 123–141. Springer, Heidelberg (2002)
Black, P.E., Windley, P.J.: Automatically synthesized term denotation predicates: A proof aid. In: Theorem Proving in Higher Order Logics, pp. 46–57. Springer, Heidelberg (1995)
Delahaye, D.: Free-style theorem proving. In: Carreño, V.A., Muñoz, C.A., Tahar, S. (eds.) TPHOLs 2002. LNCS, vol. 2410, pp. 164–181. Springer, Heidelberg (2002)
Gordon, M.J.C., Melham, T.F. (eds.): Introduction to HOL: a theorem proving environment for higher order logic. Cambridge University Press, New York (1993)
Harrison, J.: A Mizar mode for HOL. In: von Wright, J., Harrison, J., Grundy, J. (eds.) TPHOLs 1996. LNCS, vol. 1125, pp. 203–220. Springer, Heidelberg (1996)
Harrison, J.: The HOL light system reference (2006), http://www.cl.cam.ac.uk/~jrh13/hol-light/reference_220.pdf
Harrison, J.R.: Proof style. In: BRA Types workshop, pp. 154–172. Springer, Heidelberg (1996)
Hickey, J.J.: The MetaPRL Logical Programming Environment. PhD thesis, Cornell (2001)
Martin, A.P., Gardiner, P.H.B., Woodcock, J.C.P.: A tactical calculus. Formal Aspects of Computing 8(4), 479–489 (1996)
Rudnicki, P., Trybulec, A.: On equivalents of well-foundedness. Jour. of Automated Reasoning 23(3-4), 197–234 (1999)
Toyn, I.: A tactic language for reasoning about z specifications. In: 3rd BCS-FACS Northern Formal Methods Workshop (September 1998)
Trybulec, A., Blair, H.A.: Computer assisted reasoning with MIZAR. In: Int’l Joint Conf. on Artificial Intelligence, pp. 26–28. Morgan Kaufmann, San Francisco (1985)
Wenzel, M.: Isar – A generic interpretative approach to readable formal proof documents. In: Bertot, Y., Dowek, G., Hirschowitz, A., Paulin, C., Théry, L. (eds.) TPHOLs 1999. LNCS, vol. 1690, pp. 167–183. Springer, Heidelberg (1999)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kang, E., Aagaard, M.D. (2007). Improving the Usability of HOL Through Controlled Automation Tactics. In: Schneider, K., Brandt, J. (eds) Theorem Proving in Higher Order Logics. TPHOLs 2007. Lecture Notes in Computer Science, vol 4732. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-74591-4_13
Download citation
DOI: https://doi.org/10.1007/978-3-540-74591-4_13
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-74590-7
Online ISBN: 978-3-540-74591-4
eBook Packages: Computer ScienceComputer Science (R0)