TY - JOUR
T1 - A confluent semantic basis for the analysis of concurrent constraint logic programs
AU - Codish, Michael
AU - Falaschi, Moreno
AU - Marriott, Kim
AU - Winsborough, William
N1 - Funding Information:
Michael Codish is grateful to the Departments of Computer Science at the University of Pisa and at KU Leuven where he was visiting while working on this paper. Moreno Falaschi was partially supported by the ESPRIT Basic Research Action 6707 ("Parforce"). William Winsborough was partially supported by NSF CCR-9210975.
PY - 1997/1/1
Y1 - 1997/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 considered. To overcome this problem, we introduce a confluent semantics which closely approximates the standard (nonconfluent) 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 considered. To overcome this problem, we introduce a confluent semantics which closely approximates the standard (nonconfluent) 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=0042234968&partnerID=8YFLogxK
U2 - 10.1016/S0743-1066(96)00013-1
DO - 10.1016/S0743-1066(96)00013-1
M3 - Article
AN - SCOPUS:0042234968
SN - 0743-1066
VL - 30
SP - 53
EP - 81
JO - Journal of Logic Programming
JF - Journal of Logic Programming
IS - 1
ER -