scispace - formally typeset
Search or ask a question
Author

Matteo Sonza Reorda

Bio: Matteo Sonza Reorda is an academic researcher from Polytechnic University of Turin. The author has contributed to research in topics: Fault coverage & Automatic test pattern generation. The author has an hindex of 32, co-authored 295 publications receiving 4525 citations. Previous affiliations of Matteo Sonza Reorda include University of California, Riverside & NXP Semiconductors.


Papers
More filters
Proceedings ArticleDOI
01 Aug 2018
TL;DR: This paper models the state of a reconfigurable scan network with a finite state automaton, using the length of the active path as the output alphabet and the configurations as input symbols, and generates a functional test sequence able to detect multiple state-transition faults.
Abstract: The broad need to efficiently access all the instrumentation embedded within a semiconductor device called for a standardization, and the reconfigurable scan networks proposed in IEEE 1687 have been demonstrated effective in handling complex infrastructures At the same time, different techniques have been proposed to test the new circuitry required; however, most of the automatic approaches are either too computationally demanding to be applied in complex cases, or too approximate to yield high-quality tests This paper models the state of a reconfigurable scan network with a finite state automaton, using the length of the active path as the output alphabet and the configurations as input symbols Permanent faults are represented as incorrect transitions, and a greedy algorithm is used to generate a functional test sequence able to detect all these multiple state-transition faults The automaton's state set and the input alphabet are small subsets of the possible ones, and are carefully chosen Experimental results on ITC'16 benchmarks demonstrate that the proposed approach is broadly applicable; the test sequences are more efficient than the ones previously generated by search heuristics

2 citations

Proceedings ArticleDOI
26 Jan 1994
TL;DR: A package for boolean f u n c t i o n njanipulalioii on a massi,ut;ly parallel S I M D architect u re is described.
Abstract: paper describes a package for boolean f u n c t i o n njanipulalioii on a massi,ut;ly parallel S I M D architect u re . The package exploits B i n a r y Decis ion Diagrams ( B D D s ) t o symbolically operate ruith boolean fu i i c t ions . Th.e parallel a1gorith.iii.s f o r t h e basic procedures of t he package are report td . The approach is ba,sed o n distr ibut ing BDD nodes t o the available Processing Eleniwnts and traversing B D D s in a breadth-first m a n ner. Two parallel hash tables are imp lemen ted using a double hashing strategy. Air application h a s been dtueloped, arid the ei:periinen,tal results are compared with t h e o n e s proposed in previous works o n m o n o processor architectures. Two aduantages are reached with. o u r imp lemen ta t ion : the CPU t i m e is reduced and t h e ni imber of B D D n.odes which can be handled is s ign if; ca nt l y increase d. T h e

2 citations

Proceedings ArticleDOI
25 Mar 2015
TL;DR: This paper evaluates how the LDMR and its architectural components behave in the presence of permanent faults and classifies how sensitive the error detection and rollback machinery is to hard faults.
Abstract: The Lightweight Dual Modular Redundancy (LDMR) is a fault tolerant architecture for low-latency soft error correction. The LDMR introduces a software compilation strategy that enforces error containment inside a basic block, allowing for a simplified error correction policy. This paper evaluates how the LDMR and its architectural components behave in the presence of permanent faults. It also classifies how sensitive the error detection and rollback machinery is to hard faults. By including permanent fault detection and diagnosis, the LDMR becomes a comprehensive fault tolerant architecture for embedded computing, covering a broad range of fault models. This paper also evaluates the LDMR's performance overhead using a MiBench subset, which is currently 1.54 in average.

2 citations

Journal ArticleDOI
TL;DR: Nicolici et al. as discussed by the authors assesses the fault coverage that can be attained through software self-test strategies for in-field test of GPUs, which can be used for autonomous systems.
Abstract: Editor’s notes: GPUs have seen an increased adoption in autonomous systems. This article assesses the fault coverage that can be attained through software self-test strategies for in-field test of GPUs.—Nicola Nicolici, McMaster University

2 citations


Cited by
More filters
01 Jan 1999
TL;DR: This research organizes, presents, and analyzes contemporary MultiObjective Evolutionary Algorithm research and associated Multiobjective Optimization Problems (MOPs) and uses a consistent MOEA terminology and notation to present a complete, contemporary view of current MOEA "state of the art" and possible future research.
Abstract: : This research organizes, presents, and analyzes contemporary Multiobjective Evolutionary Algorithm (MOEA) research and associated Multiobjective Optimization Problems (MOPs). Using a consistent MOEA terminology and notation, each cited MOEAs' key factors are presented in tabular form for ease of MOEA identification and selection. A detailed quantitative and qualitative MOEA analysis is presented, providing a basis for conclusions about various MOEA-related issues. The traditional notion of building blocks is extended to the MOP domain in an effort to develop more effective and efficient MOEAs. Additionally, the MOEA community's limited test suites contain various functions whose origins and rationale for use are often unknown. Thus, using general test suite guidelines appropriate MOEA test function suites are substantiated and generated. An experimental methodology incorporating a solution database and appropriate metrics is offered as a proposed evaluation framework allowing absolute comparisons of specific MOEA approaches. Taken together, this document's classifications, analyses, and new innovations present a complete, contemporary view of current MOEA "state of the art" and possible future research. Researchers with basic EA knowledge may also use part of it as a largely self-contained introduction to MOEAs.

1,287 citations

Book
31 Jan 1993
TL;DR: This book is a core reference for graduate students and CAD professionals and presents a balance of theory and practice in a intuitive manner.
Abstract: From the Publisher: This work covers all aspects of physical design. The book is a core reference for graduate students and CAD professionals. For students, concept and algorithms are presented in an intuitive manner. For CAD professionals, the material presents a balance of theory and practice. An extensive bibliography is provided which is useful for finding advanced material on a topic. At the end of each chapter, exercises are provided, which range in complexity from simple to research level.

927 citations

Journal ArticleDOI
TL;DR: This paper presents crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with different representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation.
Abstract: This paper is the result of a literature study carried out by the authors. It is a review of the different attempts made to solve the Travelling Salesman Problem with Genetic Algorithms. We present crossover and mutation operators, developed to tackle the Travelling Salesman Problem with Genetic Algorithms with different representations such as: binary representation, path representation, adjacency representation, ordinal representation and matrix representation. Likewise, we show the experimental results obtained with different standard examples using combination of crossover and mutation operators in relation with path representation.

839 citations

Journal ArticleDOI
TL;DR: A taxonomy of hybrid metaheuristics is presented in an attempt to provide a common terminology and classification mechanisms and is also applicable to most types of heuristics and exact optimization algorithms.
Abstract: Hybrid metaheuristics have received considerable interest these recent years in the field of combinatorial optimization. A wide variety of hybrid approaches have been proposed in the literature. In this paper, a taxonomy of hybrid metaheuristics is presented in an attempt to provide a common terminology and classification mechanisms. The taxonomy, while presented in terms of metaheuristics, is also applicable to most types of heuristics and exact optimization algorithms. As an illustration of the usefulness of the taxonomy an annoted bibliography is given which classifies a large number of hybrid approaches according to the taxonomy.

829 citations

Journal Article
TL;DR: In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances.
Abstract: We consider a fully SAT-based method of unbounded symbolic model checking based on computing Craig interpolants. In benchmark studies using a set of large industrial circuit verification instances, this method is greatly more efficient than BDD-based symbolic model checking, and compares favorably to some recent SAT-based model checking methods on positive instances.

775 citations