43 search results - page 2 / 9 » Liveness with Invisible Ranking |
HT
2010
ACM
13 years 3 months ago
2010
ACM
In this poster we present the current results of several experiments in which we analyzed whether spamming Google Scholar is possible. Our results show, it is possible: We ,,impro...
CAV
2010
Springer
13 years 8 months ago
2010
Springer
Systems ought to behave reasonably even in circumstances that are not anticipated in their specifications. We propose a definition of robustness for liveness specifications which p...
AINA
2005
IEEE
13 years 11 months ago
2005
IEEE
More and more sensor networks will be deployed in the place where people are living, studying, and working. These sensor networks bring us the convenience of accessing information...
CONCUR
2006
Springer
13 years 10 months ago
2006
Springer
Abstract. We present a new method for proving liveness and termination properties for fair concurrent programs, which does not rely on finding a ranking function or on computing th...
CSL
2004
Springer
13 years 11 months ago
2004
Springer
Abstract. For nested or heterogeneous datatypes, terminating recursion schemes considered so far have been instances of iteration, excluding efficient definitions of fixed-point ...