Sciweavers

1432 search results - page 37 / 287
» Executable Protocol Models as a Requirements Engineering Too...
Sort
View
CRYPTO
2006
Springer
134views Cryptology» more  CRYPTO 2006»
15 years 1 months ago
Round-Optimal Composable Blind Signatures in the Common Reference String Model
We build concurrently executable blind signatures schemes in the common reference string model, based on general complexity assumptions, and with optimal round complexity. Namely, ...
Marc Fischlin
CJ
2007
106views more  CJ 2007»
14 years 9 months ago
A Proof of Revised Yahalom Protocol in the Bellare and Rogaway (1993) Model
Although the Yahalom protocol, proposed by Burrows, Abadi, and Needham in 1990, is one of the most prominent key establishment protocols analyzed by researchers from the computer s...
Kim-Kwang Raymond Choo
ISORC
2008
IEEE
15 years 3 months ago
Obstacles in Worst-Case Execution Time Analysis
The analysis of the worst-case execution time (WCET) requires detailed knowledge of the program behavior. In practice it is still not possible to obtain all needed information aut...
Raimund Kirner, Peter P. Puschner
65
Voted
WCET
2007
14 years 10 months ago
Clustering Worst-Case Execution Times for Software Components
For component-based systems, classical techniques for Worst-Case Execution Time (WCET) estimation produce unacceptable overestimations of a components WCET. This is because softwa...
Johan Fredriksson, Thomas Nolte, Andreas Ermedahl,...
TC
2010
14 years 4 months ago
Architectures and Execution Models for Hardware/Software Compilation and Their System-Level Realization
We propose an execution model that orchestrates the fine-grained interaction of a conventional general-purpose processor (GPP) and a high-speed reconfigurable hardware accelerator ...
Holger Lange, Andreas Koch