44 search results - page 3 / 9 » Verifying liveness for asynchronous programs |
SAS
2012
Springer
11 years 7 months ago
2012
Springer
Programming distributed and reactive asynchronous systems is complex due to the lack of synchronization between concurrently executing tasks, and arbitrary delay of message-based c...
SIGSOFT
2009
ACM
14 years 6 months ago
2009
ACM
A large number of industrial concurrent programs are being designed based on a model which combines threads with event-based communication. These programs consist of several threa...
CONCUR
2006
Springer
13 years 9 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...
TIME
2008
IEEE
13 years 11 months ago
2008
IEEE
In this paper we consider the specification and verification of infinite-state systems using temporal logic. In particular, we describe parameterised systems using a new variet...
ICALP
2005
Springer
13 years 10 months ago
2005
Springer
This paper presents a new protocol for atomic broadcast in an asynchronous network with a maximal number of Byzantine failures. It guarantees both safety and liveness without maki...