Electrical modeling of the photoelectric effect induced by a pulsed laser applied to an SRAM cell

International audienceThis abstract presents an electrical model of an SRAM cell exposed to a pulsed Photoelectrical Laser Stimulation (PLS), based on our past model of MOS transistor under laser illumination. The validity of our model is assessed by the very good correlation obtained between measurements and electrical simulation. These simulations are capable to explain some specific points. For example, in theory, a SRAM cell under PLS have four sensitive areas. But in measurements only three areas were revealed. A hypothesis was presented in this paper and confirm by electrical simulation. The specific topology of the cell masks one sensitive area. Therefore the electrical model could be used as a tool of characterization of a CMOS circuits under PLS

Electrical model of an NMOS body biased structure in triple-well technology under photoelectric laser stimulation

International audience— This study is driven by the need to optimize failure analysis methodologies based on laser/silicon interactions with an integrated circuit using a triple-well process. It is therefore mandatory to understand the behavior of elementary devices to laser illumination, in order to model and predict the behavior of more complex circuits. This paper presents measurements of the photoelectric currents induced by a pulsed-laser on an NMOS transistor in triple-well Psubstrate/DeepNwell/Pwell structure dedicated to low power body biasing techniques. This evaluation compares the triple-well structure to a classical Psubstrate-only structure of an NMOS transistor. It reveals the possible activation change of the bipolar transistors. Based on these experimental measurements, an electrical model is proposed that makes it possible to simulate the effects induced by photoelectric laser stimulation

A Simplex-Based Extension of Fourier-Motzkin for Solving Linear Integer Arithmetic

International audienceThis paper describes a novel decision procedure for quantifier-free linear integer arithmetic. Standard techniques usually relax the initial problem to the rational domain and then proceed either by projection (e.g. Omega-Test) or by branching/cutting methods (branch-and-bound, branch-and-cut, Gomory cuts). Our approach tries to bridge the gap between the two techniques: it interleaves an exhaustive search for a model with bounds inference. These bounds are computed provided an oracle capable of finding constant positive linear combinations of affine forms. We also show how to design an efficient oracle based on the Simplex procedure. Our algorithm is proved sound, complete, and terminating and is implemented in the Alt-Ergo theorem prover. Experimental results are promising and show that our approach is competitive with state-of-the-art SMT solvers

Laser Fault Injection into SRAM cells: Picosecond versus Nanosecond pulses

International audience—Laser fault injection into SRAM cells is a widely used technique to perform fault attacks. In previous works, Roscian and Sarafianos studied the relations between the layout of the cell, its different laser-sensitive areas and their associated fault model using 50 ns duration laser pulses. In this paper, we report similar experiments carried out using shorter laser pulses (30 ps duration instead of 50 ns). Laser-sensitive areas that did not appear at 50 ns were observed. Additionally, these experiments confirmed the validity of the bit-set/bit-reset fault model over the bit-flip one. We also propose an upgrade of the simulation model they used to take into account laser pulses in the picosecond range. Finally, we performed additional laser fault injection experiments on the RAM memory of a microcontroller to validate the previous results

Succinct Representations for Abstract Interpretation

