CUDD

The CUDD package provides functions to manipulate Binary Decision Diagrams (BDDs) [5,3], Algebraic Decision Diagrams (ADDs) [1], and Zero-suppressed Binary Decision Diagrams (ZDDs) [12]. BDDs are used to represent switching functions; ADDs are used to represent function from to an arbitrary set. ZDDs represent switching functions like BDDs; however, they are much more efficient than BDDs when the functions to be represented are characteristic functions of cube sets, or in general, when the ON-set of the function to be represented is very sparse. They are inferior to BDDs in other cases. The package provides a large set of operations on BDDs, ADDs, and ZDDs, functions to convert BDDs into ADDs or ZDDs and vice versa, and a large assortment of variable reordering methods.


References in zbMATH (referenced in 158 articles )

Showing results 1 to 20 of 158.
Sorted by year (citations)

1 2 3 ... 6 7 8 next

  1. Latour, Anna L. D.; Babaki, Behrouz; Fokkinga, Daniël; Anastacio, Marie; Hoos, Holger H.; Nijssen, Siegfried: Exact stochastic constraint optimisation with applications in network analysis (2022)
  2. Amram, Gal; Maoz, Shahar; Pistiner, Or: GR(1)*: GR(1) specifications extended with existential guarantees (2021)
  3. Azzolini, Damiano; Riguzzi, Fabrizio: Optimizing probabilities in probabilistic logic programs (2021)
  4. Emelyanov, P. G.; Krishna, M.; Kulkarni, V.; Nandy, S. K.; Ponomaryov, D. K.; Raha, S.: Factorization of Boolean polynomials: parallel algorithms and experimental evaluation (2021)
  5. Indrøy, John Petter; Costes, Nicolas; Raddum, Håvard: Boolean polynomials, BDDs and CRHS equations -- connecting the dots with CryptaPath (2021)
  6. Mengel, Stefan; Slivovsky, Friedrich: Proof complexity of symbolic QBF reasoning (2021)
  7. Rumreich, Laine; Sivilotti, Paolo A. G.: Formal verification of a Java component using the RESOLVE framework (2021)
  8. Síč, Juraj; Strejček, Jan: DQBDD: an efficient BDD-based DQBF solver (2021)
  9. Firman, Elizabeth; Maoz, Shahar; Ringert, Jan Oliver: Performance heuristics for GR(1) synthesis and related algorithms (2020)
  10. Jacobs, Swen; Sakr, Mouhammad: A symbolic algorithm for lazy synthesis of eager strategies (2020)
  11. Luttenberger, Michael; Meyer, Philipp J.; Sickert, Salomon: Practical synthesis of reactive systems from LTL specifications via parity games (2020)
  12. Ramana B, Venkata; Chatterjee, Subhashis; Vishwakarma, Gajendra K.: Estimation of network reliability using optimal ROBDD approach. (2020)
  13. Bozzano, Marco; Cimatti, Alessandro; Mattarei, Cristian: Formal reliability analysis of redundancy architectures (2019)
  14. Ramana B., Venkata; Chatterjee, Subhashis; Vishwakarma, Gajendra K.: Estimation of network reliability using optimal ROBDD approach. (2019)
  15. Á. Torralba, Álvaro; López, Carlos Linares; Borrajo, Daniel: Symbolic perimeter abstraction heuristics for cost-optimal planning (2018)
  16. Bloem, Roderick; Chatterjee, Krishnendu; Jobstmann, Barbara: Graph games and reactive synthesis (2018)
  17. Čermák, Petr; Lomuscio, Alessio; Mogavero, Fabio; Murano, Aniello: Practical verification of multi-agent systems against \textscSlkspecifications (2018)
  18. Chaki, Sagar; Gurfinkel, Arie: BDD-based symbolic model checking (2018)
  19. Neto, Sebastiao M.; Zárate, Luis E.; Song, Mark A. J.: Handling high dimensionality contexts in formal concept analysis via binary decision diagrams (2018)
  20. van Benthem, Johan; van Eijck, Jan; Gattinger, Malvin; Su, Kaile: Symbolic model checking for dynamic epistemic logic -- S5 and beyond (2018)

1 2 3 ... 6 7 8 next


Further publications can be found at: http://vlsi.colorado.edu/~fabio/CUDD/node7.html