Summary: Symbolic Reachability Analysis
based on SAT Solvers
Parosh Aziz Abdulla 1 , Per Bjesse 2 , Niklas E'en 2
1 Uppsala University and Prover Technology, Sweden,
parosh@docs.uu.se
2 Chalmers University of Technology and Prover Technology, Sweden
fbjesse,eeng@cs.chalmers.se
Abstract. The introduction of symbolic model checking using Binary
Decision Diagrams (BDDs) has led to a substantial extension of the
class of systems which can be algorithmically verified. Although BDDs
have played a crucial role in this success they have some well­known
drawbacks, such as requiring an externally supplied variable ordering
and causing space blowups in certain applications. In a parallel devel­
opment, SAT solving procedures, such as Stšalmarck's method or the
Davis­Putnam procedure, have been used successfully in verifying very
large industrial systems. These efforts have recently attracted the atten­
tion of the model checking community resulting in the notion of bounded
model checking. In this paper, we show how to adapt standard algorithms
for symbolic reachability analysis to work with SAT­solvers. The key ele­
ment of our contribution is the combination of an algorithm that removes

Source: Abdulla, Parosh Aziz - Department of Information Technology, Uppsala Universitet

Collections: Computer Technologies and Information Sciences