An unsatisfiable set is a set of formulas whose conjunction is unsatisfiable. Every
unsatisfiable set can be corrected, ie, made satisfiable, by removing a subset of its members …

Abstract The Boolean Satisfiability Problem (SAT) is well known in computational
complexity, representing the first decision problem to be proved NP-complete. SAT is also …

Finding a minimal (ie, irreducible) unsatisfiable core (MUC), and high-level minimal
unsatisfiable core (also known as group MUC, or GMUC), are well-studied problems in the …

Symbolic model checkers can construct proofs of safety properties over complex models, but
when a proof succeeds, the results do not generally provide much insight to the user …

Various technologies are based on the capability to find small unsatisfiable cores given an
unsatisfiable CNF formula, ie, a subset of the clauses that are unsatisfiable regardless of the …

Core-guided MAXSAT algorithms dominate other methods in solving industrial MAXSAT
problems. In this work, we propose a new efficient algorithm that is guided by correction sets …

Verification of multitasking embedded software requires taking into account its underlying
operating system wrt its scheduling policy and handling of task priorities in order to achieve …

Parallelization is a natural direction towards the improvements in the scalability of algorithms
for the computation of Minimally Unsatisfiable Subformulas (MUSes), and group-MUSes, of …

Symbolic model checkers can construct proofs of properties over highly complex models.
However, the results reported by the tool when a proof succeeds do not generally provide …

通常的时序电路等价性验证方法是将触发器按时序展开, 从而将时序电路转化为组合电路进行
验证. 而一般在待验证的两个时序电路中, 触发器是一一对应的, 找到触发器的对应关系 …