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

Showing results 121 to 140 of 148.
Sorted by year (citations)

previous 1 2 3 ... 5 6 7 8 next

  1. Coarfa, Cristian; Demopoulos, Demetrios D.; San Miguel Aguirre, Alfonso; Subramanian, Devika; Vardi, Moshe Y.: Random 3-SAT: The plot thickens (2003)
  2. Gentilini, Raffaella; Piazza, Carla; Policriti, Alberto: Computing strongly connected components in a linear number of symbolic steps (2003)
  3. Hermanns, Holger; Kwiatkowska, Marta; Norman, Gethin; Parker, David; Siegle, Markus: On the use of MTBDDs for performability analysis and verification of stochastic systems. (2003)
  4. Kim, Kee-Eung; Dean, Thomas: Solving factored MDPs using non-homogeneous partitions (2003)
  5. Viamontes, George F.; Markov, Igor L.; Hayes, John P.: Improving gate-level simulation of quantum circuits (2003)
  6. Berghammer, Rudolf; Leoniuk, Barbara; Milanese, Ulf: Implementation of relational algebra using binary decision diagrams (2002)
  7. Chakrabarti, Arindam; de Alfaro, Luca; Henzinger, Thomas A.; Jurdzinski, Marcin; Mang, Freddy Y. C.: Interface compatibility checking for software modules (2002)
  8. Cimatti, Alessandro; Giunchiglia, Enrico; Pistore, Marco; Roveri, Marco; Sebastiani, Roberto; Tacchella, Armando: Integrating BDD-based and SAT-based symbolic model checking (2002)
  9. Dovier, A.; Gentilini, R.; Piazza, C.; Policriti, A.: Rank-based symbolic bisimulation: (and model checking) (2002)
  10. Kwiatkowska, Marta; Norman, Gethin; Parker, David: PRISM: Probabilistic symbolic model checker (2002)
  11. Motter, DoRon B.; Markov, Igor L.: A compressed breadth-first search for satisfiability (2002)
  12. Delzanno, Giorgio; Bultan, Tevfik: Constraint-based verification of client-server protocols (2001)
  13. Gröpl, Clemens; Prömel, Hans Jürgen; Srivastav, Anand: On the evolution of the worst-case OBDD size (2001)
  14. Katoen, Joost-Pieter; Kwiatkowska, Marta; Norman, Gethin; Parker, David: Faster and symbolic CTMC model checking (2001)
  15. Kuehlmann, Andreas; Baumgartner, Jason: Transformation-based verification using generalized retiming (2001)
  16. Kwiatkowska, Marta; Norman, Gethin; Segala, Roberto: Automated verification of a randomized distributed consensus protocol using cadence SMV and PRISM (2001)
  17. San Miguel Aguirre, Alfonso; Vardi, Moshe Y.: Random 3-SAT and BDDs: The plot thickens further (2001)
  18. Somenzi, Fabio: Efficient manipulation of decision diagrams (2001)
  19. Velev, Miroslav N.; Bryant, Randal E.: EVC: A validity checker for the logic of equality with uninterpreted functions and memories, exploiting positive equality, and conservative transformations (2001)
  20. Williams, Poul Frederick: Formal verification based on Boolean expression diagrams (2001)

previous 1 2 3 ... 5 6 7 8 next

Further publications can be found at: