Sciweavers

1818 search results - page 30 / 364
» Granularity-Adaptive Proof Presentation
Sort
View
TCS
2011
13 years 2 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
ICDCS
1998
IEEE
13 years 11 months ago
A Protocol and Correctness Proofs for Real-Time High-Performance Broadcast Networks
Novel real-time applications require highperformance real-time distributed systems, and therefore high-performance real-time networks. We examine a Hard Real-Time Distributed Mult...
Jean-François Hermant, Gérard Le Lan...
ASM
2010
ASM
13 years 11 months ago
A Refinement-Based Correctness Proof of Symmetry Reduced Model Checking
Symmetry reduction is a model checking technique that can help alleviate the problem of state space explosion, by preventing redundant state space exploration. In previous work, we...
Edd Turner, Michael J. Butler, Michael Leuschel
CARDIS
2008
Springer
146views Hardware» more  CARDIS 2008»
13 years 9 months ago
Provably Secure Grouping-Proofs for RFID Tags
We investigate an application of RFIDs referred to in the literature as group scanning, in which several tags are "simultaneously" scanned by a reader device. Our goal is...
Mike Burmester, Breno de Medeiros, Rossana Motta
DIMVA
2010
13 years 9 months ago
Conqueror: Tamper-Proof Code Execution on Legacy Systems
We present Conqueror, a software-based attestation scheme for tamper-proof code execution on untrusted legacy systems. Beside providing load-time attestation of a piece of code, Co...
Lorenzo Martignoni, Roberto Paleari, Danilo Brusch...