@inproceedings{c47bbc9afb1349dca217372e0e9a9184,
title = "Efficient analysis of concurrent constraint logic programs",
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.",
author = "Michael Codish and Moreno Falaschi and Kim Marriott and William Winsborough",
year = "1993",
doi = "10.1007/3-540-56939-1_108",
language = "English",
isbn = "9783540569398",
series = "Lecture Notes in Computer Science",
publisher = "Springer",
pages = "633--644",
editor = "Andrzej Lingas and Rolf Karlsson and Svante Carlsson",
booktitle = "Automata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings",
note = "20th International Colloquium on Automata, Languages and Programming, ICALP 1993 ; Conference date: 05-07-1993 Through 09-07-1993",
}