Read Combining the Hol98 Proof Assistant with the BuDDy BDD Package

Combining the Hol98 Proof Assistant with the BuDDy BDD Package

Michael J. C. Gordon

4.9/5 (34380 ratings)

Description:Abstract: "Theorem provers descended from LCF allow their users to write complex proof tools with high assurance that false theorems will not be proved. This report describes an experimental system that extends the LCF approach to enable combinations of deduction and BDD-based symbolic calculation to be programmed with a similar assurance. The deduction is supplied by the Hol98 system and the BDD algorithms by Jørn Lind-Nielsen's BuDDy package. The main idea is to provide LCF-style support to a set of inference rules for judgements pt [deducible from][right arrow] b, where p is an order-inducing map from HOL variables to BDD variables, t is a HOL term and b is a BDD. A single oracle rule allows a HOL theorem [deducible from] t to be deduced from pt [deducible from][right arrow] TRUE. This report is intended to serve as documentation for the Hol98 library HolBddLib. It is partly an exposition of standard results, partly tutorial and partly an account of research in combining deduction and symbolic state enumeration."We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with Combining the Hol98 Proof Assistant with the BuDDy BDD Package. To get started finding Combining the Hol98 Proof Assistant with the BuDDy BDD Package, you are right to find our website which has a comprehensive collection of manuals listed.
Our library is the biggest of these that have literally hundreds of thousands of different products represented.

Pages: 80

Format: PDF, EPUB & Kindle Edition

Publisher: —

Release: 1999

ISBN: VU4kAQAAIAAJ

Description: Abstract: "Theorem provers descended from LCF allow their users to write complex proof tools with high assurance that false theorems will not be proved. This report describes an experimental system that extends the LCF approach to enable combinations of deduction and BDD-based symbolic calculation to be programmed with a similar assurance. The deduction is supplied by the Hol98 system and the BDD algorithms by Jørn Lind-Nielsen's BuDDy package. The main idea is to provide LCF-style support to a set of inference rules for judgements pt [deducible from][right arrow] b, where p is an order-inducing map from HOL variables to BDD variables, t is a HOL term and b is a BDD. A single oracle rule allows a HOL theorem [deducible from] t to be deduced from pt [deducible from][right arrow] TRUE. This report is intended to serve as documentation for the Hol98 library HolBddLib. It is partly an exposition of standard results, partly tutorial and partly an account of research in combining deduction and symbolic state enumeration."We have made it easy for you to find a PDF Ebooks without any digging. And by having access to our ebooks online or by storing it on your computer, you have convenient answers with Combining the Hol98 Proof Assistant with the BuDDy BDD Package. To get started finding Combining the Hol98 Proof Assistant with the BuDDy BDD Package, you are right to find our website which has a comprehensive collection of manuals listed.
Our library is the biggest of these that have literally hundreds of thousands of different products represented.

Special Offer | $0.00

Special Offer! | $0.00

Combining the Hol98 Proof Assistant with the BuDDy BDD Package

Combining the Hol98 Proof Assistant with the BuDDy BDD Package

More Books

Programming Language Theory and Its Implementation (Prentice Hall Series in Computer Science) by Michael J. C. Gordon (1993-06-03)

Programming Language Theory and Its Implementation (Prentice Hall Series in Computer Science) by Michael J. C. Gordon (1993-06-03)

Programming language theory and its implementation: Applicative and imperative paradigms (Prentice Hall international series in computer science)

Programming language theory and its implementation: Applicative and imperative paradigms (Prentice Hall international series in computer science)

The Denotational Description of Programming Languages: An Introduction

The Denotational Description of Programming Languages: An Introduction

The Denotational Description of Programming Languages: An Introduction. 1979 Ex-library edition. 160 pages

The Denotational Description of Programming Languages: An Introduction. 1979 Ex-library edition. 160 pages

Edinburgh LCF: A mechanised logic of computation (Lecture notes in computer science)

Edinburgh LCF: A mechanised logic of computation (Lecture notes in computer science)

Why higher-order logic is a good formalism for specifying and verifying hardware (TR. University of Cambridge, Computer Laboratory)

Why higher-order logic is a good formalism for specifying and verifying hardware (TR. University of Cambridge, Computer Laboratory)

Programming Language Theory and Its Implementation (Prentice Hall Series in Computer Science)

Programming Language Theory and Its Implementation (Prentice Hall Series in Computer Science)

666 (Dark Drabbles, #11)

666 (Dark Drabbles, #11)

Biological Information: New Perspectives

Biological Information: New Perspectives