QuteSAT: A Robust Circuit-based SAT Solver for Complex Circuit Structure

Wu, Chi-An; Lin, Tengfei; Lee, Chih-Chun; Huang, Chung-Yang

doi:10.1109/date.2007.364479

Cited by 10 publications

(10 citation statements)

References 11 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Circuit-based SAT solvers [10], [11] have been developed orthogonally to CNF-based SAT solver. These solvers do not work on the CNF representation anymore but directly on the circuit structure.…”

Section: A Related Workmentioning

confidence: 99%

Speeding up SAT-Based ATPG Using Dynamic Clause Activation

Eggergluss

Tille

Drechsler

2009

2009 Asian Test Symposium

View full text Add to dashboard Cite

Abstract-SAT-based ATPG turned out to be a robust alternative to classical structural ATPG algorithms such as FAN. The number of unclassified faults can be significantly reduced using a SAT-based ATPG approach. In contrast to structural ATPG, SAT solvers work on a Boolean formula in Conjunctive Normal Form (CNF). This results in some disadvantages for SAT solvers when applied to ATPG, e.g. CNF transformation time and loss of structural knowledge. As a result, SAT-based ATPG algorithms are very robust for hard-to-test faults, but suffer from the overhead for easy-to-test faults.We propose the SAT technique Dynamic Clause Activation (DCA) in order to reduce the run time gap between structural and SAT-based ATPG algorithms and, at the same time, retain the high level of robustness. Using DCA, the SAT solver works on a partial formula of a logic circuit which is dynamically extended during the search process using structural knowledge. Furthermore, efficient dynamic learning techniques can be easily integrated within the proposed technique. The approach is evaluated on large industrial circuits.

show abstract

Section: A Related Workmentioning

confidence: 99%

Speeding up SAT-Based ATPG Using Dynamic Clause Activation

Eggergluss

Tille

Drechsler

2009

2009 Asian Test Symposium

View full text Add to dashboard Cite

show abstract

“…It has been shown in [26], [33] that the time needed to generate an instance often exceeds the time needed to solve it. The instance generation step would be unnecessary if a circuit-based SAT solver [25], [37] is used. However, due to our experimental studies, the application of circuit-SAT solvers to the ATPG problem results in increased overall runtime.…”

Section: B Circuit-to-cnf Conversionmentioning

confidence: 99%

Structural heuristics for SAT-based ATPG

Tille

Eggersglüß

et al. 2009

2009 17th IFIP International Conference on Very Large Scale Integration (VLSI-SoC)

View full text Add to dashboard Cite

Abstract-Due to ever increasing design sizes more efficient tools for Automatic Test Pattern Generation (ATPG) are needed. The application of the Boolean satisfiability problem (SAT) to ATPG has been shown to be a robust alternative to traditional ATPG techniques. A major challenge of research in the field of SAT-based ATPG is to obtain a robust algorithm which can solve hard SAT instances reliably without slowing down easy-to-solve SAT instances. This is particular important, since easy-to-solve SAT instances form the majority of an ATPG run. This paper proposes two structural heuristics. The first one uses testability measurements to obtain an improved initial variable order, while the second heuristic prunes many easy-to-test faults by finding easy-to-control paths. Experimental results on large industrial designs confirm that the proposed methodologies result in a significant overall speed-up.

show abstract

“…While current SAT solvers normally accept only CNF-formulas as input, one of the most important applications of satisfiability testing is verification and optimization in Electronic Design Automation (EDA), where the instances derive mostly from digital circuit descriptions [WLLH07]. Though many such instances can easily be encoded in CNF, the original structural information, such as signal ordering, gate orientation and logic paths, is lost, or at least obscured.…”

Section: Introductionmentioning

confidence: 99%

“…Though many such instances can easily be encoded in CNF, the original structural information, such as signal ordering, gate orientation and logic paths, is lost, or at least obscured. Since exactly this information can be very helpful for solving these instances, considerable effort has been made recently to develop satisfiability solvers that work with the circuit description directly [WLLH07], which have far superior performance in EDA applications, or to restore the circuit structure from CNF [FM07]. This is a major motivation for our study.…”

Section: Introductionmentioning

confidence: 99%

The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits

Schwerdtfeger

2015

Theory Comput Syst

View full text Add to dashboard Cite

For Boolean satisfiability problems, the structure of the solution space is characterized by the solution graph, where the vertices are the solutions, and two solutions are connected iff they differ in exactly one variable. In 2006, Gopalan et al. studied connectivity properties of the solution graph and related complexity issues for CSPs [GKMP09], motivated mainly by research on satisfiability algorithms and the satisfiability threshold. They proved dichotomies for the diameter of connected components and for the complexity of the st-connectivity question, and conjectured a trichotomy for the connectivity question. Recently, we were able to establish the trichotomy [Sch13].Here, we consider connectivity issues of satisfiability problems defined by Boolean circuits and propositional formulas that use gates, resp. connectives, from a fixed set of Boolean functions. We obtain dichotomies for the diameter and the two connectivity problems: On one side, the diameter is linear in the number of variables, and both problems are in P, while on the other side, the diameter can be exponential, and the problems are PSPACE-complete. For partially quantified formulas, we show an analogous dichotomy.

show abstract

QuteSAT: A Robust Circuit-based SAT Solver for Complex Circuit Structure

Cited by 10 publications

References 11 publications

Speeding up SAT-Based ATPG Using Dynamic Clause Activation

Speeding up SAT-Based ATPG Using Dynamic Clause Activation

Structural heuristics for SAT-based ATPG

The Connectivity of Boolean Satisfiability: Dichotomies for Formulas and Circuits

Contact Info

Product

Resources

About