VisBDD - A Web-based Visualization Framework for OBDD Algorithms

CT presents a web-based visualization framework nded for learning and understanding basic algorithms rdered Binary Decision Diagrams (OBDDs). With key algorithm for OBDD-synthesis, the ITEn be explored in depth and step-by-step by the user, lved data structures can be made visible at different traction. The framework is intended as well as for lso for professionals, who want to gain more insight erful OBDD data structure that is used in many nd synthesis tools, for a better understanding of the echanisms and the problem complexity, without ent on reading textbooks.

[1]  Stefan Höreth.  A word-level graph manipulation package , 2001, International Journal on Software Tools for Technology Transfer.

[2]  Randal E. Bryant,et al.  Efficient implementation of a BDD package , 1991, DAC '90.

[3]  C. Y. Lee.  Representation of switching circuits by binary-decision programs , 1959 .

[4]  Christoph Meinel,et al.  Algorithms and Data Structures in VLSI Design: OBDD - Foundations and Applications , 2012 .

[5]  Fabio Somenzi,et al.  Efficient manipulation of decision diagrams , 2001, International Journal on Software Tools for Technology Transfer.

[6]  J.T. Stasko,et al.  Tango: a framework and system for algorithm animation , 1990, Computer.

[7]  Olivier Coudert,et al.  Verification of Synchronous Sequential Machines Based on Symbolic Execution , 1989, Automatic Verification Methods for Finite State Systems.

[8]  Randal E. Bryant,et al.  Graph-Based Algorithms for Boolean Function Manipulation , 1986, IEEE Transactions on Computers.

[9]  Robert Sedgewick,et al.  A system for algorithm animation , 1984, SIGGRAPH.

[10]  R. Rudell.  Dynamic variable ordering for ordered binary decision diagrams , 1993, Proceedings of 1993 International Conference on Computer Aided Design (ICCAD).

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