Sciweavers

1226 search results - page 152 / 246
» Proofs, Programs and Abstract Complexity
Sort
View
POPL
2010
ACM
15 years 5 months ago
Reconfigurable asynchronous logic automata: (RALA)
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
Neil Gershenfeld, David Dalrymple, Kailiang Chen, ...
143
Voted
ESORICS
2010
Springer
15 years 4 months ago
On Bounding Problems of Quantitative Information Flow
Abstract. Researchers have proposed formal definitions of quantitative information flow based on information theoretic notions such as the Shannon entropy, the min entropy, the gue...
Hirotoshi Yasuoka, Tachio Terauchi
134
Voted
MP
2008
117views more  MP 2008»
15 years 3 months ago
Multiplier convergence in trust-region methods with application to convergence of decomposition methods for MPECs
Abstract. We study piecewise decomposition methods for mathematical programs with equilibrium constraints (MPECs) for which all constraint functions are linear. At each iteration o...
Giovanni Giallombardo, Daniel Ralph
RECONFIG
2009
IEEE
118views VLSI» more  RECONFIG 2009»
15 years 10 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...
110
Voted
FM
2009
Springer
123views Formal Methods» more  FM 2009»
15 years 10 months ago
"Carbon Credits" for Resource-Bounded Computations Using Amortised Analysis
Abstract. Bounding resource usage is important for a number of areas, notably real-time embedded systems and safety-critical systems. In this paper, we present a fully automatic st...
Steffen Jost, Hans-Wolfgang Loidl, Kevin Hammond, ...