Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

9

ASPDAC
2005
ACM

favoriteEmaildiscussreport

91views Hardware» more ASPDAC 2005»

Efficiently generating test vectors with state pruning

13 years 10 months ago

Efficiently generating test vectors with state pruning

Download web.mac.com

- This paper extends the depth first search (DFS) used in the previously proposed witness string method for generating efficient test vectors. A state pruning method is added that exploits different search heuristics in simultaneous searches. Using an IBM Power4 multiprocessor system with the Berkeley Active Message library, we show that this new method of state pruning is efficient and produces quantitatively better witness strings compared to both pure and guided DFS.

Ying Chen, Dennis Abts, David J. Lilja

Real-time Traffic

ASPDAC 2005 | Efficient Test Vectors | State Pruning Method | Witness String Method |

claim paper

Related Content

» Compactionbased test generation using state and fault information

» A Comparison of Pruning Methods for Relational Concept Learning

» On primitive fault test generation in nonscan sequential circuits

» A Novel MutationBased Validation Paradigm for HighLevel Hardware Descriptions

» Dynamic SearchSpace Pruning Techniques in Path Sensitization

» Sequential circuit test generation using dynamic state traversal

» On Using Efficient Test Sequences for BIST

» Fast Algorithms for Static Compaction of Sequential Circuit Test Vectors

» Symstra A Framework for Generating ObjectOriented Unit Tests Using Symbolic Execution

Post Info
More Details (n/a)

Added	26 Jun 2010
Updated	26 Jun 2010
Type	Conference
Year	2005
Where	ASPDAC
Authors	Ying Chen, Dennis Abts, David J. Lilja

Comments (0)