Functional dependency for verification reduction

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 3114, Issue , 2004, Pages 268-280

  Jiang, Jie Hong R ^a   Brayton, Robert K ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER AIDED ANALYSIS;

FUNCTIONAL DEPENDENCY; REACHABILITY ANALYSIS; REACHABLE STATE SET; STATE TRANSITION SYSTEMS; STATE VARIABLES; SUBSTANTIAL REDUCTION; TRANSITION FUNCTIONS; TRANSITION SYSTEM;

FORMAL VERIFICATION;

EID: 35048820104     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27813-9_21     Document Type: Article

References (18)

1. P. Ashar, A. Gupta, and S. Malik. Using complete-1-distinguishability for FSM equivalence checking. In Proc. ICCAD, pages 346-353, 1996.
2. C. Berthet, O. Coudert, and J.-C. Madre. New ideas on symbolic manipulations of finite state machines. In Proc. ICCD, pages 224-227, 1990.
3. P. Bjesse and K. Claessen. SAT-based verification without state space traversal. In Proc. FMCAD, pages 372-389, 2000.
4. R. K. Brayton, et al. VIS: a system for verification and synthesis. In Proc. CAV, pages 428-432, 1996.
5. F. M. Brown. Boolean Reasoning: The Logic of Boolean Equations. Dover Publications, 2003.
6. R. E. Bryant. Graph-based algorithms for Boolean function manipulation. IEEE Trans. Computers, pages 677-691, August 1986.
7. E. M. Clarke, O. Grumberg, and D. A. Peled. Model Checking. MIT Press, 1999.
8. C. A. J. van Eijk and J. A. G. Jess. Exploiting functional dependencies in finite state machine verification. In Proc. European Design & Test Conf., pages 9-14, 1996.
9. C. A. J. van Eijk. Sequential equivalence checking based on structural similarities. IEEE Trans. Computer-Aided Design, pages 814-819, July 2000.
10. T. Filkorn. Symbolische methoden für die verifikation endlicher zustandssysteme. Ph.D. thesis. Institut für Informatik der Technischen Universität München, 1992.
11. A. J. Hu and D. L. Dill. Reducing BDD size by exploiting functional dependencies. In Proc. DAC, pages 266-271, 1993.
12. R. P. Kurshan. Computer-Aided Verification of Coordinating Processes. Princeton University Press, 1994.
13. B. Lin and A. R. Newton. Exact redundant state registers removal based on binary decision diagrams. In Proc. Int'l Conf. VLSI, pages 277-286, 1991.
14. C. E. Leiserson and J. B. Saxe. Optimizing synchronous systems. J. VLSI Computer Syst., vol. 1, no. 1, pp. 41-67, 1983.
15. E. Marczewski. Independence in algebras of sets and Boolean algebra. Fundamenta Mathematicae, vol. 48, pages 135-145, 1960.
16. S. Quer, G. Cabodi, P. Camurati, L. Lavagno, and R. Brayton. Verification of similar FSMs by mixing incremental re-encoding, reachability analysis, and combinational check. Formal Methods in System Design, vol. 17, pages 107-134, 2000.
17. E. Sentovich, H. Toma, and G. Berry. Latch optimization in circuits generated from high-level descriptions. In Proc. ICCAD, pages 428-435, 1996.
18. D. Stoffel and W. Kunz. Record & play: A structural fixed point iteration for sequential circuit verification. In Proc. ICCAD, pages 394-399, 1997.