scispace - formally typeset
Search or ask a question

Showing papers by "S. Di Carlo published in 2001"


Proceedings ArticleDOI
19 Nov 2001
TL;DR: A new approach to program control flow checking has been inserted at source-code level using a signature methodology based on regular expressions that allows very low memory overhead and trade-off between fault latency and program execution time overhead.
Abstract: The present paper explains a new approach to program control flow checking. The check has been inserted at source-code level using a signature methodology based on regular expressions. The signature checking is performed without a dedicated watchdog processor but resorting to inter-process communication (IPC) facilities offered by most of the modern operating systems. The proposed approach allows very low memory overhead and trade-off between fault latency and program execution time overhead.

45 citations


Proceedings ArticleDOI
13 Mar 2001
TL;DR: The main contribution of the present paper consists in formulating the problem of an optimal reseeding computation as an instance of the set covering problem, which provides a more efficient test set encoding then previous techniques.
Abstract: The Functional BIST approach is a rather new BIST technique based on exploiting embedded system functionality to generate deterministic test patterns during BIST. The approach takes advantages of two well-known testing techniques, the arithmetic BIST approach and the reseeding method. The main contribution of the present paper consists in formulating the problem of an optimal reseeding computation as an instance of the set covering problem. The proposed approach guarantees high flexibility, is applicable to different functional modules, and, in general, provides a more efficient test set encoding then previous techniques. In addition, the approach shorts the computation time and allows to better exploiting the tradeoff between area overhead and global test length as well as to deal with larger circuits.

17 citations


Proceedings ArticleDOI
01 Jul 2001
TL;DR: Presents the validation of the strategies employed in the RECCO tool to analyze a C/C++ software to prove the effectiveness of RECCO's methodology.
Abstract: Presents the validation of the strategies employed in the RECCO tool to analyze a C/C++ software; the RECCO compiler scans C/C++ source code to extract information about the significance of the variables that populate the program and the code structure itself. Experimental results gathered on an Open Source Router are used to compare and correlate two sets of critical variables, one obtained by fault injection experiments, and the other applying the RECCO tool, respectively. Then the two sets are analyzed, compared, and correlated to prove the effectiveness of RECCO's methodology.

14 citations


Proceedings ArticleDOI
13 Mar 2001
TL;DR: A detailed error analysis and classification of the behavior of an open-source router when affected by Single Event Upsets is presented, to identify the most critical memory regions and to cluster the router variables according to their impact on system dependability.
Abstract: The paper presents a detailed error analysis and classification of the behavior of an open-source router when affected by Single Event Upsets (SEUs). The experimental results have been gathered on a real communication network, resorting to an ad-hoc Fault Injection system. The injector has been designed to corrupt the router during its normal service and to analyze the SEU injection effects on the overall distributed system. The performed experiments allowed the authors to identify the most critical memory regions and to cluster the router variables according to their impact on system dependability.

6 citations


Proceedings ArticleDOI
10 Sep 2001
TL;DR: A C/C++ source-to-source compiler able to increase the dependability properties of a given application is proposed and validated based on the emulation of fault appearance by software fault injection.
Abstract: The present paper proposes a C/C++ source-to-source compiler able to increase the dependability properties of a given application. The adopted strategy is based on two main techniques: variable duplication/triplication and control flow checking. The validation of these techniques is based on the emulation of fault appearance by software fault injection. The chosen test case is a client-server application in charge of calculating and drawing a Mandelbrot fractal.

5 citations


Proceedings ArticleDOI
19 Nov 2001
TL;DR: An innovative algorithm is presented that is able to generate an optimal March test for an unconstrained set of memory faults in very low computation time and a new complete taxonomy for memory read faults, a class of faults never carefully addressed in the past.
Abstract: This paper presents an innovative algorithm for the automatic generation of March tests. The proposed approach is able to generate an optimal March test for an unconstrained set of memory faults in very low computation time. Moreover, we propose a new complete taxonomy for memory read faults, a class of faults never carefully addressed in the past.

2 citations