An efficient observability evaluation algorithm based on Factored Use-Def chains

Proceedings of the Asian Test Symposium

Volumn 2003-January, Issue , 2003, Pages 161-166

  Lv, Tao ^a   Fan, Jianping ^a   Li, Xiaowei ^a  

^a INSTITUTE OF GEOLOGY AND GEOPHYSICS   (China)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; CHAINS; DATA FLOW ANALYSIS; OBSERVABILITY; PROGRAM COMPILERS;

COMPUTATIONALLY EFFICIENT; EVALUATION ALGORITHM; EVENT-DRIVEN; STATEMENT COVERAGE; USE-DEF CHAINS;

COMPUTER HARDWARE DESCRIPTION LANGUAGES;

EID: 31344434639     PISSN: 10817735     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ATS.2003.1250803     Document Type: Conference Paper

References (5)

1. F. Fallah, S. Devadas, and K. Keutzer, "OCCOM - Efficient Computation of Observability-Based Code Coverage Metrics for Functional Verification", IEEE Transactions on Computer-Aided Design of Integrated Circuits and Systems, Vol.20 (No.8), August 2001, pp.1003-1015.
2. S. Devadas, A. Ghosh, and K. Keutzer, "Observability-based code coverage metric for functional simulation", ICCAD, November 1996, pp. 418-425.
3. F. Corno, M. Sonza Reorda, G. Squillero, "High-Level Observability for Effective High-Level ATPG", Proc. 18th IEEE VLSI Test Symposium, Montreal, May 2000, pp.411-416.
4. Michael Wolfe, High Performance Compilers for Parallel Computing, Addison-Wesley Publishing Company, Redwood City, 1996.
5. Qiushuang Zhang, and Ian G. Harris, "A Data Flow Fault Coverage Metric for Validation of Behavioral HDL Descriptions", ICCAD, November 2000, pp.369-372.