Sciweavers

223 search results - page 11 / 45
» Proving Termination by Bounded Increase
Sort
View
DAC
1995
ACM
14 years 2 months ago
The Elmore Delay as a Bound for RC Trees with Generalized Input Signals
The Elmore delay is an extremely popular delay metric, particularly for RC tree analysis. The widespread usage of this metric is mainly attributable to it being the most accurate ...
Rohini Gupta, Byron Krauter, Bogdan Tutuianu, John...
MTV
2003
IEEE
154views Hardware» more  MTV 2003»
14 years 4 months ago
Tuning the VSIDS Decision Heuristic for Bounded Model Checking
Bounded Model Checking (BMC) techniques have been used for formal hardware verification, with the help of tools such as GRASP (Generic search Algorithm for Satisfiability Proble...
Ohad Shacham, Emmanuel Zarpas

Publication
545views
14 years 7 months ago
Reid et al.'s Distance Bounding Protocol and Mafia Fraud Attacks over Noisy Channels
Distance bounding protocols are an effective countermeasure against relay attacks including distance fraud, mafia fraud and terrorist fraud attacks. Reid et al. proposed the first ...
A. Mitrokotsa, C. Dimitrakakis, P. Peris-Lopez, J....
CORR
2006
Springer
95views Education» more  CORR 2006»
13 years 10 months ago
SAT Solving for Argument Filterings
Abstract. This paper introduces a propositional encoding for lexicographic path orders in connection with dependency pairs. This facilitates the application of SAT solvers for term...
Michael Codish, Peter Schneider-Kamp, Vitaly Lagoo...
CDC
2010
IEEE
122views Control Systems» more  CDC 2010»
13 years 5 months ago
A lower bound for distributed averaging algorithms on the line graph
We derive lower bounds on the convergence speed of a widely used class of distributed averaging algorithms. In particular, we prove that any distributed averaging algorithm whose ...
Alexander Olshevsky, John N. Tsitsiklis