A framework for the analysis of concurrent constraint programming (CCP) is proposed. The approach is based on simple denotational semantics that approximate the usual semantics in the sense that they give a superset of the input-output relation of a CCP program. Analyses based on these semantics can be easily and efficiently implemented using standard techniques from the analysis of logic programs
Falaschi, M., Gabbrielli, M., Marriott, K., Palamidessi, C. (1993). Compositional Analysis for Concurrent Constraint Programming. In Proceedings of LICS'93 (pp.210-221). Los Alamitos : IEEE [10.1109/LICS.1993.287586].
Compositional Analysis for Concurrent Constraint Programming
FALASCHI, MORENO;
1993-01-01
Abstract
A framework for the analysis of concurrent constraint programming (CCP) is proposed. The approach is based on simple denotational semantics that approximate the usual semantics in the sense that they give a superset of the input-output relation of a CCP program. Analyses based on these semantics can be easily and efficiently implemented using standard techniques from the analysis of logic programs
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
https://hdl.handle.net/11365/35843
Attenzione
Attenzione! I dati visualizzati non sono stati sottoposti a validazione da parte dell'ateneo