Mostrando recursos 281 - 300 de 28.944

  1. Prototyping Secure Triple Track Logic (STTL) Robustness Against DPA & DEMA on FPGA

    Lomné, Victor; Soares, Rafael,; Ordas, Thomas; Maurine, Philippe; Torres, Lionel; Robert, Michel
    International audience

  2. Electrical Analysis of a Domino Logic Cell with GOS Faults

    Comte, Mariane; Ohtake, Satoshi; Fujiwara, Hideo; Renovell, Michel
    International audience

  3. A Model for Resistive Open Recursivity in CMOS Random Logic

    Renovell, Michel; Comte, Mariane; Houarche, Nicolas; Polian, Ilia; Engelke, Piet; Becker, Bernd
    International audience

  4. LIFTING: An open source logic simulator

    Bosio, Alberto; Di Natale, Giorgio
    International audience

  5. A Logic Diagnosis Approach for Sequential Circuits

    Benabboud, Youssef; Bosio, Alberto; Dilillo, Luigi; Girard, Patrick; Pravossoudovitch, Serge; Virazel, Arnaud; Bouzaida, Laroussi; Izaute, Isabelle
    International audience

  6. A Comprehensive Framework for Logic Diagnosis of Arbitrary Defects

    Bosio, Alberto; Girard, Patrick; Pravossoudovitch, Serge; Virazel, Arnaud
    International audience

  7. SoC Yield Improvement - Using TMR Architectures for Manufacturing Defect Tolerance in Logic Cores

    Vial, Julien; Virazel, Arnaud; Bosio, Alberto; Dilillo, Luigi; Girard, Patrick; Pravossoudovitch, Serge
    International audience

  8. Design of MRAM Based Logic Circuits and its Applications

    Zhao, Weisheng; Torres, Lionel; Guillemenet, Yoann; Cargnini, Luís Vitório; Lakys, Yahya; Klein, Jacques-Olivier; Ravelosona, Dafine; Sassatelli, Gilles; Chappert, Claude
    International audience

  9. Secure Triple Track Logic Robustness Against Differential Power and EM Analyses

    Lomné, Victor; Dehbaoui, Amine; Ordas, Thomas; Maurine, Philippe; Torres, Lionel; Robert, Michel; Soares, Rafael,; Calazans, Ney; Moraes, Fernando,
    International audience

  10. Low-power SRAMs Power Mode Control Logic: Failure Analysis and Test Solutions

    Zordan, Leonardo; Bosio, Alberto; Dilillo, Luigi; Girard, Patrick; Todri, Aida; Virazel, Arnaud; Badereddine, Nabil
    International audience

  11. A New Recovery Scheme Against Short-to-Long Duration Transient Faults in Combinational Logic

    Possamai Bastos, Rodrigo; Di Natale, Giorgio; Flottes, Marie-Lise; Lu, Feng; Rouzeyre, Bruno
    International audience

  12. A Novel Hardware Logic Encryption Technique for thwarting Illegal Overproduction and Hardware Trojans

    Dupuis, Sophie; Ba, Papa-Sidy; Di Natale, Giorgio; Flottes, Marie-Lise; Rouzeyre, Bruno
    International audience

  13. $rec.titulo

    Piccolomini d'Aragona, Antonio
    International audience

  14. Practical Subtyping for System F with Sized (Co-)Induction

    Lepigre, Rodolphe; Raffalli, Christophe
    We present a rich type system with subtyping for an extension of System F. Our type constructors include sum and product types, universal and existential quantifiers, inductive and coinductive types. The latter two size annotations allowing the preservation of size invariants. For example it is possible to derive the termination of the quicksort by showing that partitioning a list does not increase its size. The system deals with complex programs involving mixed induction and coinduction, or even mixed (co-)induction and polymorphism (as for Scott-encoded datatypes). One of the key ideas is to completely separate the induction on sizes from the...

  15. A Regular Metric Temporal Logic

    Krishna, Shankara Narayanan; Madnani, Khushraj; Pandya, Paritosh
    We study an extension of MTL in pointwise time with regular expression guarded modality Reg I (re) where re is a regular expression over subformulae. We study the decidability and ex-pressiveness of this extension, called RegMTL, as well as its fragment SfrMTL where only star-free extended regular expressions are allowed. Using the technique of temporal projections, we show that RegMTL has decidable satisfiability by giving an equisatisfiable reduction to MTL. Moreover, we identify a subset MITL[UReg] for which our (polynomial time computable) equi-satisfiable reduction gives rise to formulae of MITL. Thus, MITL[UReg] has elementary decidability. As our second main result,...

  16. XML schema, tree logic and sheaves automata

    Dal Zilio, Silvano; Lugiez, Denis
    XML documents may be roughly described as unranked, ordered trees and it is therefore natural to use tree automata to process or validate them. This idea has already been successfully applied in the context of Document Type Definition (DTD), the simplest standard for defining document validity, but additional work is needed to take into account XML Schema, a more advanced standard, for which regular tree automata are not satisfactory. In this paper, we introduce Sheaves Logic (SL), a new tree logic that extends the syntax of the – recursion-free fragment of – W3C XML Schema Definition Language (WXS). Then, we...

  17. The quasiequational theory of relational lattices, in the pure lattice signature (embeddability into relational lattices is undecidable)

    Santocanale, Luigi
    The natural join and the inner union operations combine relations of a database. Tropashko and Spight realized that these two operations are themeet and join operations in a class of lattices, known by now as the relational lattices. They proposed then lattice theory as an algebraic approach to thetheory of databases alternative to the relational algebra. Litak et al. proposed an axiomatization of relational lattices over the signature that extends thepure lattice signature with a constant and argued that the quasiequational theory of relational lattices over this extended signature is undecidable.We prove in this paper that embeddability is undecidable for...

  18. Learning Commonalities in RDF and SPARQL

    El Hassad, Sara; Goasdoué, François; Jaudoin, Hélène
    Finding commonalities between descriptions of data or knowledge is a fundamental task in Machine Learning. The formal notion characterizing precisely such commonalities is known as least general generalization of descriptions and was introduced by G. Plotkin in the early 70's, in First Order Logic. Identifying least general generalizations has a large scope of database applications ranging from query optimization (e.g., to share commonalities between queries in view selection or multi-query optimization) to recommendation in social networks (e.g., to establish connections between users based on their commonalities between profiles or searches). To the best of our knowledge, this is the first...

  19. Patrimonio minero y turismo de proximidad: explorando sinergias

    Llurdés, Joan Carles; Diaz Soria, Inmaculada; Romagosa, Francesc
    El número de experiencias de turismo de patrimonio minero en España ha experimentado un notable crecimiento durante los últimos años, contribuyendo con ello a revalorizar un recurso que ha conseguido hacerse un pequeño hueco en un contexto turístico cada vez más competitivo. Simultáneamente, también ha ido ganando aceptación el denominado turismo de proximidad, en la medida que favorece la revalorización del patrimonio local por la propia población. Partiendo de la idea de que ambas formas de turismo son complementarias, es muy lógico querer encontrar sinergias. El artículo analiza el caso concreto del Parque Cultural de la Montaña de Sal, en...

  20. $rec.titulo

    Perchy, Yamil Salim

Aviso de cookies: Usamos cookies propias y de terceros para mejorar nuestros servicios, para análisis estadístico y para mostrarle publicidad. Si continua navegando consideramos que acepta su uso en los términos establecidos en la Política de cookies.