Sciweavers

1453 search results - page 254 / 291
» State and history in operating systems
Sort
View
69
Voted
CAV
2007
Springer
86views Hardware» more  CAV 2007»
15 years 4 months ago
From Liveness to Promptness
Liveness temporal properties state that something “good” eventually happens, e.g., every request is eventually granted. In Linear Temporal Logic (LTL), there is no a priori bo...
Orna Kupferman, Nir Piterman, Moshe Y. Vardi
96
Voted
CONCUR
2007
Springer
15 years 4 months ago
Fair Cooperative Multithreading
Abstract. We propose a new operational model for shared variable concurrency, in the context of a concurrent, higher-order imperative language `a la ML. In our model the scheduling...
Gérard Boudol
99
Voted
RTA
2007
Springer
15 years 4 months ago
Rewriting Approximations for Fast Prototyping of Static Analyzers
This paper shows how to construct static analyzers using tree automata and rewriting techniques. Starting from a term rewriting system representing the operational semantics of the...
Yohan Boichut, Thomas Genet, Thomas P. Jensen, Luk...
87
Voted
AINA
2006
IEEE
15 years 4 months ago
Simulation Architecture for Data Processing Algorithms in Wireless Sensor Networks
Abstract— Wireless sensor networks, by providing an unprecedented way of interacting with the physical environment, have become a hot topic for research over the last few years. ...
Yann-Aël Le Borgne, Mehdi Moussaid, Gianluca ...
101
Voted
VALUETOOLS
2006
ACM
176views Hardware» more  VALUETOOLS 2006»
15 years 4 months ago
How to solve large scale deterministic games with mean payoff by policy iteration
Min-max functions are dynamic programming operators of zero-sum deterministic games with finite state and action spaces. The problem of computing the linear growth rate of the or...
Vishesh Dhingra, Stephane Gaubert