A Theory and Implementation of Sequential Hardware Equivalence

IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems

Volumn 11, Issue 12, 1992, Pages 1469-1478

  Pixley, Carl ^a  

^a Microelectronics Computer Technology Corporation   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0000318151     PISSN: 02780070     EISSN: 19374151     Source Type: Journal    
DOI: 10.1109/43.180261     Document Type: Article

References (16)

1. C. Pixley, “A computation theory and implementation of sequential hardware equivalence,” in Proc. DIMACS Workshop on Computer-Aided Verification ’90, Providence, RI, 1991, pp. 293–320.
2. O. Coudert, C. Berthet, and J. C. Madre, “Verification of sequential machines using Boolean functional vectors,” in Proc. IMEC-IFIP Int. Workshop on Applied Formal Methods for Correct VLSI Design, Nov.
3. R. E. Bryant, “Graph-based algorithms for Boolean function manip-ulation,” IEEE Trans. Computers, vol. C-35, Aug. 1986.
4. C. Pixley, G. Beihl, and E. Pacas-Skewes, “Automatic derivation of FSM specification to implementation encoding,” in Proc. ICCD '91, pp. 245–249.
5. R. E. Bryant, “Can a simulator verify a circuit?” in Formal Aspects of VLSI Design, G. J. Milne et al. Eds. Amsterdam, the Nether-lands: North-Holland, 1986.
6. J. E. Hopcroft and J. D. Ullman, Introduction to Automata Theory, Languages and Computation. Reading, MA: Addison-Wesley, 1979.
7. M. Fujita, H. Fujisawa, and N. Kawato, “Evaluation and improvements of Boolean comparison method based on binary decision diagrams,” in Proc. ICCAD '88, pp. 2–5.
8. S. Malik, A. R. Wang, R. K. Brayton, and A. Sangiovanni-Vincen-telli, “Logic verification using binary decision diagrams in a logic synthesis environment, ” in Proc. ICCAD '88, pp. 6–9.
9. S.-W. Jeong, B. Plessier, G. D. Hachtel, and F. Somenzi, “Variable ordering on FSM traversal,” presented at the Proc. International Workshop on Logic Synthesis, Research Triangle Park, NC, May 1991.
10. S. Devadas, H.-K. T. Ma, and A. R. Newton, “On the verification of sequential machines at differing levels of abstraction,” in 24th ACM/IEEE Design Automation Conf., 1987, pp. 271–276.
11. E. M. Clarke, E. A. Emerson, and A. P. Sistla, “Automatic verification of finite state concurrent systems using temporal logic specifications: A practical approach,” in Proc. 10th Symp. on Principles of Programming Languages, Austin, TX, Jan. 1983, pp. 117–126.
12. K.-T. Cheng and V. D. Agrawal, “State assignment for initializable synthesis,” in Dig. Tech. Papers, ICCAD-89, pp. 212–215.
13. S. Bose and A. L. Fisher, “Automatic verification of synchronous circuits using symbolic logic simulation and temporal logic,” in Proc. IMEC-1FIP Int. Workshop on Applied Formal Methods for Correct VLSI Design, Nov. 13–16, 1989.
14. K. Brace, R. Rudell, and R. Bryant, “Efficient implementation of a BDD package,” in Proc. 27th ACM/IEEE Design Automation Conf, June 1990, 40–45.
15. H. Cho, G. Hachtel, S.-W. Jeong, B. Plessier, E. Schwartz, and F. Somenzi, “ATPG aspects of FSM verification,” in Proc. DIMACS Workshop on Computer-Aided Verification, June 18–21, 1990.
16. H. Touati, H. Savoj, B. Lin, R. Brayton, and A. Sangiovanni-Vin-centelli, “Implicit state enumeration of finite state machines using BDD’s,” in Proc. ICCAD ’90, pp. 130–133.