AAS 390 Chapter Notes - Chapter 1: Automated Theorem Proving, Boolean Satisfiability Problem, Memory Access Pattern

12 views2 pages

Document Summary

Spear is a modular arithmetic theorem prover designed for prov- ing software veri cation conditions. The core of the theorem prover is a fast and simple sat solver, which is described in this paper. Keywords theorem proving, boolean satis ability, parameter op- timization, modular arithmetic. Spear is a theorem prover for modular arithmetic, designed for software veri cation, but is also fast on other industrial problems, like bounded hardware modelchecking. When given modular arith- metic constraints, spear performs elaborate encoding and opti- mization of constraints. Together with structural information, the encoded formula is passed to the core sat solver. Given cnf in- put, spear acts like an ordinary sat solver, and does not attempt to reconstruct structural information, which is typically lost when the industrial instances are encoded into cnf. Three versions of the solver were submitted to the sat 2007 competition: spear v0. 8 search parameters were manually optimized according to a this should work heuristic.

Get access

Grade+20% off
$8 USD/m$10 USD/m
Billed $96 USD annually
Grade+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
40 Verified Answers
Class+
$8 USD/m
Billed $96 USD annually
Class+
Homework Help
Study Guides
Textbook Solutions
Class Notes
Textbook Notes
Booster Class
30 Verified Answers

Related Documents

Related Questions