Sciweavers

793 search results - page 137 / 159
» Protocol Modeling with Model Program Composition
Sort
View
HIPC
2007
Springer
15 years 8 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
TSP
2008
107views more  TSP 2008»
15 years 4 months ago
Opportunistic Spectrum Access via Periodic Channel Sensing
The problem of opportunistic access of parallel channels occupied by primary users is considered. Under a continuous-time Markov chain modeling of the channel occupancy by the prim...
Qing Zhao, Stefan Geirhofer, Lang Tong, Brian M. S...
CAV
2007
Springer
118views Hardware» more  CAV 2007»
15 years 10 months ago
Local Proofs for Global Safety Properties
This paper explores the concept of locality in proofs of global safety properties of asynchronously composed, multi-process programs. Model checking on the full state space is ofte...
Ariel Cohen 0002, Kedar S. Namjoshi
ICALP
2005
Springer
15 years 10 months ago
Computationally Sound Implementations of Equational Theories Against Passive Adversaries
In this paper we study the link between formal and cryptographic models for security protocols in the presence of a passive adversary. In contrast to other works, we do not conside...
Mathieu Baudet, Véronique Cortier, Steve Kr...
BIRTHDAY
2009
Springer
15 years 9 months ago
Pervasive Theory of Memory
For many aspects of memory theoretical treatment already exists, in particular for: simple cache construction, store buers and store buer forwarding, cache coherence protocols, o...
Ulan Degenbaev, Wolfgang J. Paul, Norbert Schirmer