מיכאל קודיש

We develop a novel dataflow analysis for the detection of ``possible'' suspension of concurrent logic programs. The analysis is conceptually simple and easy to justify because it is based directly on the transition system semantics of concurrent logic programs. A naive analysis must consider all scheduling policies. However, we prove that for our analysis it suffices to consider only one scheduling policy. This allows for efficient implementation. The analysis is demonstrated for the concurrent logic language FCP(:) and shown to provide promising results.