GLOBAL: A design for random testability algorithm

DOI10.1007/BF02939500MaRDI QIDQ1331229zbMATH OpenFDO

Authors Dong Xiang, Daozheng Wei

Publication date 4 April 1995

Published in Journal of Computer Science and Technology (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BF02939500

zbMATH Keywords

branch \& bound algorithmglobal designtestability algorithm

Mathematics Subject Classification ID

Specification and verification (program logics, model checking, etc.) (68Q60) Fault detection; testing in circuits and networks (94C12)

Recommendations

• Design of testability for analogue fault diagnosis
• Design of universal test sequences for VLSI
• INCREDYBLE: A new search strategy for design automation problems with applications to testing
• Methods of testability analysis for digital logic
• scientific article; zbMATH DE number 4187723

Cites work

• On Random Pattern Test Length

Cited in

(2)

• A fast method for identifying global feedback lines
• Test generation with dynamic probe points in high observability testing environment

This page was built for publication: GLOBAL: A design for random testability algorithm

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1331229)