Skip to main content
SpringerLink
Log in

Advancements in Mixed BDD and SAT Techniques

  • Chapter
Advanced Formal Verification

  • 339 Accesses

Abstract

This chapter covers mutual interactions between Boolean Satisfiability (SAT) solvers and Binary Decision Diagrams (BDDs). More precisely, the presentation is focused on approaches mixing methodologies, techniques, and ideas coming from both research domains. First of all, it gives some preliminary definitions and it presents the main differences and affinities between SAT and BDD manipulation algorithms. After that, it overviews some of the most notable efforts to integrate the two technologies either in a loose or in a tight way. It eventually provides some evaluations and hints for open problems and possible future work.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 109.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. P. A. Abdulla, P. Bjesse, and N. Eéen. Symbolic Reachability Analysis based on SAT-Solvers. In TACAS 2000 — Tools and Algorithms for the Construction and Analysis of Systems, 2000.

    Google Scholar 

  2. F. A. Aloul, I. L. Markov, and K. A. Sakallah. Faster SAT and Smaller BDDs via Common Function Structure. In Proc. Inťl Conf. on Computer-Aided Design, San Jose, California, November 2001.

    Google Scholar 

  3. F. A. Aloul, I. L. Markov, and K. A. Sakallah. MINCE: A Static Global Variable-Ordering for SAT and BDD. In Proc. Inťl Workshop on Logic Synthesis, Lake Tahoe, California, May 2001.

    Google Scholar 

  4. F. A. Aloul, M. N. Mneimneh, and K. A. Sakallah. Backtrack Search Using ZBDDs. In Proc. Inťl Workshop on Logic Synthesis, Lake Tahoe, California, May 2001.

    Google Scholar 

  5. F. A. Aloul, M. N. Mneimneh, and K. A. Sakallah. ZBDD-Based Backtrack Search SAT Solver. In Proc. Inťl Workshop on Logic Synthesis, Lake Tahoe, California, May 2002.

    Google Scholar 

  6. J. Bern, C. Meinel, and A. Slobodová. Some Heuristics for Generating Tree-like FBDD Types. IEEE Transactions on CAD, 15(1):127–131, January 1996.

    Google Scholar 

  7. A. Biere, A. Cimatti, E. M. Clarke, M. Fujita, and Y. Zhu. Symbolic Model Checking using SAT procedures instead of BDDs. In Proc. 36th Design Automat. Conf., pages 317–320, New Orleans, Louisiana, June 1999.

    Google Scholar 

  8. P. Bjesse, T. Leonard, and A. Mokkedem. Finding Bugs in an Alpha Microprocessor Using Satisfiability Solvers. In Gérard Berry, Hubert Comon, and Alan Finkel, editors, Proc. Computer Aided Verification, Volume 2102 of LNCS, pages 454–464, Paris, France, July 2001. Springer-Verlag.

    Google Scholar 

  9. R. E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677–691, August 1986.

    Google Scholar 

  10. J. R. Burch, E. M. Clarke, D. E. Long, K. L. McMillan, and D. L. Dill. Symbolic Model Checking for Sequential Circuit Verification. IEEE Transactions on CAD, 13(4):401–424, April 1994.

    Google Scholar 

  11. G. Cabodi, P. Camurati, and S. Quer. Can BDDs compete with SAT solvers on Bounded Model Checking? In Proc. 39th Design Automat. Conf., New Orleans, Louisiana, June 2002.

    Google Scholar 

  12. G. Cabodi, S. Nocco, and S. Quer. Improving SAT-based Bounded Model Checking by Means of BDD-based Approximate Traversals. In Proc. Design Automation & Test in Europe Conf., pages 898–903, Munich, Germany, March 2003.

    Google Scholar 

  13. P. Chatalic and L. Simon. ZRes: the old DP meets ZBDDs. In Proc. 17th Conf. of Autom. Deduction (CADE), 2000.

    Google Scholar 

  14. H. Cho, G. D. Hatchel, E. Macii, B. Plessier, and F. Somenzi. Algorithms for Approximate FSM Traversal Based on State Space Decomposition. IEEE Transactions on CAD, 15(12):1465–1478, December 1996.

    Google Scholar 

  15. A. Cimatti, E. M. Clarke, F. Giunchiglia, and M. Roveri. NuSMV: a new Symbolic Model Verifyer. In Proc. Computer Aided Verification, volume 1633 of LNCS, pages 495–499. Springer-Verlag, July 1999.

    Google Scholar 

  16. F. Copty, L. Fix, R. Fraer, E. Giunchiglia, G. Kamhi, A. Tacchella, and M. Y. Vardi. Benefits of Bounded Model Checking at an Industrial Setting. In Gérard Berry, Hubert Comon, and Alan Finkel, editors, Proc. Computer Aided Verification, volume 2102 of LNCS, pages 435–453, Paris, France, July 2001. Springer-Verlag.

    Google Scholar 

  17. M. Davis, G. Logemann, and D. Loveland. A Machine Procedure for Theorem-Proving. Journal of the ACM, 5:394–397, 1962.

    MathSciNet  Google Scholar 

  18. M. Davis and H. Putnam. A Computing Procedure for Quantification Theory. Journal of the ACM, 7:201–215, 1960.

    Article  MathSciNet  Google Scholar 

  19. E. Goldberg and Y. Novikov. BerkMin: a Fast and Robust SAT-Solver. In Proc. Design Automation & Test in Europe Conf., pages 142–149, Paris, France, February 2002.

    Google Scholar 

  20. S. G. Govindaraju, D. L. Dill, A. Hu, and M. A. Horowitz. Approximate Reachability Analysis with BDDs using Overlapping Projections. In Proc. 35th Design Automat. Conf., pages 451–456, San Francisco, California, June 1998.

    Google Scholar 

  21. J. F. Groote and F. Zantema. Resolution and binary decision diagrams cannot simulate each others polynomially. Technical report, Utrecht University, 2000.

    Google Scholar 

  22. A. Gupta, Z. Yang, P. Ashar, and A. Gupta. SAT-Based Image Computation with Application in Reachability Analysis. In Proc. Formal Methods in Computer-Aided Design, volume 1954 of LNCS, Austin, TX, USA, 2000.

    Google Scholar 

  23. A. Gupta, Z. Yang, P. Ashar, L. Zhang, and S. Malik. Partition-Based Decision Heuristic for Image Computation using SAT and BDDs. In Proc. Inťl Conf. on Computer-Aided Design, San Jose, California, November 2001.

    Google Scholar 

  24. H. Hulgaard, P. F. Williams, and H. R. Andersen. Equivalence checking of combinational circuits using boolean expression diagrams. IEEE Transactions on CAD, July 1999.

    Google Scholar 

  25. A. Kuehlmann, M. K. Ganai, and V. Paruthi. Circuit-based Boolean Reasoning. In Proc. Design Automat. Conf., Las Vegas, Nevada, June 2001.

    Google Scholar 

  26. A. Kuehlmann and F. Krohm. Equivalence Checking Using Cuts and Heaps. In Proc. 34th Design Automat. Conf., pages 263–268, Anaheim, California, June 1997.

    Google Scholar 

  27. J. P. Marques-Silva and K. A. Sakallah. GRASP — A New Search Algorithm for Satisfiability. In Inťl Conference on Tool with Artificial Intellingence, 1996.

    Google Scholar 

  28. K. McMillan. Symbolic Model Checking. Kluwer Academic, Boston, Massechusset, 1994.

    Google Scholar 

  29. K. L. McMillan. Applying SAT Methods in Unbounded Symbolic Model Checking. In Ed Brinksma and Kim Guldstrand Larsen, editors, Proc. Computer Aided Verification, volume 2404 of LNCS, pages 250–264, Cophenagen, Denmark, 2002.

    Google Scholar 

  30. S. I. Minato. Zero-Suppressed BDDs for Set Manipulation in Combinational Problems. In Proc. 30th Design Automat. Conf., pages 272–277, Dallas, Texas, June 1993.

    Google Scholar 

  31. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an Efficient SAT Solver. In Proc. 38th Design Automat. Conf., Las Vegas, Nevada, June 2001.

    Google Scholar 

  32. D. B. Motter and I. L. Markov. A Compressed Breadth-First Search for Satisfiability. 2002.

    Google Scholar 

  33. M. Prasad, P. Chong, and K. Keutzer. Why is ATPG easy? In Proc. 36th Design Automat. Conf., pages 22–28, New Orleans, Louisiana, June 1999.

    Google Scholar 

  34. S. Reda, R. Drechsler, and A. Orailoglu. On the Relation between SAT and BDDs for equivalence checking. Inťl Symposium on Quality of Electronic Design (ISQED), pages 394–399, 2002.

    Google Scholar 

  35. S. Sheng and M. Hsiao. Effcient Preimage Computation Using A Novel Success-Driven ATPG. In Proc. Design Automation & Test in Europe Conf., pages 822–827, Munich, Germany, March 2003.

    Google Scholar 

  36. T. E. Uribe and M. E. Stickel. Ordered binary decision diagrams and the Davis-Putnam procedure. In ICCCL, volume 845 of LNCS, pages 34–49. Springer-Verlag, 1994.

    Google Scholar 

  37. P. F. Williams, H. R. Andersem, and H. Hulgaard. Satisfiability Checking Using Boolean Expression Diagrams. In TACAS 2001 — Tools and Algorithms for the Construction and Analysis of Systems, IT University of Copenhagen, April 2001.

    Google Scholar 

  38. P. F. Williams, A. Biere, E. M. Clarke, and A. Gupta. Combining Decision Diagrams and SAT Procedures for Effcient Symbolic Model Checking. In E. Allen Emerson and A. Prasad Sistla, editors, Proc. Computer Aided Verification, volume 2102 of LNCS, pages 124–138, Chicago, Illinois, July 2000. Springer-Verlag.

    Google Scholar 

  39. L. Zhang and S. Malik. The Quest for Effcient Boolean Satisfiability Solvers. In Ed Brinksma and Kim Guldstrand Larsen, editors, Proc. Computer Aided Verification, volume 2404 of LNCS, pages 17–36, Cophenagen, Denmark, 2002.

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Dip. di Automatica e Informatica, Politecnico di Torino, Turin, Italy

    Gianpiero Cabodi & Stefano Quer

Authors
  1. Gianpiero Cabodi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Stefano Quer
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Bremen, Germany

    Rolf Drechsler

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Kluwer Academic Publishers

About this chapter

Cite this chapter

Cabodi, G., Quer, S. (2004). Advancements in Mixed BDD and SAT Techniques. In: Drechsler, R. (eds) Advanced Formal Verification. Springer, Boston, MA. https://doi.org/10.1007/1-4020-2530-0_2

Download citation

  • DOI: https://doi.org/10.1007/1-4020-2530-0_2

  • Publisher Name: Springer, Boston, MA

  • Print ISBN: 978-1-4020-7721-0

  • Online ISBN: 978-1-4020-2530-3

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation