TY - GEN
T1 - Efficient analysis of concurrent constraint logic programs
AU - Codish, Michael
AU - Falaschi, Moreno
AU - Marriott, Kim
AU - Winsborough, William
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1993.
PY - 1993/1/1
Y1 - 1993/1/1
N2 - 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.
AB - 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.
UR - http://www.scopus.com/inward/record.url?scp=85028830842&partnerID=8YFLogxK
U2 - 10.1007/3-540-56939-1_108
DO - 10.1007/3-540-56939-1_108
M3 - Conference contribution
AN - SCOPUS:85028830842
SN - 9783540569398
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 633
EP - 644
BT - Automata, Languages and Programming - 20th International Colloquium, ICALP 1993, Proceedings
A2 - Lingas, Andrzej
A2 - Karlsson, Rolf
A2 - Carlsson, Svante
PB - Springer Verlag
T2 - 20th International Colloquium on Automata, Languages and Programming, ICALP 1993
Y2 - 5 July 1993 through 9 July 1993
ER -