Sciweavers

138 search results - page 21 / 28
» Model Checking Round-Based Distributed Algorithms
Sort
View
WWW
2005
ACM
15 years 10 months ago
Web service interfaces
We present a language for specifying web service interfaces. A web service interface puts three kinds of constraints on the users of the service. First, the interface specifies th...
Dirk Beyer, Arindam Chakrabarti, Thomas A. Henzing...
SIGSOFT
2009
ACM
15 years 10 months ago
Symbolic pruning of concurrent program executions
We propose a new algorithm for verifying concurrent programs, which uses concrete executions to partition the program into a set of lean partitions called concurrent trace program...
Chao Wang, Swarat Chaudhuri, Aarti Gupta, Yu Yang
80
Voted
CAV
2009
Springer
176views Hardware» more  CAV 2009»
15 years 10 months ago
PAT: Towards Flexible Verification under Fairness
Recent development on distributed systems has shown that a variety of fairness constraints (some of which are only recently defined) play vital roles in designing self-stabilizing ...
Jun Sun 0001, Yang Liu 0003, Jin Song Dong, Jun Pa...
102
Voted
HIPC
2007
Springer
15 years 1 months ago
Accomplishing Approximate FCFS Fairness Without Queues
First Come First Served (FCFS) is a policy that is accepted for implementing fairness in a number of application domains such as scheduling in Operating Systems, scheduling web req...
K. Subramani, Kamesh Madduri
CIIT
2004
104views Communications» more  CIIT 2004»
14 years 10 months ago
Semi-automatic compensation of the propagation delay in fault-tolerant systems
In control systems the jitter is a major problem since in a time-varying system the theoretical results for analysis and design of time-invariant systems cannot be used directly. ...
Thomas Losert, Wilfried Elmenreich, Martin Schlage...