Operating system verification—an overview
G Klein - Sadhana, 2009 - Springer
This paper gives a high-level introduction to the topic of formal, interactive, machine-
checked software verification in general, and the verification of operating systems code in …
checked software verification in general, and the verification of operating systems code in …
Towards self-verification of HOL Light
J Harrison - International Joint Conference on Automated …, 2006 - Springer
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 …
functional OCaml, whose complete formal verification seems to be quite feasible. We would …
Formalizing the metatheory of logical calculi and automatic provers in Isabelle/HOL (invited talk)
JC Blanchette - Proceedings of the 8th ACM SIGPLAN International …, 2019 - dl.acm.org
IsaFoL (Isabelle Formalization of Logic) is an undertaking that aims at develo** formal
theories about logics, proof systems, and automatic provers, using Isabelle/HOL. At the heart …
theories about logics, proof systems, and automatic provers, using Isabelle/HOL. At the heart …
Programming and verifying a declarative first-order prover in Isabelle/HOL
AB Jensen, JB Larsen, A Schlichtkrull… - AI …, 2018 - content.iospress.com
We certify in the proof assistant Isabelle/HOL the soundness of a declarative first-order
prover with equality. The LCF-style prover is a translation we have made, to Standard ML, of …
prover with equality. The LCF-style prover is a translation we have made, to Standard ML, of …
A verified simple prover for first-order logic
We present a simple prover for first-order logic with certified soundness and completeness in
Isabelle/HOL, taking formalizations by Tom Ridge and others as the starting point, but with …
Isabelle/HOL, taking formalizations by Tom Ridge and others as the starting point, but with …
Formal correctness proof for DPLL procedure
The DPLL procedure for the SAT problem is one of the fundamental algorithms in computer
science, with many applications in a range of domains, including software and hardware …
science, with many applications in a range of domains, including software and hardware …
Formalizing a paraconsistent logic in the Isabelle proof assistant
We present a formalization of a so-called paraconsistent logic that avoids the catastrophic
explosiveness of inconsistency in classical logic. The paraconsistent logic has a countably …
explosiveness of inconsistency in classical logic. The paraconsistent logic has a countably …
[PDF][PDF] HOL Light Tutorial (for version 2.20)
J Harrison - Intel JF1-13, Section, 2006 - cl.cam.ac.uk
The HOL Light theorem prover can be difficult to get started with. While the manual is fairly
detailed and comprehensive, the large amount of background information that has to be …
detailed and comprehensive, the large amount of background information that has to be …
Formalized proof, computation, and the construction problem in algebraic geometry
CT Simpson - arxiv preprint math/0410224, 2004 - arxiv.org
arxiv:math/0410224v1 [math.AG] 8 Oct 2004 Page 1 arxiv:math/0410224v1 [math.AG] 8 Oct
2004 FORMALIZED PROOF, COMPUTATION, AND THE CONSTRUCTION PROBLEM IN …
2004 FORMALIZED PROOF, COMPUTATION, AND THE CONSTRUCTION PROBLEM IN …
Status report of SARA
S Albrand, D Barneoud, JL Belmont… - Cyclotrons And Their …, 1993 - books.google.com
Recent improvements to SARA are described. Three years operation with two ECR sources
and their developments are presented. Differences between flux measurements of the 4 …
and their developments are presented. Differences between flux measurements of the 4 …