Abstract
This work presents a memory-efficient All-SAT engine which, given a propositional formula over sets of important and non-important variables, returns the set of all the assignments to the important variables, which can be extended to solutions (satisfying assignments) to the formula. The engine is built using elements of modern SAT solvers, including a scheme for learning conflict clauses and non-chronological backtracking. Re-discovering solutions that were already found is avoided by the search algorithm itself, rather than by adding blocking clauses. As a result, the space requirements of a solved instance do not increase when solutions are found. Finding the next solution is as efficient as finding the first one, making it possible to solve instances for which the number of solutions is larger than the size of the main memory.
We show how to exploit our All-SAT engine for performing image computation and use it as a basic block in achieving full reachability which is purely SAT-based (no BDDs involved).
We implemented our All-SAT solver and reachability algorithm using the state-of-the-art SAT solver Chaff [19] as a code base. The results show that our new scheme significantly outperforms All-SAT algorithms that use blocking clauses, as measured by the execution time, the memory requirement, and the number of steps performed by the reachability analysis.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Beer, I., Ben-David, S., Landver, A.: On-the-fly model checking of RCTL formulas. In: 10th Computer Aided Verification, pp. 184–194 (1998)
Biere, A., Cimatti, A., Clarke, E.M., Fujita, M., Zhu, Y.: Symbolic model checking using SAT procedures instead of BDDs. In: D. (ed.) IEEE Computer Society Press (June 1999)
Birnbaum, E., Lozinskii, E.L.: The good old davis-putnam procedure helps counting models. Journal of Artificial Intelligence Research 10, 457–477 (1999)
Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE transactions on Computers C-35(8), 677–691 (1986)
Burch, J.R., Clarke, E.M., McMillan, K.L., Dill, D.L., Hwang, L.J.: Symbolic model checking: 1020 states and beyond. Information and Computation 98(2), 142–170 (1992)
Chauhan, P., Clarke, E.M., Kroening, D.: Using SAT based image computation for reachability analysis. Technical Report CMU-CS-03-151, Carnegie Mellon University (2003)
Chauhan, P.P., Clarke, E.M., Kroening, D.: A SAT-based algorithm for reparameterization in symbolic simulation. In: DAC (2004)
Davis, M., Logemann, G., Loveland, D.: A machine program for theorem proving. CACMÂ 5(7) (July 1962)
Davis, M., Putnam, H.: A computing procedure for quantification theory. JACM 7(3), 201–215 (1960)
Goldberg, E., Novikov, Y.: Berkmin: A fast and robust SAT-solver. In: DATE (2002)
Gupta, A., Yang, Z., Ashar, P., Gupta, A.: SAT-based image computation with application in reachability analysis. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol. 1954, pp. 354–371. Springer, Heidelberg (2000)
Bayardo Jr., R.J., Pehoushek, J.D.: Counting models using connected components. In: IAAI, pp. 157–162. AAAI, Menlo Park (2000)
Kang, H.J., Park, I.C.: SAT-based unbounded symbolic model checking. In: DAC (2003)
Lahiri, S.K., Bryant, R.E., Cook, B.: A symbolic approach to predicate abstraction. In: Hunt Jr., W.A., Somenzi, F. (eds.) CAV 2003. LNCS, vol. 2725, pp. 141–153. Springer, Heidelberg (2003)
Letz, R.: Advances in decision procedures for quantified boolean formulas. In: IJCAR (2001)
Li, C.M., Anbulagan: Heuristics based on unit propagation for satisfiability problems. IJCAI 1, 366–371 (1997)
Marques-Silva, J.P., Sakallah, K.A.: Conflict analysis in search algorithms for propositional satisfiability. In: IEEE ICTAI (1996)
McMillan, K.L.: Applying SAT methods in unbounded symbolic model checking. In: Computer Aided Verification (2002)
Moskewicz, M.W., Madigan, C.F., Zhao, Y., Zhang, L., Malik, S.: Chaff: engineering an efficient SAT solver. In: 39th Design Aotomation Conference, DAC 2001 (2001)
Plaisted, D.: Method for design verification of hardware and non-hardware systems. United States Patents, 6,131, 078 (October 2000)
Roth, D.: On the hardness of approximate reasoning. Artificial Intelligence 82(1-2) (1996)
Sapra, S., Theobald, M., Clarke, E.M.: SAT-based algorithms for logic minimization. In: ICCD (2003)
Shtrichman, O.: Tuning SAT checkers for bounded model checking. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855. Springer, Heidelberg (2000)
Berkeley University of California. Espresso, two level boolean minimizer (1990)
Yadgar, A.: Solving All-SAT problem for reachability analysis. M.Sc. thesis, Technion, Israel Institute of Technology, Department of Computer Schience (2004)
Zhang, H.: SATO: An efficient propositional prover. In: McCune, W. (ed.) CADE 1997. LNCS, vol. 1249, Springer, Heidelberg (1997)
Zhang, L., Madigan, C.F., Moskewicz, M.W., Malik, S.: Efficient conflict driven learning in boolean satisfiability solver. In: ICCAD (2001)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2004 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Grumberg, O., Schuster, A., Yadgar, A. (2004). Memory Efficient All-Solutions SAT Solver and Its Application for Reachability Analysis. In: Hu, A.J., Martin, A.K. (eds) Formal Methods in Computer-Aided Design. FMCAD 2004. Lecture Notes in Computer Science, vol 3312. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-30494-4_20
Download citation
DOI: https://doi.org/10.1007/978-3-540-30494-4_20
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-23738-9
Online ISBN: 978-3-540-30494-4
eBook Packages: Springer Book Archive