Sciweavers

915 search results - page 166 / 183
» Proof labeling schemes
Sort
View
FMCAD
2000
Springer
13 years 12 months ago
Automated Refinement Checking for Asynchronous Processes
Abstract. We consider the problem of refinement checking for asynchronous processes where refinement corresponds to stutter-closed language inclusion. Since an efficient algorithmi...
Rajeev Alur, Radu Grosu, Bow-Yaw Wang
CARDIS
2010
Springer
159views Hardware» more  CARDIS 2010»
13 years 11 months ago
Modeling Privacy for Off-Line RFID Systems
This paper establishes a novel model for RFID schemes where readers are not continuously connected to the back office, but only periodically. Furthermore, adversaries are not only ...
Flavio D. Garcia, Peter van Rossum
CCS
2008
ACM
13 years 10 months ago
Security arguments for the UM key agreement protocol in the NIST SP 800-56A standard
The Unified Model (UM) key agreement protocol is an efficient Diffie-Hellman scheme that has been included in many cryptographic standards, most recently in the NIST SP 80056A sta...
Alfred Menezes, Berkant Ustaoglu
FLOPS
2008
Springer
13 years 9 months ago
Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
Susana Nieva, Jaime Sánchez-Hernánde...
MMNS
2004
81views Multimedia» more  MMNS 2004»
13 years 9 months ago
Providing Seamless Mobility with Competition based Soft Handover Management
As host mobility and radio interference in wireless networks cause packet losses and delays, it is difficult to develop useful mobile real-time media applications. This paper descr...
Johan Kristiansson, Peter Parnes