Sciweavers

10707 search results - page 354 / 2142
» Designing executable abstractions
Sort
View
ISORC
2011
IEEE
14 years 8 months ago
A Time-Predictable Object Cache
—Static cache analysis for data allocated on the heap is practically impossible for standard data caches. We propose a distinct object cache for heap allocated data. The cache is...
Martin Schoeberl
KBSE
2008
IEEE
15 years 11 months ago
Inferring Finite-State Models with Temporal Constraints
Finite state machine-based abstractions of software behaviour are popular because they can be used as the basis for a wide range of (semi-) automated verification and validation ...
Neil Walkinshaw, Kirill Bogdanov
EDOC
2006
IEEE
15 years 11 months ago
Trust Assessment Using Provenance in Service Oriented Applications
Workflow forms a key part of many existing Service Oriented applications, involving the integration of services that may be made available at distributed sites. It is possible ng...
Shrija Rajbhandari, Arnaud Contes, Omer F. Rana, V...
FPL
2009
Springer
105views Hardware» more  FPL 2009»
15 years 9 months ago
Towards a viable out-of-order soft core: Copy-Free, checkpointed register renaming
As a step torward a viable, single-issue out-of-order soft core, this work presents Copy-Free Checkpointing (CFC), an FPGA-friendly register renaming design. CFC supports speculat...
Kaveh Aasaraai, Andreas Moshovos
177
Voted
FOCS
2010
IEEE
15 years 2 months ago
On the Computational Complexity of Coin Flipping
Coin flipping is one of the most fundamental tasks in cryptographic protocol design. Informally, a coin flipping protocol should guarantee both (1) Completeness: an honest executi...
Hemanta K. Maji, Manoj Prabhakaran, Amit Sahai