Tools
Sorted by:
Try your query at:
 |
 |
 |
 |
 |
 |
Results 1 - 10
of
74
Temporal Induction by Incremental SAT Solving
, 2003
"... We show how a very modest modi cation to a typical modern SAT-solver enables it to solve a series of related SAT-instances eciently. ..."
Abstract
-
Cited by 92 (2 self)
- Add to MetaCart
We show how a very modest modi cation to a typical modern SAT-solver enables it to solve a series of related SAT-instances eciently.
Optimization of combinatorial testing by incremental SAT solving
- in 8th IEEE International Conference on Software Testing, Verification and Validation, ICST 2015
"... Abstract—Combinatorial testing aims at reducing the cost of software and system testing by reducing the number of test cases to be executed. We propose an approach for combinatorial testing that generates a set of test cases that is as small as possible, using incremental SAT solving. We present sev ..."
Abstract
-
Cited by 2 (0 self)
- Add to MetaCart
Abstract—Combinatorial testing aims at reducing the cost of software and system testing by reducing the number of test cases to be executed. We propose an approach for combinatorial testing that generates a set of test cases that is as small as possible, using incremental SAT solving. We present
Improving Glucose for Incremental SAT Solving with Assumptions: Application to MUS Extraction
"... Abstract. Beside the important progresses observed in SAT solving, a number of applications explicitly rely on incremental SAT solving only. In this paper, we focus on refining the incremental SAT Solver Glucose, from the SAT en-gine perspective, and address a number of unseen problems this new use ..."
Abstract
-
Cited by 9 (0 self)
- Add to MetaCart
Abstract. Beside the important progresses observed in SAT solving, a number of applications explicitly rely on incremental SAT solving only. In this paper, we focus on refining the incremental SAT Solver Glucose, from the SAT en-gine perspective, and address a number of unseen problems this new use
Asynchronous Multi-Core Incremental SAT Solving
"... Abstract. Solvers for propositional logic formulas, so called SAT solvers, are used in many practical applications. As multi-core and multi-processor hard-ware has become widely available, parallelizations of such solvers are actively researched. Such research typically ignores the incremental probl ..."
Abstract
-
Cited by 1 (1 self)
- Add to MetaCart
Abstract. Solvers for propositional logic formulas, so called SAT solvers, are used in many practical applications. As multi-core and multi-processor hard-ware has become widely available, parallelizations of such solvers are actively researched. Such research typically ignores the incremental
Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets
, 2007
"... Combinational equivalence checking is an essential task in circuit design. In this paper we focus on SAT based equivalence checking making use of incremental SAT techniques which are well known from their application in Bounded Model Checking. Based on an analysis of shared circuit structures we p ..."
Abstract
-
Cited by 5 (0 self)
- Add to MetaCart
present heuristics which try to maximize the benefit from incremental SAT solving in this application by looking for good orders in which the equivalence of different circuit outputs is checked. Moreover, we present a reset strategy for situations where the benefit from the incremental SAT approach seems
Combinational Equivalence Checking Using Incremental SAT Solving, Output Ordering, and Resets
"... Abstract — Combinational equivalence checking is an essential task in circuit design. In this paper we focus on SAT based equivalence checking making use of incremental SAT techniques which are well known from their application in Bounded Model Checking. Based on an analysis of shared circuit struct ..."
Abstract
- Add to MetaCart
structures we present heuristics which try to maximize the benefit from incremental SAT solving in this application by looking for good orders in which the equivalence of different circuit outputs is checked. Moreover, we present a reset strategy for situations where the benefit from the incremental SAT
Incremental SAT Seminar Satisfiability Checking
"... Abstract. Nadel et. al. propose Ultimately Incremental SAT (UI-SAT), an algorithm for incremental SAT solving under assumptions. After solving a formula, incremental SAT solving under assumptions allows to reinvoke the SAT solver with additional clauses added to the problem. At the same time, assump ..."
Abstract
- Add to MetaCart
Abstract. Nadel et. al. propose Ultimately Incremental SAT (UI-SAT), an algorithm for incremental SAT solving under assumptions. After solving a formula, incremental SAT solving under assumptions allows to reinvoke the SAT solver with additional clauses added to the problem. At the same time
Faster FDR Counterexample Generation Using SAT-Solving
, 2009
"... With the flourishing development of efficient SAT-solvers, bounded model checking (BMC) has proven to be an extremely powerful symbolic model checking technique. In this paper, we address the problem of applying BMC to concurrent systems involving the interaction of multiple processes running in pa ..."
Abstract
-
Cited by 2 (1 self)
- Add to MetaCart
our bounded refinement-checking algorithm which is based on watchdog transformations and incremental SAT-solving. We have implemented a tool, SymFDR, written in C++ which uses FDR as a shared library for manipulating CSP processes and the state-of-the-art SAT-solver MiniSAT. Experiments indicate
Existential Quantification as Incremental SAT
- In Twenty-third International Conference on Computer Aided Verification, G. Gopalakrishnan and
"... Abstract. This paper presents an elegant algorithm for existential quantifier elimination using incremental SAT solving. This approach contrasts with existing techniques in that it is based solely on manipulating the SAT instance rather than requiring any reengineering of the SAT solver or needing a ..."
Abstract
-
Cited by 18 (7 self)
- Add to MetaCart
Abstract. This paper presents an elegant algorithm for existential quantifier elimination using incremental SAT solving. This approach contrasts with existing techniques in that it is based solely on manipulating the SAT instance rather than requiring any reengineering of the SAT solver or needing
Results 1 - 10
of
74
