Concurrent logic languages are high-level programming languages for parallel and
distributed systems that offer a wide range of both known and novel concurrent …

The problem of deadlock detection in distributed systems has undergone extensive study.
An important application relates to distributed database systems. A uniform model in which …

Irregular and dynamic parallel applications pose significant challenges to achieving
scalable performance on large-scale multicore clusters. These applications often require …

Kernel descriptors provide a unified way to generate rich visual feature sets by turning pixel
attributes into patch-level features, and yield impressive results on many object recognition …

Distributed Algorithms for Message-Passing Systems Page 1 Michel Raynal Distributed Algorithms
for Message-Passing Systems Page 2 Distributed Algorithms for Message-Passing Systems Page …

This is a systematic and comprehensive introduction both to compositional proof methods for
the state-based verification of concurrent programs, such as the assumption-commitment …

The termination problem for distributed computations is analyzed in the general context of
asynchronous communication. In the underlying computational model it is assumed that …

An important problem in the field of distributed systems is that of detecting the termination of
a distributed computation. Distributed termination detection (DTD) is a difficult problem due …

We develop an efficient snapshot algorithm that needs no control messages and does not
require channels to be first-in-first-out. We also show that several stable properties (eg …

The safe decomposition of a distributed program into communication closed layers is
suggested as a superstructure of its decomposition into a collection of communicating …