A software program that can be considered as a tool for the fault diagnosis of analog linear circuit is presented. The proposed program implements a numerically efficient approach to identify complex ambiguity groups in the case of circuit of great size and low testability. This approach is based on an efficient QR factorization technique applied to the testability matrix. An amplifier circuit ...

For next generation mixed signal ICs, the integration of Design-for-Testability and Built-In Self-Test structures is expected to be of crucial importance for satisfying quality and economic demands. The judgment and evaluation of such testability optimisations, however, requires a better understanding of circuit specific failure modes in deep sub-micron technologies. This paper presents fault s...

Testability is a very useful concept in the field of circuit testing and fault diagnosis and can be defined as a measure of the effectiveness of a selected test point set. A very efficient approach for automated testability evaluation of analog circuits is based on the use of symbolic techniques. Different algorithms relying on the symbolic approach have been presented in the past by the author...

In this paper, we present the application of neural networks for predicting the software testability using the object oriented design metrics. The testability is generally measured in terms of the effort required for testing. The object oriented design metrics are used as the independent variables and two JUnit based test metrics are used as dependent variables in this study. The software metri...

Members of the Maintenance and Diagnostic Control subcommittee of /€€E's Sandards Coordinating Committee 20 (SCC20) are developing a standard for testability and diagnosability characteristics and metrics. The objective of this standard, P1522 is to provide notionally correct, useful, and mathematically precise definitions of testabillfy measures that may be used to either measure or predict th...

Generating test data by hand is a tedious, expensive and error-prone activity, yet testing is a vital part of the development process. Several techniques have been proposed to automate the generation of test data, but all of these are hindered by the presence of unstructured control flow. This paper addresses the problem using testability transformation. Testability transformation does not pres...

Frameworks are developed to capture the recurring design practices in terms of skeletons of software subsystems/ systems. They are designed ‘abstract’ and ‘incomplete’ and are designed with predefined points of variability, known as hot spots, to be customized later at the time of framework reuse. Frameworks are reusable entities thus demand stricter and rigorous testing in comparison to one-ti...

Sum of Pseudoproducts (SPPs) are three-level network structures that give a good compromise between compact representation and small depth of the resulting circuit. In this paper the testability of circuits derived from SPPs is studied. For SPPs several restricted forms can be considered. While full testability can be proved for some classes, others are shown to contain redundancies. Experiment...

When conceived as an empirical claim, it is natural to wonder how one might test the hypothesis of multiple realization. I consider general issues of testability, show how they apply specifically to the hypothesis of multiple realization, and propose an auxiliary assumption that, I argue, must be conjoined to the hypothesis of multiple realization to ensure its testability. I argue further that...

A computer aided method for analyzing the testability of Programmable Logic Arrays (PLAs) is described. The method, which is based on a functional verification approach, estimates the complexity of testing a PLA according to the amount of single undetectable faults in the array structure. An analytic program (FACTPLA) is developed to predict the above complexity without analyzing the topology o...