Sciweavers

3820 search results - page 230 / 764
» Bounded Model Debugging
Sort
View
INFOCOM
2008
IEEE
15 years 10 months ago
The Inframetric Model for the Internet
—A large amount of algorithms has recently been designed for the Internet under the assumption that the distance defined by the round-trip delay (RTT) is a metric. Moreover, man...
Pierre Fraigniaud, Emmanuelle Lebhar, Laurent Vien...
SPIN
2007
Springer
15 years 9 months ago
SAT-Based Summarization for Boolean Programs
Boolean programs are frequently used to model abstractions of software programs. They have the advantage that reachability properties are decidable, despite the fact that their sta...
Gérard Basler, Daniel Kroening, Georg Weiss...
101
Voted
DATE
2006
IEEE
81views Hardware» more  DATE 2006»
15 years 9 months ago
Lock-free synchronization for dynamic embedded real-time systems
We consider lock-free synchronization for dynamic embedded real-time systems that are subject to resource overloads and arbitrary activity arrivals. We model activity arrival beha...
Hyeonjoong Cho, Binoy Ravindran, E. Douglas Jensen
129
Voted
ISAAC
2004
Springer
87views Algorithms» more  ISAAC 2004»
15 years 8 months ago
Random Access to Advice Strings and Collapsing Results
We propose a model of computation where a Turing machine is given random access to an advice string. With random access, an advice string of exponential length becomes meaningful ...
Jin-yi Cai, Osamu Watanabe
153
Voted
WDAG
2001
Springer
131views Algorithms» more  WDAG 2001»
15 years 8 months ago
The Complexity of Synchronous Iterative Do-All with Crashes
Abstract. The ability to cooperate on common tasks in a distributed setting is key to solving a broad range of computation problems ranging from distributed search such as SETI to ...
Chryssis Georgiou, Alexander Russell, Alexander A....