Abstract interpretation techniques can be made more precise by distinguishing paths inside loops, at the expense of possibly exponential complexity. SMT-solving techniques and sparse representations of paths and sets of paths avoid this pitfall. We improve previously proposed techniques for guided static analysis and the generation of disjunctive invariants by combining them with techniques for succinct representations of paths and symbolic representations for transitions based on static single assignment. Because of the non-monotonicity of the results of abstract interpretation with widening operators, it is difficult to conclude that some abstraction is more precise than another based on theoretical local precision results. We thus conducted extensive comparisons between our new techniques and previous ones, on a variety of open-source packages.Comment: Static analysis symposium (SAS), Deauville : France (2012

New results on rewrite-based satisfiability procedures

Program analysis and verification require decision procedures to reason on theories of data structures. Many problems can be reduced to the satisfiability of sets of ground literals in theory T. If a sound and complete inference system for first-order logic is guaranteed to terminate on T-satisfiability problems, any theorem-proving strategy with that system and a fair search plan is a T-satisfiability procedure. We prove termination of a rewrite-based first-order engine on the theories of records, integer offsets, integer offsets modulo and lists. We give a modularity theorem stating sufficient conditions for termination on a combinations of theories, given termination on each. The above theories, as well as others, satisfy these conditions. We introduce several sets of benchmarks on these theories and their combinations, including both parametric synthetic benchmarks to test scalability, and real-world problems to test performances on huge sets of literals. We compare the rewrite-based theorem prover E with the validity checkers CVC and CVC Lite. Contrary to the folklore that a general-purpose prover cannot compete with reasoners with built-in theories, the experiments are overall favorable to the theorem prover, showing that not only the rewriting approach is elegant and conceptually simple, but has important practical implications.Comment: To appear in the ACM Transactions on Computational Logic, 49 page

Formalising the Continuous/Discrete Modeling Step

Formally capturing the transition from a continuous model to a discrete model is investigated using model based refinement techniques. A very simple model for stopping (eg. of a train) is developed in both the continuous and discrete domains. The difference between the two is quantified using generic results from ODE theory, and these estimates can be compared with the exact solutions. Such results do not fit well into a conventional model based refinement framework; however they can be accommodated into a model based retrenchment. The retrenchment is described, and the way it can interface to refinement development on both the continuous and discrete sides is outlined. The approach is compared to what can be achieved using hybrid systems techniques.Comment: In Proceedings Refine 2011, arXiv:1106.348

PLK1 facilitates chromosome biorientation by suppressing centromere disintegration driven by BLM-mediated unwinding and spindle pulling

Centromeres provide a pivotal function for faithful chromosome segregation. They serve as a foundation for the assembly of the kinetochore complex and spindle connection, which is essential for chromosome biorientation. Cells lacking Polo-like kinase 1 (PLK1) activity suffer severe chromosome alignment defects, which is believed primarily due to unstable kinetochore-microtubule attachment. Here, we reveal a previously undescribed mechanism named ‘centromere disintegration’ that drives chromosome misalignment in PLK1-inactivated cells. We find that PLK1 inhibition does not necessarily compromise metaphase establishment, but instead its maintenance. We demonstrate that this is caused by unlawful unwinding of DNA by BLM helicase at a specific centromere domain underneath kinetochores. Under bipolar spindle pulling, the distorted centromeres are promptly decompacted into DNA threadlike molecules, leading to centromere rupture and whole-chromosome arm splitting. Consequently, chromosome alignment collapses. Our study unveils an unexpected role of PLK1 as a chromosome guardian to maintain centromere integrity for chromosome biorientation

Blocking TLR7- and TLR9-mediated IFN-α Production by Plasmacytoid Dendritic Cells Does Not Diminish Immune Activation in Early SIV Infection

Persistent production of type I interferon (IFN) by activated plasmacytoid dendritic cells (pDC) is a leading model to explain chronic immune activation in human immunodeficiency virus (HIV) infection but direct evidence for this is lacking. We used a dual antagonist of Toll-like receptor (TLR) 7 and TLR9 to selectively inhibit responses of pDC but not other mononuclear phagocytes to viral RNA prior to and for 8 weeks following pathogenic simian immunodeficiency virus (SIV) infection of rhesus macaques. We show that pDC are major but not exclusive producers of IFN-α that rapidly become unresponsive to virus stimulation following SIV infection, whereas myeloid DC gain the capacity to produce IFN-α, albeit at low levels. pDC mediate a marked but transient IFN-α response in lymph nodes during the acute phase that is blocked by administration of TLR7 and TLR9 antagonist without impacting pDC recruitment. TLR7 and TLR9 blockade did not impact virus load or the acute IFN-α response in plasma and had minimal effect on expression of IFN-stimulated genes in both blood and lymph node. TLR7 and TLR9 blockade did not prevent activation of memory CD4+ and CD8+ T cells in blood or lymph node but led to significant increases in proliferation of both subsets in blood following SIV infection. Our findings reveal that virus-mediated activation of pDC through TLR7 and TLR9 contributes to substantial but transient IFN-α production following pathogenic SIV infection. However, the data indicate that pDC activation and IFN-α production are unlikely to be major factors in driving immune activation in early infection. Based on these findings therapeutic strategies aimed at blocking pDC function and IFN-α production may not reduce HIV-associated immunopathology. © 2013 Kader et al

A Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded Problems

We present a combination of the Mixed-Echelon-Hermite transformation and the Double-Bounded Reduction for systems of linear mixed arithmetic that preserve satisfiability and can be computed in polynomial time. Together, the two transformations turn any system of linear mixed constraints into a bounded system, i.e., a system for which termination can be achieved easily. Existing approaches for linear mixed arithmetic, e.g., branch-and-bound and cuts from proofs, only explore a finite search space after application of our two transformations. Instead of generating a priori bounds for the variables, e.g., as suggested by Papadimitriou, unbounded variables are eliminated through the two transformations. The transformations orient themselves on the structure of an input system instead of computing a priori (over-)approximations out of the available constants. Experiments provide further evidence to the efficiency of the transformations in practice. We also present a polynomial method for converting certificates of (un)satisfiability from the transformed to the original system