By Topic

An efficient sequential equivalence checking framework using Boolean Satisfiability

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

3 Author(s)
Feijun Zheng, ; Zhejiang Univ., Hangzhou ; Yanling Weng ; Xiaolang Yan

This paper presents a sequential equivalence checking (SEC) framework based upon Boolean satisfiability (SAT) related engines such as sequential SAT and invariant checking. By detecting invariants in the miter circuits, the search space can be dramatically reduced. Some techniques such as timeframe expansion and dynamic candidate selection are introduced to enhance the invariant checking accuracy. Furthermore, a heuristic is presented to quickly find counter-examples for those in-equivalent tasks. The efficiency of the approach is demonstrated using some larger ISCAS89 circuits and hard-to-verify industrial circuits.

Published in:

ASIC, 2007. ASICON '07. 7th International Conference on

Date of Conference:

22-25 Oct. 2007