An In-depth and Black-box Characterization of the Effects of Clock Glitches on 8-bit MCUs

Author(s):  
Josep Balasch ◽  
Benedikt Gierlichs ◽  
Ingrid Verbauwhede
Keyword(s):  

2017 ◽  
Vol 25 (4) ◽  
pp. 529-554 ◽  
Author(s):  
Mario A. Muñoz ◽  
Kate A. Smith-Miles

This article presents a method for the objective assessment of an algorithm’s strengths and weaknesses. Instead of examining the performance of only one or more algorithms on a benchmark set, or generating custom problems that maximize the performance difference between two algorithms, our method quantifies both the nature of the test instances and the algorithm performance. Our aim is to gather information about possible phase transitions in performance, that is, the points in which a small change in problem structure produces algorithm failure. The method is based on the accurate estimation and characterization of the algorithm footprints, that is, the regions of instance space in which good or exceptional performance is expected from an algorithm. A footprint can be estimated for each algorithm and for the overall portfolio. Therefore, we select a set of features to generate a common instance space, which we validate by constructing a sufficiently accurate prediction model. We characterize the footprints by their area and density. Our method identifies complementary performance between algorithms, quantifies the common features of hard problems, and locates regions where a phase transition may lie.



Author(s):  
F. Previdi ◽  
V. Quagline ◽  
S. Bittanti ◽  
R. Contro
Keyword(s):  


Author(s):  
Dilip S. V. Kumar ◽  
Arthur Beckers ◽  
Josep Balasch ◽  
Benedikt Gierlichs ◽  
Ingrid Verbauwhede
Keyword(s):  


Author(s):  
Bowen Weng ◽  
Linda Capito ◽  
Umit Ozguner ◽  
Keith Redmill


2013 ◽  
Vol 2013 ◽  
pp. 1-16 ◽  
Author(s):  
Mohammad Fuad Mohammad Naser ◽  
Fayçal Ikhouane

The Duhem model, widely used in structural, electrical, and mechanical engineering, gives an analytical description of a smooth hysteretic behavior. In practice, the Duhem model is mostly used within the following black-box approach: given a set of experimental input-output data, how to tune the model so that its output matches the experimental data. It may happen that a Duhem model presents a good match with the experimental real data for a specific input but does not necessarily keep significant physical properties which are inherent to the real data, independent of the exciting input. This paper presents a characterization of different classes of Duhem models in terms of their consistency with the hysteresis behavior.



1999 ◽  
Vol 08 (04) ◽  
pp. 295-323 ◽  
Author(s):  
DANIEL BARBARÁ

In a world where the amount of electronic information available is constantly growing, techniques to select and filter information efficiently become increasingly important. Continuous queries are a tool that allows users to monitor one or more information sources, by giving the impression that the queries are being run continually over them. In this paper, we formalize the notion of continuous queries for a wide spectrum of environments. We consider both append-only data sources and systems that allow more general data manipulation. We examine the case where the database management software may be modified as well as where we must treat it as a black box. We study the classes of queries that can be supported in each case and present efficient implementation techniques for them.



1996 ◽  
Vol 3 (43) ◽  
Author(s):  
Anna Ingólfsdóttir

Imposing certain restrictions on the transition system that defines the behaviour of a process allows us to characterize the readiness semantics of [OH86] by means of black-box testing experiments, or more precisely by lighted button testing experiments [BM92]. As divergence is considered we give the semantics as a preorder, the readiness preorder, which kernel coincides with the readiness equivalence of [OH86]. This leads to a bisimulation like characterization and a modal characterization of the semantics. A concrete language, recursive free CCS without tau, is introduced, a proof system defined and it is shown to be sound and complete with respect to the readiness preorder. In the completeness proof the modal characterization plays an important role as it allows us to prove algebraicity of the preorder purely operationally.



2018 ◽  
Vol 101 ◽  
pp. 50-58 ◽  
Author(s):  
Dinushan Nesan ◽  
Laronna C. Sewell ◽  
Deborah M. Kurrasch


Sign in / Sign up

Export Citation Format

Share Document