534 search results - page 81 / 107 » Proving Termination of Rewrite Systems Using Bounds |
ICC
2007
IEEE
14 years 3 months ago
2007
IEEE
Abstract— In recent years performance prediction for communication systems utilizing iteratively decodable codes has been of considerable interest. There have been significant b...
ECRTS
2005
IEEE
14 years 2 months ago
2005
IEEE
We present a wait-free protocol for the single-writer, multiple-reader problem in small-memory, embedded real-time systems. We analytically establish that our protocol requires le...
SSS
2009
Springer
14 years 1 months ago
2009
Springer
We propose a communication scheme for GALS systems with independent but approximately synchronized clock sources, which guarantees high-speed metastability-free communication betwe...
CDC
2008
IEEE
13 years 10 months ago
2008
IEEE
The problem of characterizing lower bounds on data-rates needed for closed loop stability has been solved in a variety of settings. However, the available results lead to coding s...
FSTTCS
2003
Springer
14 years 2 months ago
2003
Springer
Tagging schemes have been used in security protocols to ensure that the analysis of such protocols can work with messages of bounded length. When the set of nonces is bounded, this...