Efficiently generating test vectors with state pruning

Authors:
Ying Chen;Dennis Abts;David J. Lilja
Affiliations:
University of Minnesota, Minneapolis, Minnesota;Cray Inc., Chippewa Falls, Wisconsin;University of Minnesota, Minneapolis, Minnesota
Venue:
Proceedings of the 2005 Asia and South Pacific Design Automation Conference
Year:
2005

Citing 9
Cited 1

The Stanford Dash Multiprocessor

Computer
Active messages: a mechanism for integrated communication and computation

ISCA '92 Proceedings of the 19th annual international symposium on Computer architecture
The SGI Origin: a ccNUMA highly scalable server

Proceedings of the 24th annual international symposium on Computer architecture
Validation with guided search of the state space

DAC '98 Proceedings of the 35th annual Design Automation Conference
Verifying large-scale multiprocessors using an abstract verification environment

Proceedings of the 36th annual ACM/IEEE Design Automation Conference
Parallelizing the Murϕ Verifier

Formal Methods in System Design - Special issue on CAV '97
Automatic verification of the SCI cache coherence protocol

CHARME '95 Proceedings of the IFIP WG 10.5 Advanced Research Working Conference on Correct Hardware Design and Verification Methods
The Murphi Verification System

CAV '96 Proceedings of the 8th International Conference on Computer Aided Verification
So Many States, So Little Time: Verifying Memory Coherence in the Cray X1

IPDPS '03 Proceedings of the 17th International Symposium on Parallel and Distributed Processing

Fuzzy risk analysis based on interval-valued fuzzy numbers

Expert Systems with Applications: An International Journal

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.