EDP Sciences logo
Subscriber Authentication Point
Search
Menu
All issues Volume 33 / No 1 (January Fabruary 1999) RAIRO-Theor. Inf. Appl., 33 1 (1999) 21-31 References
Issue
RAIRO-Theor. Inf. Appl.
Volume 33, Number 1, January Fabruary 1999
Page(s) 21 - 31
DOI https://doi.org/10.1051/ita:1999103
Published online 15 August 2002
  1. A. Aziz, S. Taziran and R.K. Brayton, BDD variable ordering for interacting finite state machines, in Proc. 31st ACM/IEEE Design Automation Conference (San Diego, CA, 1994) 283-288. [Google Scholar]
  2. J. Bern, Ch. Meinel and A. Slobodová, Global rebuilding of OBDDs - avoiding memory requirement maxima, in Proc. Computer-Aided Verification, Springer, Berlin, Lecture Notes in Computer Science 939 (1995) 4-15. [Google Scholar]
  3. B. Bollig and I. Wegener, Improving the variable ordering of OBDDs is NP-complete. IEEE Trans. Comput. 45 (1996) 993-1002. [CrossRef] [Google Scholar]
  4. R.E. Bryant, Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C-35 (1986) 677-691. [Google Scholar]
  5. R.E. Bryant, Symbolic Boolean manipulation with ordered binary decision diagrams. ACM Computing Surveys 24 (1992) 293-318. [CrossRef] [Google Scholar]
  6. J.R. Burch, E.M. Clarke, D.E. Long, K.L. McMillan and D.L. Dill, Symbolic model checking for sequential circuit verification. IEEE Trans. Computer-Aided Design of Integrated Circuits 13 (1994) 401-424. [CrossRef] [Google Scholar]
  7. O. Coudert, C. Berthet and J. C. Madre, Verification of synchronous sequential machines using symbolic execution, in Proc. Workshop on Automatic Verification Methods for Finite State Machines, Springer, Berlin, Lecture Notes in Computer Science 407 (1989) 365-373. [Google Scholar]
  8. O. Coudert and J. C. Madre, The implicit set paradigm: a new approach to finite state system verification. Formal Methods in System Design 6 (1995) 133-145. [CrossRef] [Google Scholar]
  9. A. Ghosh, S. Devadas and A. R. Newton, Sequential logic testing and verification, Kluwer Academic Publishers, Boston, MA (1992). [Google Scholar]
  10. R.W. Hamming, Coding and information theory, Prentice-Hall, Englewood Cliffs, NJ (1980). [Google Scholar]
  11. Ch. Meinel and A. Slobodová, On the complexity of constructing optimal ordered binary decision diagrams, in Proc. Mathematical Foundations in Computer Science, Springer, Berlin, Lecture Notes in Computer Science 841 (1994) 515-524. [Google Scholar]
  12. Ch. Meinel, F. Somenzi and T. Theobald, Linear sifting of decision diagrams, in Proc. 34th ACM/IEEE Design Automation Conference (Anaheim, CA, 1997) 202-207. [Google Scholar]
  13. Ch. Meinel and T. Theobald, Local encoding transformations for optimizing OBDD-representations of finite state machines, in Proc. International Conference on Formal Methods in Computer-Aided Design (Palo Alto, CA), Springer, Berlin, Lecture Notes in Computer Science 1166 (1996) 404-418. [CrossRef] [Google Scholar]
  14. R. Rudell, Dynamic variable ordering for ordered binary decision diagrams, in Proc. IEEE International Conference on Computer-Aided Design (Santa Clara, CA, 1993) 42-47. [Google Scholar]
  15. S. Tani, K. Hamaguchi and S. Yajima, The complexity of the optimal variable ordering problems of shared binary decision diagrams, in Proc. International Symposium on Algorithms and Computation, Springer, Berlin, Lecture Notes in Computer Science 762 (1993) 389-398. [Google Scholar]
  16. I. Wegener, Efficient data structures for Boolean functions. Discrete Math. 136 (1994) 347-372. [CrossRef] [MathSciNet] [Google Scholar]

Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.

Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.

Initial download of the metrics may take a while.