Symbolic Model Checking using Zero-suppressed Decision Diagrams

[1]  Shin-ichi Minato.  Calculation of Unate Cube Set Algebra Using Zero-Suppressed BDDs , 1994, 31st Design Automation Conference.

[2]  S. Minato.  Implicit manipulation of polynomials using zero-suppressed BDDs , 1995, Proceedings the European Design and Test Conference. ED&TC 1995.

[3]  Jaco van de Pol,et al.  1 Motivation : A Modular , High-Performance Model Checker , 2010 .

[4]  Olivier Coudert,et al.  Implicit and incremental computation of primes and essential primes of Boolean functions , 1992, [1992] Proceedings 29th ACM/IEEE Design Automation Conference.

[5]  Kenneth L. McMillan,et al.  Symbolic model checking: an approach to the state explosion problem , 1992 .

[6]  Jørn Lind-Nielsen,et al.  BuDDy : A binary decision diagram package. , 1999 .

[7]  Olivier Coudert,et al.  Exact multi-layer topological planar routing , 1996, Proceedings of Custom Integrated Circuits Conference.

[8]  Shinya Ishihara,et al.  Manipulation of regular expressions under length constraints using zero-suppressed-BDDs , 1995, ASP-DAC '95.

[9]  Giovanni De Micheli,et al.  Finding all simple disjunctive decompositions using irredundant sum-of-products forms , 1998, ICCAD '98.

[10]  Shin-ichi Minato,et al.  Zero-suppressed BDDs and their applications , 2001, International Journal on Software Tools for Technology Transfer.

[11]  Alfons Laarman,et al.  Multi-Core BDD Operations for Symbolic Reachability , 2013, Electron. Notes Theor. Comput. Sci..

[12]  Rolf Drechsler,et al.  Binary decision diagrams in theory and practice , 2001, International Journal on Software Tools for Technology Transfer.

[13]  Olivier Coudert,et al.  Exact dichotomy-based constrained encoding , 1996, Proceedings International Conference on Computer Design. VLSI in Computers and Processors.

[14]  Olivier Coudert,et al.  Two-level logic minimization: an overview , 1994, Integr..

[15]  Olivier Coudert.  A new paradigm for dichotomy-based constrained encoding , 1998, Proceedings Design, Automation and Test in Europe.

[16]  Shin-ichi Minato,et al.  Zero-Suppressed BDDs for Set Manipulation in Combinatorial Problems , 1993, 30th ACM/IEEE Design Automation Conference.

[17]  Tomohiro Yoneda,et al.  Partial Order Reduction in Symbolic State Space Traversal Using ZBDDs , 1999 .

[18]  Sheldon B. Akers,et al.  Binary Decision Diagrams , 1978, IEEE Transactions on Computers.

[19]  Olivier Coudert,et al.  Solving graph optimization problems with ZBDDs , 1997, Proceedings European Design and Test Conference. ED & TC 97.

[20]  Tom van Dijk,et al.  The parallelization of binary decision diagram operations for model checking , 2012 .

[21]  Randal E. Bryant,et al.  Symbolic Boolean manipulation with ordered binary-decision diagrams , 1992, CSUR.

[22]  Luca Benini,et al.  Decision Diagrams and Pass Transistor Logic Synthesis , 1997 .

[23]  Tomohiro Yoneda,et al.  BDDs vs. Zero-Suppressed BDDs: for CTL Symbolic Model Checking of Petri Nets , 1996, FMCAD.

[24]  Radek Pelánek,et al.  BEEM: Benchmarks for Explicit Model Checkers , 2007, SPIN.

[25]  R. I. Bahar,et al.  Algebraic decision diagrams and their applications , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).