Towards Self-verification of HOL Light

Towards Self-verification of HOL Light (2006)

by John Harrison

Venue:	In International Joint Conference on Automated Reasoning
Citations:	10 - 0 self

Datum	Value	Source
TITLE	Towards Self-verification of HOL Light	INFERENCE
AUTHOR NAME	John Harrison	SVM HeaderParse 0.2
AUTHOR AFFIL	Intel Corporation, JF1-13	SVM HeaderParse 0.2
AUTHOR ADDR	2111 NE 25th Avenue; Hillsboro OR 97124	SVM HeaderParse 0.2
ABSTRACT	Abstract. The HOL Light prover is based on a logical kernel consisting of about 400 lines of mostly functional OCaml, whose complete formal verification seems to be quite feasible. We would like to formally verify (i) that the abstract HOL logic is indeed correct, and (ii) that the OCaml code does correctly implement this logic. We have performed a full verification of an imperfect but quite detailed model of the basic HOL Light core, without definitional mechanisms, and this verification is entirely conducted with respect to a set-theoretic semantics within HOL Light itself. We will duly explain why the obvious logical and pragmatic difficulties do not vitiate this approach, even though it looks impossible or useless at first sight. Extension to include definitional mechanisms seems straightforward enough, and the results so far allay most of our practical worries. 1 Introduction: quis custodiet ipsos custodes? Mathematical proofs are subjected to peer review before publication, but there	SVM HeaderParse 0.2
YEAR	2006	INFERENCE
VENUE	In International Joint Conference on Automated Reasoning	INFERENCE
VENUE TYPE	CONFERENCE	INFERENCE
PAGES	177--191	INFERENCE
CITATIONS	24 found	ParsCit 1.0