Maurizio Gabbrielli Kim Marriott Catuscia Palamidessi  Home/Search
Context Related
| psu.edu/~catuscia/papers/Lics...lics.ps Cached: PS.gz PS This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
PDF Image Update HelpPS.gz PS From: psu.edu/~catuscia/publications (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We propose a framework for the analysis of concurrent constraint programming (ccp). Our approach is based on simple denotational semantics which 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. 1 (Update)
Cited by: More
Some Challenges for Constraint Programming - Hermenegildo (1997) (Correct)
Analyzing Logic Programs with Dynamic Scheduling - Marriott, Banda, Hermenegildo (1994) (Correct)
Efficient Analysis of Constraint Logic Programs with.. - Banda, Marriott, Stuckey (1995) (Correct)
Similar documents (at the sentence level):
8.5%: From Concurrent Logic Programming to Concurrent Constraint .. - de Boer, Palamidessi (1993) (Correct)
5.2%: The Replacement Operation for CCP Programs - Bertolino, Etalle, Palamidessi (2000) (Correct)
Active bibliography (related documents): More All
1.1: Compositional Analysis for Concurrent Constraint Programming - Moreno Falaschi (1993) (Correct)
0.4: A Confluent Semantic Basis For The Analysis Of.. - Codish, Falaschi, .. (1994) (Correct)
0.1: Confluence in Concurrent Constraint Programming - Moreno Falaschi Maurizio (1995) (Correct)
Similar documents based on text: More All
0.6: Constraint Logic Programming with Dynamic Scheduling: A.. - Falaschi, Gabbrielli (1996) (Correct)
0.4: Proving Concurrent Constraint Programs Correct - de Boer, Gabbrielli.. (1994) (Correct)
0.3: Proving Correctness of Constraint Logic Programs.. - de Boer.. (1996) (Correct)
Related documents from co-citation: More All
25: Semantic foundation of concurrent constraint programming - Saraswat, Rinard et al. - 1991
13: A Fully Abstract Model for Concurrent Constraint Programming (context) - de Boer, Palamidessi - 1991
13: Concurrent Constraint Programming (context) - Saraswat - 1990
BibTeX entry: (Update)
M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi. Compositional Analysis for Concurrent Constraint Programming. In Proceedings of the Eight Annual IEEE Symposium on Logic in Computer Science, pages 210--221, 1993. http://citeseer.ist.psu.edu/falaschi93compositional.html More
@inproceedings{ falaschi93compositional,
author = "Moreno Falaschi and Maurizio Gabbrielli and Kim Marriott and Catuscia Palamidessi",
title = "Compositional Analysis for Concurrent Constraint Programming",
booktitle = "Logic in Computer Science",
pages = "210-221",
year = "1993",
url = "citeseer.ist.psu.edu/falaschi93compositional.html" }
Citations (may not include all citations):815 Abstract Interpretation: A Unified Lattice Model for Static .. (context) - Cousot, Cousot - 1977
344 Concurrent constraint programming (context) - Saraswat, Rinard - 1990
247 The family of concurrent logic programming languages (context) - Shapiro - 1989
216 Semantics foundations of Concurrent Constraint Programming - Saraswat, Rinard et al. - 1991
214 Domains for denotational semantics (context) - Scott - 1982
121 Concurrent Constraint Programming Languages (context) - Saraswat - 1989
83 Cylindric Algebras (context) - Henkin, Monk et al. - 1971
40 Suspension Analysis for Concurrent Logic Programs (context) - Codish, Falaschi et al. - 1991
27 Angelic non-determinism in concurrent constraint programming - Jagadeesan, Saraswat et al. - 1991
26 Abstract Interpretation for Concurrent Logic Languages (context) - Codognet, Codognet et al. - 1990
21 Efficient Analysis of Concurrent Constraint Logic Programs (context) - Codish, Falaschi et al. - 1993
19 Functional Computations in Logic Programs - Debray, Warren - 1989
14 A Fully Abstract Model for Concurrent Constraint Programming (context) - de Boer, Palamidessi - 1991
13 Abstract Interpretation of Logic Programs: the Denotational .. (context) - Marriott, Sndergaard - 1990
3 Less abstract semantics for abstract interpretation of FGHC .. (context) - Horiuchi - 1992
2 Analyses of Unsatisfiability for Incremental Logic Programmi.. (context) - Alpuente, Falaschi et al. - 1992
The graph only includes citing articles where the year of publication is known.
Documents on the same site (http://www.cse.psu.edu/~catuscia/publications.html): More
Weak Relative Pseudo-Complements of Closure Operators - Giacobazzi, Palamidessi.. (1996) (Correct)
Comparing the Expressive Power of the Synchronous and the.. - Palamidessi (2002) (Correct)
Temporal Concurrent Constraint Programming.. - Nielsen.. (2002) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC