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

Gary S. Greenstein

dblp:55/3209 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
0since 2021 · last 1999
—ORCID · none

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

Systems, architecture and hardware · 4 · 1 first-authorSoftware engineering, systems software and programming languages · 1

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
2 papers
Electronic design automation · 100%

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

TopicWeightPapersLastEvidence papers
Electronic design automation › hardware verification and test › test generation
genetic algorithm test generation
0.021997
A genetic algorithm framework for test generation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997
Sequential Circuit Test Generation in a Genetic Algorithm Framework · DAC 1994
Electronic design automation
hardware verification and test
0.021997
A genetic algorithm framework for test generation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997
Sequential Circuit Test Generation in a Genetic Algorithm Framework · DAC 1994
Electronic design automation › hardware verification and test › test generation
sequential circuit test generation
0.021997
A genetic algorithm framework for test generation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997
Sequential Circuit Test Generation in a Genetic Algorithm Framework · DAC 1994
Electronic design automation › hardware verification and test
test generation
0.011997
A genetic algorithm framework for test generation · IEEE Trans. Comput. Aided Des. Integr. Circuits Syst. 1997
Electronic design automation › hardware verification and test
fault coverage
0.011994
Sequential Circuit Test Generation in a Genetic Algorithm Framework · DAC 1994

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

genetic algorithm · 0.0fault simulation · 0.0
YearPublicationVenuePosition
1999 A Fault List Reduction Approach for Efficient Bridge Fault Diagnosis
abstract
A new fault list reduction approach is proposed for use in the first stage of a two-stage bridge fault diagnosis procedure. Modified structural analysis and layout extraction procedures are performed to obtain a reduced realistic bridge fault list that can be used in the second stage, which employs diagnostic fault simulation. The fault list reduction approach can reduce the final candidate bridge fault list by 92% to 99% compared with the diagnosis results achieved by the diagnostic fault simulator alone.
Jue Wu, Gary S. Greenstein, Elizabeth M. Rudnick
DATE2
1997 A genetic algorithm framework for test generation
abstract
Test generation using deterministic fault-oriented algorithms is highly complex and time consuming. New approaches are needed to augment the existing techniques, both to reduce execution time and to improve fault coverage. Genetic algorithms (GA's) have been effective in solving many search and optimization problems. Since test generation is a search process over a large vector space, it is an ideal candidate for GA's. In this work, we describe a GA framework for sequential circuit test generation. The GA evolves candidate test vectors and sequences, using a fault simulator to compute the fitness of each candidate test. Various GA parameters are studied, including alphabet size, fitness function, generation gap, population size, and mutation rate, as well as selection and crossover schemes. High fault coverages were obtained for most of the ISCAS'89 sequential benchmark circuits, and execution times were significantly lower than in a deterministic test generator in most cases.
Elizabeth M. Rudnick, Janak H. Patel, Gary S. Greenstein, Thomas M. Niermann
IEEE Trans. Comput. Aided Des. Integr. Circuits Syst.3
1994 Sequential Circuit Test Generation in a Genetic Algorithm Framework
abstract
Abstract|T est generation using deterministic faultoriented algorithms is highly complex and time-consuming.New approaches are needed to augment the existing techniques, both to reduce execution time and to improve fault coverage.In this work, we describe a genetic algorithm (GA) framew ork for sequential circuit test generation.The GA evolves candidate test vectors and sequences, using a fault simulator to compute the tness of each candidate test.Various GA parameters are studied, including alphabet size, tness function, generation gap, population size, and mutation rate, as well as selection and crossover schemes.High fault coverages were obtained for most of the IS-CAS89 sequential benchmark circuits, and execution times were signi cantly lower than in a deterministic test generator in most cases.
Elizabeth M. Rudnick, Janak H. Patel, Gary S. Greenstein, Thomas M. Niermann
DAC3
1992 E-PROOFS: a CMOS bridging fault simulator
abstract
The problem of bridging fault simulation under the conventional voltage testing environment is considered. A method to provide electrical-level simulation accuracy, without paying the associated performance penalties, is proposed. A three-level simulation model is used, balancing the tradeoffs among gate-level, switch-level, and electrical-level simulation. Large memory overheads are avoided by localizing the fault, and by performing electrical-level simulation only in the area around the fault. This approach is sufficiently flexible to model feedback faults, BiCMOS circuits, stuck-open faults, and any fault that can be described with a circuit netlist. Tests were run on several ISCAS combinational and sequential benchmark circuits, using realistic cells and transistor parameters; results show that accurate simulations can be performed in reasonable time.>
Gary S. Greenstein, Janak H. Patel
ICCAD1