Suspension analysis for concurrent logic programs

Michael Codish, Moreno Falaschi, Kim Marriott

Research output: Contribution to conferencePaperpeer-review

21 Scopus citations

Abstract

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.

Original languageEnglish
Pages331-345
Number of pages15
StatePublished - 1 Dec 1991
Externally publishedYes
EventLogic Programming - Proceedings of the 8th International Conference - Paris, Fr
Duration: 24 Jun 199128 Jun 1991

Conference

ConferenceLogic Programming - Proceedings of the 8th International Conference
CityParis, Fr
Period24/06/9128/06/91

ASJC Scopus subject areas

  • Engineering (all)

Fingerprint

Dive into the research topics of 'Suspension analysis for concurrent logic programs'. Together they form a unique fingerprint.

Cite this