Abstract
We present a framework for abstract interpretation of concurrent constraint languages. Abstract interpretation is based on the notion of abstraction between constraint systems, which are used to define both concrete and abstract domains. For two constraint systems (D, ⊢) and (D′, ⊢′), and a concrete program P over constraint system (D, ⊢), we define a corresponding abstract program P′ over (D′, ⊢′) such that the execution of P′ in (D′, ⊢′) performs the abstract interpretation of P. Our framework is based on a denotational semantics of concurrent constraint languages, where each agent is seen as a closure operator over the lattice defined by the constraint system. From a practical point of view, we show how such analysis can be implemented by means of a reexecution algorithm, extending thus a previous framework for abstract interpretation of concurrent logic languages. We also show how suspension analysis can be performed within this framework.
This is a preview of subscription content, log in via an institution.
Preview
Unable to display preview. Download preview PDF.
References
M. Bruynooghe. A practical framework for the abstract interpretation of logic programs. Journal of Logic Programming, 10(2):91–124, 1991.
C. Codognet, P. Codognet and M-M. Corsini. Abstract Interpretation for Concurrent Logic Languages. In proc. North American Conference on Logic Programming, Austin, Texas, MIT Press 1990.
P. Codognet and G. Filé. Computations, Abstractions and Constraints. Research Report 91-13, Università di Padova, 1991.
P. Codognet and G. Filé. Computation, abstractions and Constraints in Logic Programs. In proc. IEEE International Conference on Computer Languages, IEEE Press 1992.
M. Codish, M. Falaschi, K. Marriott and W. Winsborough. Efficient Analysis of Concurrent Constraint Logic Programs. In proc. ICALP 93, Springer Verlag 1993.
M. Codish, M. Falaschi and K. Marriott. Suspension Analyses for Concurrent Logic Programs. In proc. ICLP 91, Paris, France, MIT Press 1991.
A. Colmerauer. An introduction to PrologIII. Communications of the ACM, 28 (4), April 1990, pp 412–418.
S. Debray and D.S. Warren. Automatic mode inference for Prolog programs. Journal of Logic Programming, vol. 5 (3), 1988.
M. Falaschi, M. Gabbrielli, K. Marriott and C. Palamidessi Compositional Analysis for Concurrent Constraint Programming. In proc. LICS 93, IEEE Press 1993.
R. Giacobazzi, S. K. Debray and G. Levi. A Generalized Semantics for Constraint Logic Programs. In proc. Fifth Generation Computer Sytems 92, Tokyo, ICOT, 1992.
J. Jaffar and J-L. Lassez. Constraint Logic Programming. Research Report, University of Melbourne, June 1986. Short version in proc. 14th ACM conference on Principles Of Programming Languages, POPL'87, ACM Press 1987.
R. Jagadeesan, V. Saraswat and V. Shanbhogue. Angelic non-determinism in concurrent constraint programming. Technical Report, Xerox PARC, 1991.
B. Le Charlier K. Musumbu and P. Van Hentenryck. A generic abstract interpretation algorithm and its complexity analysis. In 8th International Conference on Logic Programming, Paris, MIT Press 1991.
B. Le Charlier and P. Van Hentenryck. Reexecution in Abstract Interpretation of Prolog. In proc. Joint International Conference and Symposium on Logic Programming, Washington, MIT Press 1992.
F. Mesnard. Termination analysis for Prolog programs (in French). Ph.D. dissertation, University of Paris-6, France, 1993.
G. Plotkin. Domains. University of Edinburgh, 1983.
V. A. Saraswat. Concurrent Constraint Programming Languages. Research Report CMU-CS-89-108, Carnegie Mellon University, 1989. Also (revised version) MIT Press 93.
V.A. Saraswat and M. Rinard. Concurrent Constraint Programming. In Proceedings of Seventeenth ACM Symposium on Principles of Programming Languages, San Francisco, CA, January 1990.
V.A. Saraswat, M. Rinard, and P. Panangaden. Semantic Foundations of Concurrent Constraint Programming. In Proceedings of Ninth ACM Symposium on Principles of Programming Languages, Orlando, FL, January 1991.
V. Saraswat. The Category of Constraint Systems is Cartesian-Closed. In proc. LICS'92, Logic In Computer Science, IEEE Press 1992.
D. S. Scott Domains for denotational semantics. In proc. ICALP'82, International Colloquium on Automata, Languages and Programming, Springer Verlag 1982.
E. Shapiro. The Family of Concurrent Logic Languages. ACM Computing Surveys, September 1989.
P. Van Hentenryck. Constraint Satisfaction in Logic Programming. MIT Press 1989.
P. Van Hentenryck, V. Saraswat and Y. Deville. Constraint processing in cc(FD). Research Report, Brown University, 1991.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1995 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Codognet, C., Codognet, P. (1995). A generalized semantics for concurrent constraint languages and their abstract interpretation. In: Meyer, M. (eds) Constraint Processing. CP CP 1994 1993. Lecture Notes in Computer Science, vol 923. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-59479-5_17
Download citation
DOI: https://doi.org/10.1007/3-540-59479-5_17
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-59479-6
Online ISBN: 978-3-540-49281-8
eBook Packages: Springer Book Archive