Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Bill Underwood

dblp:98/4212 · DBLP profile ↗
← Back
10ranked-venue papers
3as first author
0since 2021 · last 1994
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Systems, architecture and hardware · 10 · 3 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer architecture, parallel and distributed computing, and storage systems
1 paper
Electronic design automation · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test
delay fault testing
0.011991
The Interdependence Between Delay-Optimization of Synthesized Networks and Testing · DAC 1991
Electronic design automation › physical design › timing optimization
delay optimization
0.011991
The Interdependence Between Delay-Optimization of Synthesized Networks and Testing · DAC 1991
Electronic design automation
hardware verification and test
0.011991
The Interdependence Between Delay-Optimization of Synthesized Networks and Testing · DAC 1991
Electronic design automation
logic synthesis
0.011991
The Interdependence Between Delay-Optimization of Synthesized Networks and Testing · DAC 1991
Electronic design automation
physical design
0.011991
The Interdependence Between Delay-Optimization of Synthesized Networks and Testing · DAC 1991
Electronic design automation › physical design
timing optimization
0.011991
The Interdependence Between Delay-Optimization of Synthesized Networks and Testing · DAC 1991

Methods — techniques the papers use, named apart from their topics

formal analysis · 0.0
YearPublicationVenuePosition
1994 Path-Delay Fault Simulation for a Standard Scan Design Methodology
abstract
In spite of using scan designs, there remain serious problems concerning the generation and confirmation of test vectors for potential timing problems. Most of the available test generators and the only fault simulators reported for path-delay faults in scan designs rely upon the use of augmented scan flip-flops to convert the timing vector problem to a purely combinational one. This paper describes a path-delay fault simulator for standard scan environments, based on the parallel-pattern-single-fault-propagation technique.>
Wai-On Law, Bill Underwood
ICCD3
1994 Fastpath: A Path-Delay Test Generator for Standard Scan Designs
abstract
Fastpath generates non-robust, robust or single-path-sensitization hazard-free robust path-delay tests for standard scan designs including high-impedance elements and functionally-described blocks. Results show effective and memory-efficient operation.
Bill Underwood, Wai-On Law, Haluk Konuk
ITC1
1991 The Interdependence Between Delay-Optimization of Synthesized Networks and Testing
abstract
As CAD tools become more sophisticated, they can synthesize logic netivorks that more nearly optimize the circuit area resources to maximize operating speeds.In this work we show, through formal arguments, that the path delays in such optimized networks will follow a more compact distribution and, in the extreme in some networks, will all be equal to the m"mum delay through the network (cycle time).The impact of this type of synthesized network on delay testing will be shown and compared to the case for nonoptim"zed designs.Finally, recommendations will be made on how network tim"ng optimization can be abne in such a way as to minimize the adverse impact on product yield.
Thomas W. Williams, Bill Underwood, M. Ray Mercer
DAC2
1991 Delay Testing Quality in Timing-Optimized Designs
abstract
As electronic CAD synthesis tools become more powerful, they will increasingly refine delay measiirements and adjust path delays so as to increase the clock rate or to reduce the chip area. This paper discusses the implications of such events on testing for delay defects. We provide a timing optimization procedure and show that the resultant density function of path delays is a delta function. Finally, we discuss the impact of timing optimization on the yield of a manufacturing process and the defect level for delay faults.
Eun Sei Park, Bill Underwood, Thomas W. Williams, M. Ray Mercer
ITC2
1989 The Parallel-Test-Detect Fault Simulation Algorithm
abstract
It is shown how the test-detect principle can be adapted to the parallel-patterns technique for combinational fault simulation. Several techniques for implementing a parallel-test-detect simulator are presented, with techniques based on nominator analysis providing the fastest fault simulation results. The dominant-test-detect approach has proved to be effective both for small sets of patterns, as might be used in automatic test pattern generation, and for larger pattern sets that might be used in built-in self-test.>
Bill Underwood, Jack Ferguson
ITC1
1988 An Analysis of Parallel Logic Simulation on Several Architectures
Steven P. Smith, Bill Underwood, Joe Newman
ICPP (1)2
1988 D^3FS: A Demand Driven Deductive Fault Simulator
abstract
A high-speed fault simulator is presented that combines demand-driven simulation techniques with a bit-encoded deductive fault simulation scheme. The simulator uses an efficient approach to the management of signal value and fault list structures intended to minimize disk thrashing during execution. Input cone analysis is used during preprocessing to identify gates with independent inputs so that optimized evaluation routines that include early cutoff can be used. Results are given for the demand-driven deductive fault simulator and contrasted with an earlier demand-driven parallel fault simulator.>
Steven P. Smith, Bill Underwood, M. Ray Mercer
ITC2
1986 Calculation of Greatest Lower Bounds Obtainable by the Cutting Algorithm
Rhonda Kay Gaede, M. Ray Mercer, Bill Underwood
ITC3
1985 Built-In Self Test Input Generator for Programmable Logic Arrays
John Salick, Bill Underwood, M. Ray Mercer
ITC2
1984 Correlating Testability with Fault Detection
Bill Underwood, M. Ray Mercer
ITC1