Sciweavers

624 search results - page 14 / 125
» Test set compaction algorithms for combinational circuits
Sort
View
GLVLSI
2010
IEEE
178views VLSI» more  GLVLSI 2010»
15 years 2 months ago
Improving the testability and reliability of sequential circuits with invariant logic
In this paper, we investigate dual applications for logic implications, which can provide both online error detection capabilities and improve the testing efficiency of an integr...
Nuno Alves, Kundan Nepal, Jennifer Dworak, R. Iris...
94
Voted
EURODAC
1990
IEEE
92views VHDL» more  EURODAC 1990»
15 years 1 months ago
Accelerated test pattern generation by cone-oriented circuit partitioning
In this paper an efficient cone oriented circuit partitioning method is presented, which significantly speeds up automatic test pattern generation for combinational circuits. The ...
Torsten Grüning, Udo Mahlstedt, Wilfried Daeh...
TCAD
1998
126views more  TCAD 1998»
14 years 9 months ago
Iterative remapping for logic circuits
Abstract—This paper presents an aggressive optimization technique targeting combinational logic circuits. Starting from an initial implementation mapped on a given technology lib...
Luca Benini, Patrick Vuillod, Giovanni De Micheli
OOPSLA
2010
Springer
14 years 8 months ago
Random testing for higher-order, stateful programs
Testing is among the most effective tools available for finding bugs. Still, we know of no automatic technique for generating test cases that expose bugs involving a combination ...
Casey Klein, Matthew Flatt, Robert Bruce Findler
IPPS
1998
IEEE
15 years 1 months ago
Meta-heuristics for Circuit Partitioning in Parallel Test Generation
In this communication Simulated Annealing and Genetic Algorithms, are applied to the graph partitioning problem. These techniques mimic processes in statistical mechanics and biol...
Consolación Gil, Julio Ortega, Antonio F. D...