Sciweavers

3820 search results - page 565 / 764
» Bounded Model Debugging
Sort
View
INFOCOM
2005
IEEE
15 years 8 months ago
Online time-constrained scheduling in linear networks
— We consider the problem of scheduling a sequence of packets over a linear network, where every packet has a source and a target, as well as a release time and a deadline by whi...
Joseph Naor, Adi Rosén, Gabriel Scalosub
ACNS
2005
Springer
134views Cryptology» more  ACNS 2005»
15 years 8 months ago
Dynamic k-Times Anonymous Authentication
k-times anonymous authentication (k-TAA) schemes allow members of a group to be anonymously authenticated by application providers for a bounded number of times. k-TAA has applicat...
Lan Nguyen, Reihaneh Safavi-Naini
FSTTCS
2005
Springer
15 years 8 months ago
Reachability Analysis of Multithreaded Software with Asynchronous Communication
We introduce asynchronous dynamic pushdown networks (ADPN), a new model for multithreaded programs in which pushdown systems communicate via shared memory. ADPN generalizes both CP...
Ahmed Bouajjani, Javier Esparza, Stefan Schwoon, J...
HIPEAC
2005
Springer
15 years 8 months ago
Enhancing Network Processor Simulation Speed with Statistical Input Sampling
Abstract. While cycle-accurate simulation tools have been widely used in modeling high-performance processors, such an approach can be hindered by the increasing complexity of the ...
Jia Yu, Jun Yang 0002, Shaojie Chen, Yan Luo, Laxm...
120
Voted
ICALP
2005
Springer
15 years 8 months ago
Basing Cryptographic Protocols on Tamper-Evident Seals
Abstract. In this paper we attempt to formally study two very intuitive physical models: sealed envelopes and locked boxes, often used as illustrations for common cryptographic ope...
Tal Moran, Moni Naor