By Topic

Test Database Analysis - Inferences from a Disposition Tree

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

6 Author(s)

Test program (TP) is designed to have a few properties including test coverage, test flow and test condition specification. At present, these properties are adjusted based on expert experiences and some statistical tools. Heavy reliance on experts' opinions and gathered experiences on improving testing efficiency can be reduced if the structure of the test flow is well understood. This paper suggests a way to perform inferences in a very large and complex test database in order to assist test engineers to improve testing efficiency. The TP complexity can be reduced by incorporating (i) expert rules, (ii) test results, and (iii) heuristics to the database. We propose to perform inferences on constructed trees i.e. source tree and disposition tree (DispTree) by counting path frequency and to provide insights for test engineers to identify redundant and misplaced test in a test flow. The proposed approach is evaluated on a considerably huge and complex TP with up to a thousand tests for dual-core microchip.

Published in:

Electronic Manufacturing Technology Symposium, 2007. IEMT '07. 32nd IEEE/CPMT International

Date of Conference:

3-5 Oct. 2007