This paper proposes a suitable on-line testing technique during the synthesis of complex electronic structures. Online testability is addressed by exploiting time redundancy in the scheduled data flow graph. On-line testability constraints are taken into account at the scheduling and allocation tasks. The technique implements non-concurrent; semiconcurrent or fully concurrent on-line tests acco...

Searchable encryption has many applications including email systems and storage systems. The usefulness of searchable encryption derives from its support of keyword-testability. Keyword-testability means that a receiver of a ciphertext can test whether the ciphertext contains a specific keyword. Recently, Bellare et al. suggested an efficientlysearchable encryption scheme with keyword-recoverab...

Testability is an important characteristic of a software system which has to be considered during all phases and activities of software development. This article describes for object-oriented systems 1) testability issues related to dependencies which are relevant during design and 2) a new approach based on metrics to locate dependencies that are critical for testing.

Watson-Crick finite automata were first proposed in [2] inspired by formal language theory, finite states machines and some ingredients from DNA computing such as working with molecules as double stranded complementary strings. Here, we define different kinds of local testability in this model. Mainly, we will explore local testability in the upper (lower) strand and in the double strand.

Both refutationist and verificationist philosophies and practices are becoming increasingly evident in phylogenetic inference. Refutation and verification are fundamentally different epistemologies, and it seems unlikely that they can continue to coexist as the basis for inferring species history. The refutationist nature of cladistics is explored in terms of Popperian testability, in order to ...

The word ‘testability’ has been used variously in the software community to represent a number of different concepts such as how easy it is to test a program or how easy it is to achieve execution coverage of certain program components. Voas and colleagues have used the word to capture a slightly different notion, namely the ease with which faults, if present in a program, can be revealed by th...

This paper reports an investigation of Iddq test coverage of randomly generated test vectors and Iddq fault coverage estimation based on a new testability measure. Experimental results show that Iddq random vectors are as efficient as deterministic vectors, and that the proposed testability measure is capable of accurately estimating fault coverage of Iddq test.