242 search results - page 46 / 49 » Computing bounds for fault tolerance using formal techniques |
SOFSEM
2009
Springer
15 years 6 months ago
2009
Springer
Cuckoo hashing was introduced by Pagh and Rodler in 2001 [12]. A set S of n keys is stored in two tables T1 and T2 each of which has m cells of capacity 1 such that constant access...
IFM
2009
Springer
15 years 4 months ago
2009
Springer
We present the new technique of dynamic path reduction (DPR), which allows one to prune redundant paths from the state space of a program under verification. DPR is a very general...
109
click to vote
DDECS
2006
IEEE
15 years 1 months ago
2006
IEEE
Abstract-- Hard real-time systems need methods to determine upper bounds for their execution times, usually called worst-case execution times. Timing anomalies are counterintuitive...
100
click to vote
ICDCS
2000
IEEE
15 years 2 months ago
2000
IEEE
For transmission of continuous media (CM) streams such as audio and video over the Internet, a critical issue is that periodic network overloads cause bursty packet losses. Studie...
DAC
2008
ACM
15 years 10 months ago
2008
ACM
C++ based verification methodologies are now emerging as the preferred method for SOC design. However most of the verification involving the C++ models are simulation based. The c...