Sciweavers

1888 search results - page 214 / 378
» Proof theory and computational analysis
Sort
View
RECONFIG
2009
IEEE
118views VLSI» more  RECONFIG 2009»
16 years 1 months ago
Protecting the NOEKEON Cipher against SCARE Attacks in FPGAs by Using Dynamic Implementations
Abstract. Protecting an implementation against Side Channel Analysis for Reverse Engineering (SCARE) attacks is a great challenge and we address this challenge by presenting a fir...
Julien Bringer, Hervé Chabanne, Jean-Luc Da...
FM
2003
Springer
115views Formal Methods» more  FM 2003»
16 years 11 days ago
Model Checking FTA
Safety is increasingly important for software based, critical systems. Fault tree analysis (FTA) is a safety technique from engineering, developed for analyzing and assessing syste...
Andreas Thums, Gerhard Schellhorn
MCU
2004
126views Hardware» more  MCU 2004»
15 years 8 months ago
Universality and Cellular Automata
The classification of discrete dynamical systems that are computationally complete has recently drawn attention in light of Wolfram's "Principle of Computational Equivale...
Klaus Sutner
ATAL
2007
Springer
16 years 1 months ago
Average-case tractability of manipulation in voting via the fraction of manipulators
Recent results have established that a variety of voting rules are computationally hard to manipulate in the worst-case; this arguably provides some guarantee of resistance to man...
Ariel D. Procaccia, Jeffrey S. Rosenschein
MOC
1998
175views more  MOC 1998»
15 years 6 months ago
Convergence of a non-stiff boundary integral method for interfacial flows with surface tension
Boundary integral methods to simulate interfacial flows are very sensitive to numerical instabilities. In addition, surface tension introduces nonlinear terms with high order spat...
Héctor D. Ceniceros, Thomas Y. Hou