Sciweavers

761 search results - page 90 / 153
» Concise and Consistent Naming
Sort
View
LICS
1993
IEEE
14 years 2 months ago
Verifying Programs with Unreliable Channels
We consider the veri cation of a particular class of in nite-state systems, namely systems consisting of nite-state processes that communicate via unbounded lossy FIFO channels. T...
Parosh Aziz Abdulla, Bengt Jonsson
ISCAS
1994
IEEE
138views Hardware» more  ISCAS 1994»
14 years 2 months ago
High-Throughput Data Compressor Designs Using Content Addressable Memory
This paper presents a novel VLSI architecture for high-speed data compressor designs which implement the well-known LZ77 algorithm. The architecture mainly consists of three units...
Ren-Yang Yang, Chen-Yi Lee
ESORICS
1994
Springer
14 years 2 months ago
On the Expressive Power of the Unary Transformation Model
The Transformation Model TRM was recently introduced 10 in the literature by Sandhu and Ganta. TRM is based on the concept of transformation of rights. The propagation of access ri...
Ravi S. Sandhu, Srinivas Ganta
PODC
1993
ACM
14 years 2 months ago
A Lower Bound on Wait-Free Counting
A counting protocol (mod m) consists of shared memory bits - referred to as the counter - and of a procedure for incrementing the counter value by 1 (mod m). The procedure may be ...
Shlomo Moran, Gadi Taubenfeld
ACISP
2007
Springer
14 years 2 months ago
A New Strategy for Finding a Differential Path of SHA-1
In this paper, we propose a new construction algorithm for finding differential paths of Round 1 of SHA-1 for use in the collision search attack. Generally, the differential path o...
Jun Yajima, Yu Sasaki, Yusuke Naito, Terutoshi Iwa...