Yusuke Matsunaga
- 1.A. Aho, J. Hopcroft, and J. Ullman. The Design and Analysis of Computer Algorithms. Addision-Wesley, 1974. Google Scholar
Digital Library
- 2.K. S. Brace, R. L. Rudell, and R. E. Bryant. Efficient implementation of a B DD package. In Design Automation Conference, 1990. Google ScholarDigital Library
- 3.R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Transactions on Computers, 1986. Google ScholarDigital Library
- 4.J. R. Burch, E. M. Clarke, K. L. McMillan, and D. L. Dill. Sequential circuit verification using symbolic model checking. In Design Automation Conference, 1990. Google ScholarDigital Library
- 5.J. R. Burch, E. M. Clarke, K. L. McMillan, D. L. Dill, and J. Hwang. Symbolic model checking: 1020 states and beyond. In Proceedings of the International Symposium on Logic in Computer Science, 1990.Google Scholar
- 6.O. Coudert, C. Berthet, and J. C. Madre. Verification of sequential machines based on symbolic execution. In J. Sifakis, editor, Automatic Verification Methods for Finite State Systems. Springer-Verlag, June 1989. Google ScholarDigital Library
- 7.O. Coudert and J. C. Madre. A unified framework for the formal verification of sequential circuits. In IEEE International Conference on Computer-Aided Design, 1990.Google ScholarCross Ref
- 8.K. Karplus. Representing boolean functions with ifthen-else DAGs. In Decennial CalTech VLSI Conference, 1989.Google Scholar
Index Terms
- On computing the transitive closure of a state transition relation
Recommendations
Boolean matrix multiplication and transitive closure
SWAT '71: Proceedings of the 12th Annual Symposium on Switching and Automata Theory (swat 1971)Arithmetic operations on matrices are applied to the problem of finding the transitive closure of a Boolean matrix. The best transitive closure algorithm known, due to Munro, is based on the matrix multiplication method of Strassen. We show that his ...
Comments