Probabilistic verification of Boolean functions
- 1 July 1992
- journal article
- Published by Springer Nature in Formal Methods in System Design
- Vol. 1 (1), 61-115
- https://doi.org/10.1007/bf00464357
Abstract
No abstract availableKeywords
This publication has 16 references indexed in Scilit:
- Evaluation and improvement of Boolean comparison method based on binary decision diagramsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2003
- Tautology checking using cross-controllability and cross-observability relationsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the complexity of VLSI implementations and graph representations of Boolean functions with application to integer multiplicationIEEE Transactions on Computers, 1991
- Efficient implementation of a BDD packagePublished by Association for Computing Machinery (ACM) ,1990
- Sequential circuit verification using symbolic model checkingPublished by Association for Computing Machinery (ACM) ,1990
- Formal verification of hardware correctness: introduction and survey of current researchComputer, 1988
- Graph-Based Algorithms for Boolean Function ManipulationIEEE Transactions on Computers, 1986
- Equivalence of free boolean graphs can be decided probabilistically in polynomial timeInformation Processing Letters, 1980
- Binary Decision DiagramsIEEE Transactions on Computers, 1978
- Representation of Switching Circuits by Binary-Decision ProgramsBell System Technical Journal, 1959