Sciweavers

7820 search results - page 319 / 1564
» Formalization of Time and Space
Sort
View
CSFW
2010
IEEE
15 years 11 months ago
Vulnerability Bounds and Leakage Resilience of Blinded Cryptography under Timing Attacks
—We establish formal bounds for the number of min-entropy bits that can be extracted in a timing attack against a cryptosystem that is protected by blinding, the state-of-the art...
Boris Köpf, Geoffrey Smith
FTCS
1998
89views more  FTCS 1998»
15 years 8 months ago
The Timed Asynchronous Distributed System Model
Abstract-- We propose a formal definition for the timed asynchronous distributed system model. We present extensive measurements of actual message and process scheduling delays and...
Flaviu Cristian, Christof Fetzer
TOPNOC
2008
15 years 7 months ago
Time Recursive Petri Nets
Recursive Petri Nets (RPNs) allow to design and analyze complex discrete event systems. Indeed, RPNs enable to model patterns of discrete event systems related to the dynamic struc...
Djaouida Dahmani, Jean-Michel Ilié, Malika ...
ICST
2008
IEEE
16 years 1 months ago
Scheduling Timed Modules for Correct Resource Sharing
Real-time embedded systems typically include concurrent tasks of different priorities with time-dependent operations accessing common resources. In this context, unsynchronized pa...
Cristina Cerschi Seceleanu, Paul Pettersson, Hans ...
CAV
2007
Springer
157views Hardware» more  CAV 2007»
16 years 1 months ago
An Accelerated Algorithm for 3-Color Parity Games with an Application to Timed Games
Three-color parity games capture the disjunction of a B¨uchi and a co-B¨uchi condition. The most efficient known algorithm for these games is the progress measures algorithm by ...
Luca de Alfaro, Marco Faella