Sciweavers

5639 search results - page 452 / 1128
» Timed Abstract Non-interference
Sort
View
IPPS
2000
IEEE
15 years 9 months ago
Self-Stabilizing Mutual Exclusion Using Unfair Distributed Scheduler
A self-stabilizing algorithm, regardless of the initial system state, converges in finite time to a set of states that satisfy a legitimacy predicate without the need for explici...
Ajoy Kumar Datta, Maria Gradinariu, Sébasti...
ASYNC
1999
IEEE
110views Hardware» more  ASYNC 1999»
15 years 9 months ago
Verification of Delayed-Reset Domino Circuits Using ATACS
This paper discusses the application of the timing analysis tool ATACS to the high performance, self-resetting and delayed-reset domino circuits being designed at IBM's Austi...
Wendy Belluomini, Chris J. Myers, H. Peter Hofstee
IFL
1999
Springer
108views Formal Methods» more  IFL 1999»
15 years 9 months ago
Optimising Recursive Functions Yielding Multiple Results in Tuples in a Lazy Functional Language
Abstract. We discuss a new optimisation for recursive functions yielding multiple results in tuples for lazy functional languages, like Clean and Haskell. This optimisation improve...
John H. G. van Groningen
ALGOSENSORS
2007
Springer
15 years 8 months ago
Efficient Sensor Network Design for Continuous Monitoring of Moving Objects
We study the problem of localizing and tracking multiple moving targets in wireless sensor networks, from a network design perspective i.e. towards estimating the least possible n...
Sotiris E. Nikoletseas, Paul G. Spirakis
APPROX
2007
Springer
86views Algorithms» more  APPROX 2007»
15 years 8 months ago
Lower Bounds for Swapping Arthur and Merlin
We prove a lower bound for swapping the order of Arthur and Merlin in two-round MerlinArthur games using black-box techniques. Namely, we show that any AM-game requires time (t2 )...
Scott Diehl