A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
A proof engine approach to solving combinational design automation problems
2002
Proceedings - Design Automation Conference
There are many approaches available for solving combinational design automation problems encoded as tautology or satisfiability checks. Unfortunately there exists no single analysis that gives adequate performance for all problems of interest, and it is therefore critical to be able to combine approaches. In this paper, we present a proof engine framework where individual analyses are viewed as strategies-functions between different proof states. By defining our proof engine in such a way that
doi:10.1145/513918.514101
dblp:conf/dac/AnderssonBCH02
fatcat:odnnqydaafdh7grw4rtxvkyu2y