TY - GEN
T1 - Confluence in concurrent constraint programming
AU - Falaschi, Moreno
AU - Gabbrielli, Maurizio
AU - Marriott, Kim
AU - Palamidessi, Catuscia
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 1995.
PY - 1995/1/1
Y1 - 1995/1/1
N2 - We investigate the subset of concurrent constraint programs (ccp) which are confluent in the sense that different process schedulings lead to the same possible outcomes. Confluence is an important and desirable property as it allows the program to be understood by considering any desired scheduling rule, rather than having to consider all possible schedulings. The subset of confluent programs is less expressive than tull cop. For example it cannot express fair merge although it can express demonic merge. We give a simple closure based denotational semantics for confluent ccp. We also study admissible programs which is a subset of confluent ccp closed under composition. We consider then applications of our results to give a framework for the efficient yet accurate analysis of full ccp. The basic idea is to approximate an arbitrary ccp program by an admissible program which is then analyzed.
AB - We investigate the subset of concurrent constraint programs (ccp) which are confluent in the sense that different process schedulings lead to the same possible outcomes. Confluence is an important and desirable property as it allows the program to be understood by considering any desired scheduling rule, rather than having to consider all possible schedulings. The subset of confluent programs is less expressive than tull cop. For example it cannot express fair merge although it can express demonic merge. We give a simple closure based denotational semantics for confluent ccp. We also study admissible programs which is a subset of confluent ccp closed under composition. We consider then applications of our results to give a framework for the efficient yet accurate analysis of full ccp. The basic idea is to approximate an arbitrary ccp program by an admissible program which is then analyzed.
U2 - 10.1007/3-540-60043-4_76
DO - 10.1007/3-540-60043-4_76
M3 - Conference contribution
AN - SCOPUS:84957807377
SN - 3540600434
SN - 9783540600435
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 531
EP - 545
BT - Algebraic Methodology and Software Technology - 4th International Conference, AMAST 1995, Proceedings
A2 - Alagar, V.S.
A2 - Nivat, Maurice
PB - Springer Verlag
T2 - 4th International Conference on Algebraic Methodology and Software Technology, AMAST 1995
Y2 - 3 July 1995 through 7 July 1995
ER -