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 142 articles )

Showing results 41 to 60 of 142.
Sorted by year (citations)
  1. Ehlers, Rüdiger: Unbeast: symbolic bounded synthesis (2011)
  2. Holík, Lukáš; Lengál, Ondřej; Šimáček, Jiří; Vojnar, Tomáš: Efficient inclusion checking on explicit and semi-symbolic tree automata (2011)
  3. Huang, Xiaowei; Luo, Cheng; van der Meyden, Ron: Improved bounded model checking for a fair branching-time temporal epistemic logic (2011)
  4. Lomuscio, Alessio; Qu, Hongyang; Russo, Francesco: Automatic data-abstraction in model checking multi-agent systems (2011)
  5. Sotin, Pascal; Jeannet, Bertrand: Precise interprocedural analysis in the presence of pointers to the stack (2011)
  6. Wei, Ou; Gurfinkel, Arie; Chechik, Marsha: On the consistency, expressiveness, and precision of partial modeling formalisms (2011)
  7. Basler, Gérard; Mazzucchi, Michele; Wahl, Thomas; Kroening, Daniel: Context-aware counter abstraction (2010)
  8. Bertoli, Piergiorgio; Pistore, Marco; Traverso, Paolo: Automated composition of web services via planning in asynchronous domains (2010) ioport
  9. Berwanger, Dietmar; Chatterjee, Krishnendu; De Wulf, Martin; Doyen, Laurent; Henzinger, Thomas A.: Strategy construction for parity games with imperfect information (2010)
  10. Brickenstein, Michael: Boolean Gröbner bases. Theory, algorithms and applications (2010)
  11. Bugaychenko, D. Yu.; Soloviev, I. P.: Application of multiroot decision diagrams for integer functions (2010)
  12. Ehlers, Rüdiger; Mattmüller, Robert; Peter, Hans-Jörg: Combining symbolic representations for solving timed games (2010)
  13. Gu, Tianlong; Chang, Liang; Xu, Zhoubo: The symbolic OBDD algorithm for maximum cardinality matching in bipartite graphs (2010)
  14. Kwiatkowska, Marta; Lomuscio, Alessio; Qu, Hongyang: Parallel model checking for temporal epistemic logic (2010)
  15. Lampka, Kai; Siegle, Markus; Ossowski, Joern; Baier, Christel: Partially-shared zero-suppressed multi-terminal BDDs: Concept, algorithms and applications (2010)
  16. Wahl, Thomas; D’Silva, Vijay: A lazy approach to symmetry reduction (2010)
  17. Abujarad, Fuad; Kulkarni, Sandeep S.: Weakest invariant generation for automated addition of fault-tolerance (2009)
  18. Beadle, Lawrence; Johnson, Colin G.: Semantic analysis of program initialisation in genetic programming (2009) ioport
  19. Brickenstein, Michael; Dreyer, Alexander: Polybori: A framework for Gröbner-basis computations with Boolean polynomials (2009)
  20. Brickenstein, Michael; Dreyer, Alexander; Greuel, Gert-Martin; Wedler, Markus; Wienand, Oliver: New developments in the theory of Gröbner bases and applications to formal verification (2009)

Further publications can be found at: