Global ETD Search
Search theses and dissertations gathered from participating repositories worldwide. Every result links back to the library that holds it. No account is needed.
Results
Showing 1 to 19 of 19 for “"Satisfiability (SAT)"”.
-
Satisfiability Advancements Enabled by State Machines
… dissertation focuses on research for state-based Satisfiability (SAT), a variant of SAT that uses state machines (Smurfs) to represent constraints. Using this constraint representation allows for compact representations of SAT problem instances that retain more ungarbled user- domain information …
-
Constraint Solving for Diagnosing Concurrency Bugs
… problems. By leveraging the power of constraint satisfiability (SAT) solvers and a bounded model checker, we perform a semantic analysis of the sequential computation as well as the thread interactions. The analysis is ideally suited for handling software with small to medium code size but …
-
Exploits in Concurrency for Boolean Satisfiability
Boolean Satisfiability (SAT) is a problem that holds great theoretical significance along with effective formulations that benefit many real-world applications. While the general problem is NP-complete, advanced solver algorithms and heuristics allow for fast solutions to many large industrial …
-
Smten and the art of satisfiability-based search
Satisfiability (SAT) and Satisfiability Modulo Theories (SMT) have been leveraged in solving a wide variety of important and challenging combinatorial search problems, including automatic test generation, logic synthesis, model checking, program synthesis, and software verification. Though in …
-
Machine learning for structural reasoning in Boolean Satisfiability
… of machine learning and propositional Boolean Satisfiability (SAT) offers transformative possibilities for solving some of the most challenging computational problems. This thesis investigates the use of modern machine learning (ML) and deep learning (DL) methodologies to enhance Boolean …
-
Algorithm selection, scheduling and configuration of Boolean constraint solvers
… of answer set programming (ASP), the constraint satisfaction problem (CSP), propositional satisfiability (SAT) and satisfiability of quantified Boolean formulas (QBF). However, in all these areas, there exist multiple solving strategies that work well on different applications; no strategy …
-
Efficient Automated Planning with New Formulations
… paradigms: state space search and planning as Satisfiability: SAT), with three major contributions. First, we have utilized SAS+ for a new hierarchical state space search model by taking advantage of the decomposable structure within SAS+. This algorithm can greatly reduce the time complexity …
-
Strategies for SAT-Based Formal Verification
… In this dissertation, we focus on Boolean Satisfiability (SAT) based formal verification, which has gained tremendous importance in the recent past. Importantly, SAT-based approaches often alleviate the memory explosion problem, which had been a bottleneck of the traditional symbolic …
-
Mining constraints for Testing and Verification
… in a sequential circuit. In a Boolean satisfiability (SAT) based framework for the bounded sequential equivalence checking, by taking advantage of the repeated search space, our mining algorithm is only performed on a small window size of unrolled circuit, and the mined relations could …
-
Functional timing analysis of VLSI circuits containing complex gates
… timing constraints imposed to the design may be satisfied or not. It can be performed by using circuit simulation or by timing analysis. Although simulation tends to furnish the most accurate estimates, it presents the drawback of being stimuli dependent. Hence, in order to ensure that the …
-
Proof theory and algorithms for answer set programming
… search for answer sets are inspired by Boolean Satisfiability (SAT) solving approaches. While the latter have firm proof-theoretic foundations, ASP lacks formal frameworks for characterizing and comparing solving methods. Furthermore, sophisticated search patterns of modern SAT solvers, …
-
Exploring Constraint Satisfiability Techniques in Formal Verification
… widespread demands for efficient Propositional Satisfiability (SAT) solvers and its derivatives in Electronic Design Automation applications, methods to boost the performance of the SAT solver are highly desired. This dissertation aims to enhance the performance of SAT and related SAT solving …
-
Towards Reliable AI via Efficient Verification of Binarized Neural Networks
… is, therefore, typically formulated as a Boolean satisfiability (SAT) problem. This formulation involves numerous reified cardinality constraints. Previous work typically converts such constraints to conjunctive normal form to be solved by an off-the-shelf SAT solver. Unfortunately, previous BNN …
-
Circuit Design Methods with Emerging Nanotechnologies
… (PLE) is first proposed to explore the versatile functionalities of threshold gates (TGs) and multi-threshold threshold gates (MTTGs). This PLE structure can realize all three- or four-variable logic functions through configuring binary control bits. This is the first single threshold logic …
-
Partial compilation of constraint problems
… to answer queries related to model counting, satisfiability, equivalence, etc. Most such queries are NP-hard problems. Knowledge Compilation (KC) methods were developed to deal with the complexity of solving combinatorial problems online by creating a representation offline that is able to …
-
Sufficiency-based Filtering of Invariants for Sequential Equivalence Checking
Verification, as opposed to Testing and Post-Silicon Validation, is a critical step for Integrated Circuits (IC) Design, answering the question "Are we designing the right function?" before the chips are manufactured. One of the core areas of Verification is Equivalence Checking (EC), which is a …
-
Sequential Equivalence Checking with Efficient Filtering Strategies for Inductive Invariants
Powerful sequential optimization techniques can drastically change the Integrated Circuit (IC) design paradigm. Due to the limited capability of sequential verification tools, aggressive sequential optimization is shunned nowadays as there is no efficient way to prove the preservation of …
-
Enhancing SAT-based Formal Verification Methods using Global Learning
… we firstly propose a novel technique to improve SAT-based Combinational Equivalence Checking (CEC) and Bounded Model Checking (BMC). The idea is to perform a low-cost preprocessing that will statically induce global signal relationships into the original CNF formula of the circuit under …
-
Design automation for circuit reliability and energy efficiency
… heuristics are used in our approaches such as SAT solving, data mining, logic restructuring, and applied mathematics. Furthermore, the scalability of our approaches was taken into account while we developed our solutions. Experimental results show that our approaches offer the following …