Efficient reachability checking using sequential SAT
Published in Asia and South Pacific Design Automation Conference • Jan 27, 2004
NobleIDNI2P45W74R27S28
Authors:,,
G. Parthasarathy
M.K. Iyer
Kwang‐Ting Cheng
Abstract
Reachability checking and preimage computation are fundamental problems in ATPG and formal verification. Traditional sequential search techniques based on ATPG/SAT, or on OBDDS have diverging strengths and weaknesses. Here, we describe how structural analysis and conflict-based learning are combined...
Finding related papers...
Discussions
(0)No comments yet
Be the first to share your thoughts!