Suspension Analyses for Concurrent Logic Programs

Michael Codish, Moreno Falaschi, Kim Marriott

Research output: Contribution to journalArticlepeer-review

30 Scopus citations


Concurrent logic languages specify reactive systems which consist of collections of communicating processes. The presence of unintended suspended computations is a common programming error which is difficult to detect using standard debugging and testing techniques. We develop a number of analyses, based on abstract interpretation, which succeed if a program is definitely suspension free. If an analysis fails, the program may, or may not, be suspension free. Examples demonstrate that the analyses are practically useful. They are conceptually simple and easy to justify because they are based directly on the transition system semantics of concurrent logic programs. A naive analysis must consider all scheduling policies. However, it is proven that for our analyses it suffices to consider only one scheduling policy, allowing for efficient implementation.

Original languageEnglish
Pages (from-to)649-686
Number of pages38
JournalACM Transactions on Programming Languages and Systems
Issue number3
StatePublished - 5 Jan 1994
Externally publishedYes


  • abstract interpretation
  • concurrent logic programming
  • program analysis

ASJC Scopus subject areas

  • Software


Dive into the research topics of 'Suspension Analyses for Concurrent Logic Programs'. Together they form a unique fingerprint.

Cite this