328 search results - page 40 / 66 » Proving Termination of Communicating Programs |
EMSOFT
2006
Springer
13 years 11 months ago
2006
Springer
We present a deadlock avoidance algorithm for distributed systems that guarantees liveness. Deadlock avoidance in distributed systems is a hard problem and general solutions are c...
IFIP
2004
Springer
14 years 1 months ago
2004
Springer
We propose a language that allows agents to distribute data with usage policies in a decentralized architecture. In our framework, the compliance with usage policies is not enforce...
POPL
2002
ACM
14 years 8 months ago
2002
ACM
Dataflow analyses can have mutually beneficial interactions. Previous efforts to exploit these interactions have either (1) iteratively performed each individual analysis until no...
TGC
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. In the age of the world-wide web and mobile computing, programming communication-centric software is essential. Thus, programmers and program designers are exposed to new...
TACAS
2010
Springer
14 years 2 months ago
2010
Springer
Abstract. Heap-Hop is a program prover for concurrent heap-manipulating programs that use Hoare monitors and message-passing synchronization. Programs are annotated with pre and po...