Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions-Reference-Cited by-同舟云学术

Meta-BDDs: A Decomposed Representation for Layered Symbolic Manipulation of Boolean Functions

Published:2001 Issue: Volume: Page:118-130
ISSN:0302-9743
Container-title:Computer Aided Verification
language:
Short-container-title:

Author:

Cabodi Gianpiero

Publisher

Springer Berlin Heidelberg

Link

http://link.springer.com/content/pdf/10.1007/3-540-44585-4_11

Reference15 articles.

1. R. E. Bryant. Graph-Based Algorithms for Boolean Function Manipulation. IEEE Transactions on Computers, C-35(8):677–691, August 1986.

2. R. E. Bryant. Symbolic Boolean Manipulation with Ordered Binary-Decision Diagrams. ACM Computing Surveys, 24(3):293–318, September 1992.

3. R. Rudell. Dynamic Variable Ordering for Ordered Binary Decision Diagrams. In Proc. IEEE/ACM ICCAD’93, pages 42–47, San Jose, California, November 1993.

4. J. Jain, J. Bitner, J. A. Abraham, and D. S. Fussel. Functional Partitioning for Verification and Related Problems. In Brown/MIT VLSI Conference, pages 210–226, March 1992.

5. Lect Notes Comput Sci;K. L. McMillan,1996

Cited by 5 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Benchmarking a model checker for algorithmic improvements and tuning for performance;Formal Methods in System Design;2011-05-31

2. A work-efficient distributed algorithm for reachability analysis;Formal Methods in System Design;2006-07-06

3. Are BDDs still alive within sequential verification?;International Journal on Software Tools for Technology Transfer;2005-01-25

4. A Work-Efficient Distributed Algorithm for Reachability Analysis;Computer Aided Verification;2003

5. Mixing Forward and Backward Traversals in Guided-Prioritized BDD-Based Verification;Computer Aided Verification;2002