A survey of recent advances in SAT-based formal verification

Prasad, Munaga V. N. K.; Biere, Armin; Gupta, Aarti

doi:10.1007/s10009-004-0183-4

Cited by 204 publications

(123 citation statements)

References 103 publications

Supporting

Mentioning

120

Contrasting

Order By: Relevance

“…In Lemma 2, we then prove that QF BV2 31 PSpace by giving a translation from QF BV2 31 to (polynomial sized) Sequential Circuits. As pointed out for example in [19], the symbolic reachability problem is PSpacecomplete as well.…”

Section: Complexity Resultsmentioning

confidence: 97%

“…A similar approach used for translating QBF to Symbolic Model Verification (SMV) can be found in [21]. See also [19] for a translation from QBF to Sequential Circuits. l Lemma 2.…”

Section: Complexity Resultsmentioning

confidence: 99%

“…For QF BV2 bw this shows the importance of bit-width reduction as proposed in [16,17] before bit-blasting. For formulas in QF BV2 31 or one of the related classes, only using shift by 1, addition, multiplication by constant, and indexing, techniques used in state-of-the-art QBF solvers [25] or symbolic model checking on Sequential Circuits [19] might be of interest.…”

Section: Discussionmentioning

confidence: 99%

See 2 more Smart Citations

More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding

Fröhlich

Kovásznai

Biere

2013

Computer Science – Theory and Applications

Self Cite

View full text Add to dashboard Cite

Abstract. Bit-precise reasoning is important for many practical applications of Satisfiability Modulo Theories (SMT). In recent years, efficient approaches for solving fixed-size bit-vector formulas have been developed. From the theoretical point of view, only few results on the complexity of fixed-size bit-vector logics have been published. Most of these results only hold if unary encoding on the bit-width of bit-vectors is used. In previous work [1], we showed that binary encoding adds more expressiveness to bit-vector logics, e.g. it makes fixed-size bit-vector logic without uninterpreted functions nor quantification NExpTime-complete. In this paper, we look at the quantifier-free case again and propose two new results. While it is enough to consider logics with bitwise operations, equality, and shift by constant to derive NExpTime-completeness, we show that the logic becomes PSpace-complete if, instead of shift by constant, only shift by 1 is permitted, and even NP-complete if no shifts are allowed at all.

show abstract

Section: Complexity Resultsmentioning

confidence: 97%

“…A similar approach used for translating QBF to Symbolic Model Verification (SMV) can be found in [21]. See also [19] for a translation from QBF to Sequential Circuits. l Lemma 2.…”

Section: Complexity Resultsmentioning

confidence: 99%

Section: Discussionmentioning

confidence: 99%

See 1 more Smart Citation

More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding

Fröhlich

Kovásznai

Biere

2013

Computer Science – Theory and Applications

Self Cite

View full text Add to dashboard Cite

show abstract

“…Over the last years, propositional logic has proven to be a powerful host language for a wide range of real-life problems like verification and planning, not least because efficient and stable solvers for this problem, SAT solvers, are available [20]. For our merging problem, we also take advantage of this technology which allows for a direct representation of the merging problem.…”

Section: Encoding To Satmentioning

confidence: 99%

Guided Merging of Sequence Diagrams

Widl

Biere

Brosch

et al. 2013

Software Language Engineering

Self Cite

View full text Add to dashboard Cite

Abstract. The employment of optimistic model versioning systems allows multiple developers of a team to work independently on their local copies of a software model. The merging process towards one consolidated version obviously turns out to be challenging when performed without any tool support. Recently, several sophisticated approaches for model merging have been presented. However, even for multi-view modeling languages like UML, which distribute the information on the system under development over different diagrams, diagrams of different views are merged independently of each other. Hence, inconsistencies between different views are likely to be introduced into the merged model. We suggest to solve this problem by exploiting information stored in one view as constraint for the computation of a consolidated version of another view. More specifically, we demonstrate how state machines can guide the integration of parallel changes performed on a sequence diagram. We give a concise formal description of this problem and suggest a translation to propositional logic.

show abstract

“…The importance of deriving a good variable ordering to guide SAT search is well known, as discussed in [21] [14] [22]. Activity based scores alone are not sufficient to derive a good initial variable order.…”

Section: Incorporating Connectivity-based Decision Heuristicsmentioning

confidence: 99%

Guiding CNF-SAT Search by Analyzing Constraint-Variable Dependencies and Clause Lengths

Durairaj

Kalla

2006

2006 IEEE International High Level Design Validation and Test Workshop

View full text Add to dashboard Cite

The type of decision strategies employed for CNF-SAT have a profound effect on the efficiency and performance of SAT engines. Over the years, a variety of decision heuristics have been proposed; each has its own achievements and limitations. This paper re-visits the issue of decision heuristics and engineers a new approach that takes an integrated view of the overall problem structure. Our approach qualitatively analyzes clause-variable dependencies by accounting for variable/literal activity, clause connectivity, distribution of variables among clauses of different lengths, and correlation among variables, to derive an initial static ordering for SAT search. To account for conflict clauses and their resolution, a corresponding dynamic variable order update strategy is also presented. Quantitative metrics are proposed that are used to devise an algorithmic approach to guide overall SAT search. Experimental results demonstrate that our strategy significantly outperforms conventional approaches.

show abstract

A survey of recent advances in SAT-based formal verification

Cited by 204 publications

References 103 publications

More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding

More on the Complexity of Quantifier-Free Fixed-Size Bit-Vector Logics with Binary Encoding

Guided Merging of Sequence Diagrams

Guiding CNF-SAT Search by Analyzing Constraint-Variable Dependencies and Clause Lengths

Contact Info

Product

Resources

About