Author
Arthur D. Friedman
Bio: Arthur D. Friedman is an academic researcher. The author has contributed to research in topics: Sequential logic & Combinational logic. The author has an hindex of 4, co-authored 10 publications receiving 3302 citations.
Papers
More filters
01 Jan 1974
TL;DR: An exploratory design automation system is being developed at the University of Southern California that is intended to be highly interactive and has several features which will enhance the possibilities of automatic physical description.
Abstract: Most design automation systems attempt to automate only a small part of the physical description. Much is left to the designers. An exploratory design automation system is being developed at the University of Southern California. The system is intended to be highly interactive and has several features which will enhance the possibilities of automatic physical description. Different approaches and algorithms required to accomplish the “future” system are outlined.
1 citations
01 Jan 1990
TL;DR: This chapter contains sections titled: Testability Ad Hoc Design for Testability Techniques Controllability and Observability by Means of Scan Registers, and References Problems.
Abstract: This chapter contains sections titled: Testability Ad Hoc Design for Testability Techniques Controllability and Observability by Means of Scan Registers Generic Scan-Based Designs Storage Cells for Scan Designs Classical Scan Designs Scan Design Costs Board-Level and System-Level DFT Approaches Some Advanced Scan Concepts Boundary-Scan Standards This chapter contains sections titled: References Problems
1 citations
Cited by
More filters
TL;DR: Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances.
Abstract: This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), a new search algorithm for Propositional Satisfiability (SAT). GRASP incorporates several search-pruning techniques that proved to be quite powerful on a wide variety of SAT problems. Some of these techniques are specific to SAT, whereas others are similar in spirit to approaches in other fields of Artificial Intelligence. GRASP is premised on the inevitability of conflicts during the search and its most distinguishing feature is the augmentation of basic backtracking search with a powerful conflict analysis procedure. Analyzing conflicts to determine their causes enables GRASP to backtrack nonchronologically to earlier levels in the search tree, potentially pruning large portions of the search space. In addition, by "recording" the causes of conflicts, GRASP can recognize and preempt the occurrence of similar conflicts later on in the search. Finally, straightforward bookkeeping of the causality chains leading up to conflicts allows GRASP to identify assignments that are necessary for a solution to be found. Experimental results obtained from a large number of benchmarks indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for a large number of representative classes of SAT instances.
1,482 citations
10 Nov 1996
TL;DR: Experimental results obtained from a large number of benchmarks, including many from the field of test pattern generation, indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for aLarge number of representative classes of SAT instances.
Abstract: This paper introduces GRASP (Generic seaRch Algorithm for the Satisfiability Problem), an integrated algorithmic framework for SAT that unifies several previously proposed search-pruning techniques and facilitates identification of additional ones. GRASP is premised on the inevitability of conflicts during search and its most distinguishing feature is the augmentation of basic backtracking search with a powerful conflict analysis procedure. Analyzing conflicts to determine their causes enables GRASP to backtrack non-chronologically to earlier levels in the search tree, potentially pruning large portions of the search space. In addition, by "recording" the causes of conflicts, GRASP can recognize and preempt the occurrence of similar conflicts later on in the search. Finally, straightforward bookkeeping of the causality chains leading up to conflicts allows GRASP to identify assignments that are necessary for a solution to be found. Experimental results obtained from a large number of benchmarks, including many from the field of test pattern generation, indicate that application of the proposed conflict analysis techniques to SAT algorithms can be extremely effective for a large number of representative classes of SAT instances.
951 citations
01 Jan 1995
TL;DR: This work examines the benefits and problems inherent in asynchronous computations, and in some of the more notable design methodologies, which include Huffman asynchronous circuits, burst-mode circuits, micropipelines, template-based and trace theory-based delay-insensitive circuits, signal transition graphs, change diagrams, and complication-based quasi-delay-insensitivity circuits.
Abstract: Asynchronous design has been an active area of research since at least the mid 1950's, but has yet to achieve widespread use. We examine the benefits and problems inherent in asynchronous computations, and in some of the more notable design methodologies. These include Huffman asynchronous circuits, burst-mode circuits, micropipelines, template-based and trace theory-based delay-insensitive circuits, signal transition graphs, change diagrams, and complication-based quasi-delay-insensitive circuits. >
622 citations
TL;DR: Dart differs from previous approaches to diagnosis taken in the design-automation community in that it is more general and in many cases more efficient, and allows it to be applied to a wide class of devices ranging from digital logic to nuclear reactors.
598 citations
Book•
01 Jul 2006
TL;DR: This book is a comprehensive guide to new DFT methods that will show the readers how to design a testable and quality product, drive down test cost, improve product quality and yield, and speed up time-to-market and time- to-volume.
522 citations