328 search results - page 56 / 66 » Simple Termination Revisited |
ICLP
1997
Springer
13 years 11 months ago
1997
Springer
We provide a method whereby, given mode and (upper approximation) type information, we can detect procedures and goals that can be guaranteed to not fail (i.e., to produce at leas...
TACS
1997
Springer
13 years 11 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...
ICCD
1994
IEEE
13 years 11 months ago
1994
IEEE
This paper presents a simple and robust method of designing the lossy-transmission-line interconnects in a network for multichip modules. This method uses wire-sizing entirely to ...
PODC
1994
ACM
13 years 11 months ago
1994
ACM
Workstation clusters are becoming an interesting alternative to dedicated multiprocessors. In this environment, the probability of a failure, during an application's executio...
ECAI
1990
Springer
13 years 11 months ago
1990
Springer
Much recent work in computational morphology has presupposed that morphological operations are de nable on strings of phonological or graphemic objects. By contrast, theoretical l...