By Topic

Mining Global Constraints With Domain Knowledge for Improving Bounded Sequential Equivalence Checking

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Weixin Wu ; Virginia Polytech. Inst. & State Univ., Blacksburg ; Hsiao, M.S.

We present a novel technique on mining relationships in a sequential circuit to discover global constraints. We utilize domain knowledge to prune the search space for our mining process, via which the mined relations may often span several time frames, thus improving the deductibility of the problem instance. Experimental results demonstrate that the application of these global constraints to satisfiability (SAT)-based bounded sequential equivalence checking can achieve a one to two orders-of-magnitude speedup.

Published in:

Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on  (Volume:27 ,  Issue: 1 )