364 search results - page 27 / 73 » Model checking with Boolean Satisfiability |
APN
2008
Springer
13 years 9 months ago
2008
Springer
Model checking is a powerful and widespread technique for the verification of finite distributed systems. However, the main hindrance for wider application of this technique is the...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Determining the evolutionary history of a given biological data is an important task in biological sciences. Given a set of quartet topologies over a set of taxa, the Maximum Quart...
TACAS
2005
Springer
14 years 1 months ago
2005
Springer
Searching the state space of a system using enumerative and on-the-fly depth-first traversal is an established technique for model checking finite-state systems. In this paper, ...
SAT
2010
Springer
13 years 11 months ago
2010
Springer
Abstract. We describe a DPLL-based solver for the problem of quantified boolean formulas (QBF) in non-prenex, non-CNF form. We make two contributions. First, we reformulate clause...
28
Voted
CSL
2009
Springer
14 years 2 months ago
2009
Springer
For programs whose data variables range over boolean or finite domains, program verification is decidable, and this forms the basis of recent tools for software model checking. I...