Improving the usability of HOL through controlled automation tactics

Authors:
Eunsuk Kang;Mark D. Aagaard
Affiliations:
Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada;Electrical and Computer Engineering, University of Waterloo, Waterloo, ON, Canada
Venue:
TPHOLs'07 Proceedings of the 20th international conference on Theorem proving in higher order logics
Year:
2007

Citing 10
Cited 0

Introduction to HOL: a theorem proving environment for higher order logic

Introduction to HOL: a theorem proving environment for higher order logic
On Equivalents of Well-Foundedness

Journal of Automated Reasoning
Relating Multi-step and Single-Step Microprocessor Correctness Statements

FMCAD '02 Proceedings of the 4th International Conference on Formal Methods in Computer-Aided Design
Autotically Synthesized Term Denotation Predicates: A Proof Aid

Proceedings of the 8th International Workshop on Higher Order Logic Theorem Proving and Its Applications
A Mizar Mode for HOL

TPHOLs '96 Proceedings of the 9th International Conference on Theorem Proving in Higher Order Logics
Free-Style Theorem Proving

TPHOLs '02 Proceedings of the 15th International Conference on Theorem Proving in Higher Order Logics
Proof Style

TYPES '96 Selected papers from the International Workshop on Types for Proofs and Programs
The metaprl logical programming environment

The metaprl logical programming environment
Computer assisted reasoning with MIZAR

IJCAI'85 Proceedings of the 9th international joint conference on Artificial intelligence - Volume 1
A tactic language for reasoning about Z specifications

3FACS'98 Proceedings of the 3rd BCS-FACS conference on Northern Formal Methods

Quantified Score

Hi-index	0.00

Visualization

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.