Efficient analysis of concurrent constraint logic programs

Michael Codish, Moreno Falaschi, Kim Marriott, William Winsborough

Research output: Chapter in Book/Report/Conference proceedingConference PaperResearchpeer-review

13 Citations (Scopus)

Abstract

The standard operational semantics of concurrent constraint logic languages is not confluent in the sense that different schedulings of processes may result in different program behaviors. While implementations are free to choose specific scheduling policies, analyses should be correct for all implementations. Moreover, in the presence of parallelism it is usually not possible to determine how processes will actually be scheduled. Efficient program analysis is therefore difficult as all process schedulings must be cousidered. To overcome this problem we introduce a confluent semantics which closely approximates the standard (non-confluent) semantics. This semantics provides a basis for efficient and accurate program analysis for these languages. To illustrate the usefulness of this approach we sketch analyses based on abstract interpretations of the confluent semantics which determine if a program is suspension and local suspension free.

Original languageEnglish
Title of host publicationAutomata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings
EditorsAndrzej Lingas, Rolf Karlsson, Svante Carlsson
PublisherSpringer
Pages633-644
Number of pages12
ISBN (Print)9783540569398
DOIs
Publication statusPublished - 1993
Event20th International Colloquium on Automata, Languages and Programming, ICALP 1993 - Lund, Sweden
Duration: 5 Jul 19939 Jul 1993

Publication series

NameLecture Notes in Computer Science
PublisherSpringer
Volume700
ISSN (Print)0302-9743
ISSN (Electronic)1611-3349

Conference

Conference20th International Colloquium on Automata, Languages and Programming, ICALP 1993
CountrySweden
CityLund
Period5/07/939/07/93

Cite this