5084 search results - page 340 / 1017 » Proving Possibility Properties |
187
click to vote
KIVS
2007
Springer
16 years 1 months ago
2007
Springer
In this paper, we introduce two protocols - a routing and a broadcasting protocol - for ad-hoc networks which are based on a new paradigm enabled by the broadcast property of the w...
179
Voted
TACAS
2007
Springer
16 years 1 months ago
2007
Springer
Reasoning about heap-allocated data structures such as linked lists and arrays is challenging. The reachability predicate has proved to be useful for reasoning about the heap in ty...
174
Voted
TAMC
2007
Springer
16 years 1 months ago
2007
Springer
A word w is called synchronizing (recurrent, reset, directable) word of deterministic finite automaton (DFA) if w brings all states of the automaton to an unique state. ˇCerny co...
190
Voted
TGC
2007
Springer
16 years 1 months ago
2007
Springer
Many techniques exist for statically computing properties of the evolution of processes expressed in process algebras. Static analysis has shown how to obtain useful results that c...
181
click to vote
UC
2007
Springer
16 years 1 months ago
2007
Springer
We propose an extension of the traditional λ-calculus in which terms are used to control an outside computing device (quantum computer, DNA computer...). We introduce two new bind...