Skip to main content
Conference Proceedings

LCF-style bit-blasting in HOL4

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2011) 6898 LNCS 357-362
DOI: 10.1007/978-3-642-22863-6_26
3Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This paper describes a new proof tool for deciding bit-vector problems in HOL4. The approach is based on "bit-blasting", wherein word expressions are mapped into propositional formulas, which are then handed to a SAT solver. Significantly, the implementation uses the LCF approach, which means that the soundness of the tool is guaranteed by the soundness of HOL4's logical kernel. © 2011 Springer-Verlag.

Cite

CITATION STYLE

APA

Fox, A. C. J. (2011). LCF-style bit-blasting in HOL4. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6898 LNCS, pp. 357–362). https://doi.org/10.1007/978-3-642-22863-6_26

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free