Hiroyuki Ochi
- 1.S. B. Akers: "Binary Decision Diagrams", IEEE Trans. Comput., vol. C-27, no. 6, pp. 509-516, (June 1978).Google Scholar
- 2.R. E. Bryant: "Graph-Based Algorithms for Boolean Function Manipulation", IEEE Trans. Comput., vol. C-35, no. 8, pp. 677-691, (Aug. 1985). Google ScholarDigital Library
- 3.S. Minato, N. Ishiura and S. Yajima: "Shared Binary Decision Diagram with Attributed Edges for Efficient Boolean Function Manipulation", Proc. 27th ACM/IEEE DAC, pp. 52-57, (June 1990). Google ScholarDigital Library
- 4.K. S. Brace, R. L. Rudell and R. E. Bryant: "Efficient Implementation of a BDD Package", Proc. 27th ACM/IEEE DAC, pp. 40-45, (June 1990). Google ScholarDigital Library
- 5.S. Kimura and E. M. Clarke: "A Parallel Algorithm for Constructing Binary Decision Diagrams", Proc. IEEE ICCD'90, (Sep. 1990).Google ScholarCross Ref
- 6.H. Ochi, N. Ishiura and S. Yajima: "Breadth-First Manipulation of SBDD of Boolean Functions for Vector Proce~sin6", Proc. 28th ACM/IEEE DAC, pp. 413-416, (June 1991). Google ScholarDigital Library
- 7.H. Ochi, N. Ishiura and S. Yajima: "A Vector Algorithm for Manipulating Boolean Functions Based on Shared Binary Decision Diagrams", Supercomputer 46, vol. VIII, no. 6, pp. 101-118, ASFRA, (Nov. 1991).Google Scholar
- 8.J. Cohen: "Garbage Collection of Linked Data Structure", Computing Surveys, vol. 13, no. 3, pp. 341-367, (Sep. 1981). Google ScholarDigital Library
Recommendations
Breadth-first heuristic search
Recent work shows that the memory requirements of A* and related graph-search algorithms can be reduced substantially by only storing nodes that are on or near the search frontier, using special techniques to prevent node regeneration, and recovering ...
Lazy Decision Diagrams for Word-Level Model Manipulation in Software Verification
TASE '10: Proceedings of the 2010 4th IEEE International Symposium on Theoretical Aspects of Software EngineeringWord-level predicates involve high-level descriptions of integer variables and can be complex to represent and manipulate with traditional decision diagrams like BDDs (binary decision diagrams) and MDDs (multiple-valued decision diagrams). We propose a ...
Timed binary decision diagrams
ICCD '97: Proceedings of the 1997 International Conference on Computer Design (ICCD '97)The paper presents an extension to OBDDs with timing information, called timed binary decision diagrams (TBDDs). TBDDs are also canonical and allow the symbolic manipulation of Boolean functions with timing information. A TBDD software package is ...
Comments