34 search results - page 2 / 7 » Liveness with Incomprehensible Ranking |
SIGSOFT
2010
ACM
12 years 11 months ago
2010
ACM
Web service applications are dynamic, highly distributed, and loosely coupled orchestrations of services which are notoriously difficult to debug. In this paper, we describe a use...
CAV
2010
Springer
13 years 7 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...
CONCUR
2006
Springer
13 years 8 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...
IJFCS
2007
13 years 4 months ago
2007
Ranking Abstraction Ittai Balaban Computer Science Department, New York University, 251 Mercer St., New York, New York 10012, United States and Amir Pnueli Computer Science Departm...
ECIR
2009
Springer
14 years 1 months ago
2009
Springer
Many different ranking algorithms based on content and context have been used in web search engines to find pages based on a user query. Furthermore, to achieve better performance ...