96 search results - page 5 / 20 » Reasoning About Systems with Transition Fairness |
VMCAI
2007
Springer
13 years 12 months ago
2007
Springer
Abstraction frameworks use under-approximating transitions in order to prove existential properties of concrete systems. Under-approximating transifer to the concrete states that c...
WDAG
2010
Springer
13 years 4 months ago
2010
Springer
Abstract. We argue that failure detectors encapsulate fairness. Fairness is a measure of the number of steps a process takes relative to another processes and/or messages in transi...
CSL
2004
Springer
13 years 11 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
INTELLCOMM
2004
Springer
13 years 11 months ago
2004
Springer
Web prefetching techniques have pointed to be especially important to reduce web latencies and, consequently, an important set of works can be found in the open literature. But, in...
SIGSOFT
2003
ACM
14 years 6 months ago
2003
ACM
State machine based formalisms such as labelled transition systems (LTS) are generally assumed to be complete descriptions m behaviour at some level of abstraction: if a labelled ...