Sciweavers

788 search results - page 66 / 158
» Symbolic Equivalence Checking
Sort
View
115
Voted
LICS
2006
IEEE
15 years 9 months ago
Temporal Logics and Model Checking for Fairly Correct Systems
We motivate and study a generic relaxation of correctness of reactive and concurrent systems with respect to a temporal specification. We define a system to be fairly correct if...
Daniele Varacca, Hagen Völzer
113
Voted
OSDI
2008
ACM
16 years 3 months ago
KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs
We present a new symbolic execution tool, KLEE, capable of automatically generating tests that achieve high coverage on a diverse set of complex and environmentally-intensive prog...
Cristian Cadar, Daniel Dunbar, Dawson R. Engler
130
Voted
MCU
1998
119views Hardware» more  MCU 1998»
15 years 4 months ago
DNA Computing Based on Splicing: Universality Results
The paper extends some of the most recently obtained results on the computational universality of speci c variants of H systems (e.g. with regular sets of rules) and proves that we...
Gheorghe Paun
162
Voted
CORR
2010
Springer
261views Education» more  CORR 2010»
15 years 27 days ago
Analysis of Quasi-Cyclic LDPC codes under ML decoding over the erasure channel
In this paper, we show that over the binary erasure channel, Quasi-Cyclic LDPC codes can efficiently accommodate the hybrid iterative/ML decoding. We demonstrate that the quasicycl...
Mathieu Cunche, Valentin Savin, Vincent Roca
131
Voted
ICALP
2005
Springer
15 years 9 months ago
Password-Based Encryption Analyzed
Abstract. The use of passwords in security protocols is particularly delicate because of the possibility of off-line guessing attacks. We study password-based protocols in the cont...
Martín Abadi, Bogdan Warinschi