37 search results - page 1 / 8 » Termination, Deadlock and Divergence |
MFPS
1989
13 years 9 months ago
1989
TACS
1997
Springer
13 years 9 months ago
1997
Springer
We present a type-based technique for the veri cation of deadlock-freedom in asynchronous concurrent systems. Our general approach is to start with a simple interaction category, i...
SEFM
2007
IEEE
13 years 11 months ago
2007
IEEE
We describe a simple and efficient algorithm for proving the termination of a class of loops with nonlinear assignments to variables. The method is based on divergence testing fo...
CORR
2010
Springer
13 years 3 months ago
2010
Springer
This paper proposes a type-and-effect system called Teq, which distinguishes terminating terms and total functions from possibly diverging terms and partial functions, for a lambd...
EMSOFT
2006
Springer
13 years 8 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...