A Brief Overview of HOL4

Slind, Konrad; Norrish, Michael

doi:10.1007/978-3-540-71067-7_6

Cited by 217 publications

(112 citation statements)

References 6 publications

Supporting

Mentioning

111

Contrasting

Unclassified

Order By: Relevance

“…By contrast, proof assistants based on higher-order logic (HOL), such as HOL4 [64], HOL Light [32], and Isabelle/HOL [56], have traditionally provided only datatypes. Isabelle/HOL is the first of these systems to also offer codatatypes.…”

Section: Introductionmentioning

confidence: 99%

Friends with Benefits

Blanchette

Bouzy

Lochbihler

et al. 2017

Programming Languages and Systems

View full text Add to dashboard Cite

Abstract. We introduce AmiCo, a tool that extends a proof assistant, Isabelle/ HOL, with flexible function definitions well beyond primitive corecursion. All definitions are certified by the assistant's inference kernel to guard against inconsistencies. A central notion is that of friends: functions that preserve the productivity of their arguments and that are allowed in corecursive call contexts. As new friends are registered, corecursion benefits by becoming more expressive. We describe this process and its implementation, from the user's specification to the synthesis of a higher-order definition to the registration of a friend. We show some substantial case studies where our approach makes a difference.

show abstract

Section: Introductionmentioning

confidence: 99%

Friends with Benefits

Blanchette

Bouzy

Lochbihler

et al. 2017

Programming Languages and Systems

View full text Add to dashboard Cite

show abstract

“…The proof development 3 presented in this paper has been carried out in the HOL4 theorem prover [20].…”

Section: Introductionmentioning

confidence: 99%

Proof Pearl: A Verified Bignum Implementation in x86-64 Machine Code

Myreen

Curello

2013

Certified Programs and Proofs

View full text Add to dashboard Cite

Abstract. Verification of machine code can easily deteriorate into an endless clutter of low-level details. This paper presents a case study which shows that machine-code verification does not necessitate ghastly lowlevel proofs. The case study we describe is the construction of an x86-64 implementation of arbitrary-precision integer arithmetic. Compared with closely related work, our proofs are shorter and, more importantly, the reasoning is at a more convenient high level of abstraction, e.g. pointer reasoning is largely avoided. We achieve this improvement as a result of using an abstraction for arrays and previously developed tools, namely, a proof-producing decompiler and compiler. The work presented in this paper has been developed in the HOL4 theorem prover. The case study resulted in 800 lines of verified 64-bit x86 machine code.

show abstract

“…The scale and complexity is such that it is not possible to eradicate all errors by simply eyeballing the specification or examining a few instructions. This paper discusses our experiences with constructing and validating a complete model of the ARMv7 architecture using the HOL4 proof system [16].…”

Section: Introductionmentioning

confidence: 99%

A Trustworthy Monadic Formalization of the ARMv7 Instruction Set Architecture

Fox

Myreen

2010

Interactive Theorem Proving

105

View full text Add to dashboard Cite

Abstract. This paper presents a new HOL4 formalization of the current ARM instruction set architecture, ARMv7. This is a modern RISC architecture with many advanced features. The formalization is detailed and extensive. Considerable tool support has been developed, with the goal of making the model accessible and easy to work with. The model and supporting tools are publicly available -we wish to encourage others to make use of this resource. This paper explains our monadic specification approach and gives some details of the endeavours that have been made to ensure that the sizeable model is valid and trustworthy. A novel and efficient testing approach has been developed, based on automated forward proof and communication with ARM development boards.

show abstract

A Brief Overview of HOL4

Cited by 217 publications

References 6 publications

Friends with Benefits

Friends with Benefits

Proof Pearl: A Verified Bignum Implementation in x86-64 Machine Code

A Trustworthy Monadic Formalization of the ARMv7 Instruction Set Architecture

Contact Info

Product

Resources

About