Verification of partial designs using incremental QBF
Christian Miller, Paolo Marin, Bernd Becker · AI Communications · 2015
SAT solving is an indispensable core component of numerous formal verification tools and has found widespread use in industry, in particular when using it in an incremental fashion, e.g., in Bounded Model Checking (BMC). On the other hand, for some a