Sciweavers

3384 search results - page 9 / 677
» More Testable Properties
Sort
View
SODA
2004
ACM
121views Algorithms» more  SODA 2004»
15 years 1 months ago
A characterization of easily testable induced subgraphs
Let H be a fixed graph on h vertices. We say that a graph G is induced H-free if it does not contain any induced copy of H. Let G be a graph on n vertices and suppose that at leas...
Noga Alon, Asaf Shapira
APPROX
2006
Springer
105views Algorithms» more  APPROX 2006»
15 years 3 months ago
Space Complexity vs. Query Complexity
Abstract. Combinatorial property testing deals with the following relaxation of decision problems: Given a fixed property and an input x, one wants to decide whether x satisfies th...
Oded Lachish, Ilan Newman, Asaf Shapira
MTDT
2003
IEEE
105views Hardware» more  MTDT 2003»
15 years 5 months ago
A Testability-Driven Optimizer and Wrapper Generator for Embedded Memories
Memory cores (especially SRAM cores) used on a system chip usually come from a memory compiler. Commercial memory compilers have their limitation— a large memory may need to be ...
Rei-Fu Huang, Li-Ming Denq, Cheng-Wen Wu, Jin-Fu L...
ATS
2002
IEEE
94views Hardware» more  ATS 2002»
15 years 4 months ago
Non-Intrusive Design of Concurrently Self-Testable FSMs
We propose a methodology for non-intrusive design of concurrently self-testable FSMs. Unlike duplication schemes, wherein a replica of the original FSM acts as a predictor-compara...
Petros Drineas, Yiorgos Makris
DAC
1991
ACM
15 years 3 months ago
A Unified Approach for the Synthesis of Self-Testable Finite State Machines
-Conventionallyself-test hardware is added after synthesis is completed. For highly sequential circuits like controllersthis design method eitherleads to high hardware overheadsor ...
Bernhard Eschermann, Hans-Joachim Wunderlich