A. Martín and A. D. Gordon, A Calculus for Cryptographic Protocols: The Spi Calculus, Fourth ACM Conference on Computer and Communications Security, pp.33-112, 1997.

A. Martín and B. Blanchet, Analyzing Security Protocols with Secrecy Types and Logic Programs, Journal of the ACM, vol.52, issue.1 111, 2005.

C. Samson-abramsky and . Ong, Full Abstraction in the Lazy Lambda Calculus, Information and Computation, vol.105, issue.2, pp.159-267, 1993.
DOI : 10.1006/inco.1993.1044

C. Allauzen, Allauzen C. Crochemore M. Factor oracle: a new structure for pattern matching, Proc. of SOFSEM'99, p.128, 1999.

F. James and . Allen, Maintaining knowledge about temporal intervals, Commun. ACM, vol.26, issue.125, p.127, 1983.

]. A. Allombert, G. Assayag, M. Desainte-catherine, and C. Rueda, Concurrent constraints models for interactive scores, proceedings of SMC ' 06, 2006.
URL : https://hal.archives-ouvertes.fr/hal-00307924

]. A. Allombert-2007, G. Allombert, M. Assayag, and . Desainte-catherine, A system of interactive scores based on Petri nets, proceedings of SMC ' 07, p.130, 2007.

M. Roberto, D. Amadio, V. Lugiez, and . Vanackère, On the symbolic reduction of processes with cryptographic functions, Theor. Comput. Sci, vol.290, issue.105, p.111, 2003.

]. J. Aranda, G. Assayag, C. Olarte, J. A. Pérez, C. Rueda et al., An Overview of FORCES: An INRIA Project on Declarative Formalisms for Emergent Systems, ICLP'09, p.17, 2007.
DOI : 10.1007/978-3-540-89982-2_56
URL : https://hal.archives-ouvertes.fr/inria-00426610

F. D. Aranda, C. Valencia, and . Versari, On the Expressive Power of Restriction and Priorities in CCS with Replication, FOSSACS, pp.242-256, 2009.
DOI : 10.1007/978-3-540-85361-9_37
URL : https://hal.archives-ouvertes.fr/inria-00430531

]. T. Armstrong, K. Marriott, P. Schachte, and H. Søndergaard, Two classes of Boolean functions for dependency analysis, Science of Computer Programming, vol.31, issue.1, p.148, 1998.
DOI : 10.1016/S0167-6423(96)00039-1

]. G. Assayag, S. Dubnov, and C. Rueda, A Concurrent Constraints Factor Oracle Model for Music Improvisation, CLEI 06, p.128, 2006.
URL : https://hal.archives-ouvertes.fr/hal-01161352

]. J. Baeten and W. P. Weijland, Process algebra, p.19, 1990.

]. Bagnara, P. M. Hill, A. Pescetti, and E. Zaffanella, On the Design of Generic Static Analyzers for Modern Imperative Languages, pp.703116-131, 2007.

A. Benveniste, P. L. Guernic, and C. Jacquemot, Synchronous programming with events and relations: the SIGNAL language and its semantics, Science of Computer Programming, vol.16, issue.2, pp.103-149, 1991.
DOI : 10.1016/0167-6423(91)90001-E

]. J. Bergstra and J. W. Klop, Algebra of communicating processes with abstraction, Theoretical Computer Science, vol.37, issue.1, pp.77-121, 1985.
DOI : 10.1016/0304-3975(85)90088-X

]. G. Berry and G. Gonthier, The Esterel synchronous programming language: design, semantics, implementation, Science of Computer Programming, vol.19, issue.2, pp.87-152, 1992.
DOI : 10.1016/0167-6423(92)90005-V
URL : https://hal.archives-ouvertes.fr/inria-00075711

]. Bistarelli, U. Montanari, and F. Rossi, Semiring-based constraint satisfaction and optimization, Journal of the ACM, vol.44, issue.2, pp.201-236, 1997.
DOI : 10.1145/256303.256306
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.4.3513

M. Boreale and R. D. Nicola, A Symbolic Semantics for the pi- Calculus, Information and Computation, vol.126, p.55, 1996.

]. M. Boreale, Symbolic analysis of cryptographic protocols in the spi-calculus, p.111, 2000.

M. Buscemi, A framework for the analysis of security protocols, Proc. of WSDAAL, p.105, 2001.

M. Boreale, Symbolic Trace Analysis of Cryptographic Protocols, Proc. of ICALP'01, p.55, 2001.
DOI : 10.1007/3-540-48224-5_55

M. Boreale, R. Bruni, L. Caires, R. D. Nicola, I. Lanese et al., SCC: A Service Centered Calculus, Proc. of WS-FM, pp.38-57, 2006.
DOI : 10.1007/11841197_3

]. E. Borger, E. Gradel, and Y. Gurevich, The classical decision problem, p.67, 2001.
DOI : 10.1007/978-3-642-59207-2

]. Bortolussi and A. Policriti, Modeling Biological Systems in Stochastic Concurrent Constraint Programming, Constraints, vol.99, issue.9, 2008.
DOI : 10.1007/s10601-007-9034-8

]. J. Buchi-1962 and . Buchi, On a decision method in restricted second order arithmetic, Proc. of Int. Conf. on Logic, Methodology, and Philosophy of Science, p.67, 1962.

]. , G. Buscemi, and U. Montanari, CC-Pi: A Constraint-Based Language for Specifying Service Level Agreements, Proc. of ESOP, pp.37-130, 2007.

]. , G. Buscemi, and U. Montanari, Open Bisimulation for the Concurrent Constraint Pi-Calculus, ESOP, pp.254-268, 2008.

]. Busi, M. Gabbrielli, and G. Zavattaro, Replication vs. Recursive Definitions in Channel Based Calculi, ICALP, pp.133-144, 2003.
DOI : 10.1007/3-540-45061-0_12

N. Busi, M. Gabbrielli, and G. Zavattaro, Comparing Recursion, Replication, and Iteration in Process Calculi, ICALP, pp.307-319, 2004.
DOI : 10.1007/978-3-540-27836-8_28

]. M. Codish and B. Demoen, Deriving polymorphic type dependencies for logic programs using multiple incarnations of Prop, Proc. of SAS'94, pp.281-296, 1994.
DOI : 10.1007/3-540-58485-4_47

]. M. Codish, H. Søndergaard, and P. Stuckey, Sharing and groundness dependencies in logic programs, ACM Transactions on Programming Languages and Systems, vol.21, issue.5, p.148, 1999.
DOI : 10.1145/330249.330252

G. Marco-comini, M. C. Levi, G. Meo, and . Vitiello, Abstract diagnosis, The Journal of Logic Programming, vol.39, issue.1-3, pp.43-93, 1999.
DOI : 10.1016/S0743-1066(98)10033-X

R. Marco-comini, G. Gori, P. Levi, and . Volpe, Abstract interpretation based verification of logic programs, Science of Computer Programming, vol.49, issue.1-3, pp.89-123, 2003.
DOI : 10.1016/j.scico.2003.08.002

G. Cortesi-1997-]-agostino-cortesi, F. Filé, R. Ranzato, C. Giacobazzi, and . Palamidessi, Complementation in abstract interpretation, ACM Trans. Program. Lang. Syst, vol.19, issue.1, p.96, 1997.

]. P. Cousot and R. Cousot, Abstract interpretation, Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages , POPL '77, 1977.
DOI : 10.1145/512950.512973
URL : https://hal.archives-ouvertes.fr/inria-00528590

C. Patrick and R. Cousot, Systematic Design of Program Analysis Frameworks, POPL, pp.269-282, 1979.

C. Patrick and R. Cousot, Abstract Interpretation and Application to Logic Programs, J. Log. Program, vol.13, issue.144, pp.103-179, 1992.

C. Federico and G. Winskel, Petri nets in cryptographic protocols, IPDPS '01: Proceedings of the 15th International Parallel & Distributed Processing Symposium, p.111, 2001.

. De-boer-1995a-]-f, A. D. De-boer, C. Pierro, and . Palamidessi, Nondeterminism and infinite computations in constraint programming, Theoretical Computer Science, vol.151, issue.1, pp.37-78, 1995.
DOI : 10.1016/0304-3975(95)00047-Z

]. F. De-boer, M. Gabbrielli, E. Marchiori, and C. Palamidessi, Proving Concurrent constraint Programs Correct, ACM Transactions on Programming Languages and Systems, vol.19, issue.96, pp.57-66, 1997.

E. Dorothy, G. M. Denning, and . Sacco, Timestamps in key distribution protocols, Commun. ACM, vol.24, issue.8, p.147, 1981.

]. , F. Díaz, C. Rueda, and F. D. Valencia, Pi+-Calculus: A Calculus for Concurrent Processes with Constraints. CLEI Electron, J, vol.1, issue.37, p.130, 1998.

]. D. Dolev and A. C. Yao, On the security of public key protocols, IEEE Transactions on Information Theory, vol.29, issue.106, p.112, 1983.

F. Fages, S. Soliman, and V. Vianu, Expressiveness and Complexity of Concurrent Constraint Programming: a Finite Model Theoretic Approach, p.26, 1998.

F. Fages, P. Ruet, and S. Soliman, Linear Concurrent Constraint Programming: Operational and Phase Semantics, Information and Computation, vol.165, issue.1, p.150, 2001.
DOI : 10.1006/inco.2000.3002
URL : https://hal.archives-ouvertes.fr/hal-01431358

]. M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi, Compositional analysis for concurrent constraint programming, [1993] Proceedings Eighth Annual IEEE Symposium on Logic in Computer Science, p.141, 1993.
DOI : 10.1109/LICS.1993.287586

]. M. Falaschi, M. Gabbrielli, K. Marriott, and C. Palamidessi, Confluence in concurrent constraint programming, Theoretical Computer Science, vol.183, issue.2, pp.281-315, 1997.
DOI : 10.1016/S0304-3975(97)00328-9

]. M. Falaschi, C. Olarte, C. Palamidessi, and F. Valencia, Declarative Diagnosis of Temporal Concurrent Constraint Programs, Proc. of ICLP'07. Springer LNCS 4670, pp.16-151, 2007.
DOI : 10.1007/978-3-540-74610-2_19
URL : https://hal.archives-ouvertes.fr/inria-00201065

M. Fiore and M. Abadi, Computing symbolic models for verifying cryptographic protocols, Proceedings. 14th IEEE Computer Security Foundations Workshop, 2001., pp.33-106, 2001.
DOI : 10.1109/CSFW.2001.930144

]. C. Fournet and M. Abadi, Hiding Names: Private Authentication in the Applied Pi Calculus, p.112, 2003.
DOI : 10.1007/3-540-36532-X_20

]. Garoche, M. Pantel, and X. Thiroux, Abstract Interpretation-based Static Safety for Actors, Journal of Software, vol.2, issue.3, pp.87-98, 2007.
DOI : 10.4304/jsw.2.3.87-98

J. Giesl, P. Schneider-kamp, R. Thiemann, S. Swiderski, M. Thang-nguyen et al., Termination of Programs using Term Rewriting and SAT Solving, Deduction and Decision Procedures . Internationales Begegnungs-und Forschungszentrum für Informatik (IBFI), Schloss Dagstuhl, p.131, 2007.

]. Girard, Linear logic, Theoretical Computer Science, vol.50, issue.1, pp.1-102, 1987.
DOI : 10.1016/0304-3975(87)90045-4
URL : https://hal.archives-ouvertes.fr/inria-00075966

R. Vineet-gupta, V. Jagadeesan, and . Saraswat, Hybrid cc, hybrid automata and program verification (extended abstract), Proc. of the DIMAC- S/SYCON workshop on Hybrid systems III : verification and control, 1996.

R. Vineet-gupta, V. A. Jagadeesan, and . Saraswat, Models for concurrent constraint programming, In CONCUR Lecture Notes in Computer Science, vol.1119, pp.66-83, 1996.
DOI : 10.1007/3-540-61604-7_48

]. N. Halbwachs, P. Caspi, P. Raymond, and D. Pilaud, The synchronous dataflow programming language Lustre, Proceedings of the IEEE, pp.1305-1320, 1922.

]. C. Hoare, Communications sequential processes, p.150, 1985.

M. Ian, F. Hodkinson, M. Wolter, and . Zakharyaschev, Decidable fragment of first-order temporal logics, Ann. Pure Appl. Logic, vol.106, issue.67, p.86, 2000.

]. A. Lapadula, R. Pugliese, and F. Tiezzi, A Calculus for Orchestration of Web Services, Proc. of ESOP, pp.33-47, 2007.
DOI : 10.1007/978-3-540-71316-6_4

H. Lopez, C. Lopez, J. A. Olarte, and . Pérez, Towards a Unified Framework for Declarative Sessions, Proc. of PLACES'09, p.129, 2009.

A. Manna and . Pnueli, The temporal logic of reactive and concurrent systems: Specification, pp.65-149, 1991.
DOI : 10.1007/978-1-4612-0931-7

]. Mendler, P. Panangaden, J. Philip, R. Scott, and . Seely, A Logical View of Concurrent Constraint Programming, Nord. J. Comput, vol.2, issue.66, pp.181-220, 1995.

]. R. Milner-1989 and . Milner, Communication and concurrency. International Series in Computer Science, 1989.

]. R. Milner, A finite delay operator in Synchronous CCS. Rapport technique CSR-116-82, p.86, 1992.

]. R. Milner, J. Parrow, and D. Walker, A Calculus of Mobile Processes, Parts I and II, Journal of Information and Computation, vol.100, issue.148, pp.80-85, 1992.

]. Milner, The Polyadic Pi-calculus (Abstract), In CONCUR Lecture Notes in Computer Science, vol.630, p.28, 1992.

L. Marvin and . Minsky, Computation: finite and infinite machines, p.68, 1967.

M. Roger, M. D. Needham, and . Schroeder, Using encryption for authentication in large networks of computers, Commun. ACM, vol.21, issue.131, p.146, 1978.

]. M. Nielsen, C. Palamidessi, and F. D. Valencia, Temporal Concurrent Constraint Programming: Denotation, Logic and Applications, Nordic Journal of Computing, vol.9, issue.139, pp.93-132, 2002.
DOI : 10.7146/brics.v8i48.21708
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3124

C. Mogens-nielsen, F. D. Palamidessi, and . Valencia, On the expressive power of temporal concurrent constraint programming languages, PPDP, pp.156-167, 2002.

]. C. Olarte, C. Rueda, and F. Valencia, Concurrent Constraint Programming: Calculi, Languages and Emerging Applications, Newsletter of the ALP, pp.2-3, 2008.

C. Olarte and F. D. Valencia, The expressivity of universal timed CCP, Proceedings of the 10th international ACM SIGPLAN symposium on Principles and practice of declarative programming, PPDP '08, p.132, 2008.
DOI : 10.1145/1389449.1389452
URL : https://hal.archives-ouvertes.fr/inria-00349353

C. Olarte and F. D. Valencia, Universal concurrent constraint programing, Proceedings of the 2008 ACM symposium on Applied computing , SAC '08, pp.55-65, 2008.
DOI : 10.1145/1363686.1363726
URL : https://hal.archives-ouvertes.fr/inria-00201497

]. C. Olarte, C. Rueda, and F. Valencia, Concurrent constraint calculi: a declarative paradigm for modeling music systems, Delatour France / IRCAM-Centre Pompidou, pp.93-112, 2009.
URL : https://hal.archives-ouvertes.fr/inria-00429592

]. G. Plotkin, A Structural Approach to Operational Semantics. Rapport technique FN-19, p.29, 1981.

]. A. Pnueli, The temporal logic of programs, 18th Annual Symposium on Foundations of Computer Science (sfcs 1977), pp.46-57, 1977.
DOI : 10.1109/SFCS.1977.32

F. Rueda and . Valencia, On validity in modelization of musical problems by CCP, Soft Computing, vol.8, issue.9, 2004.
DOI : 10.1007/s00500-004-0390-7

]. D. Sangiorgi, Expressing Mobility in Process Algebras: First-Order and Higher-Order Paradigms, p.84, 1992.

]. D. Sangiorgi, Interpreting functions as pi-calculus processes: a tutorial, pp.81-86, 1998.
URL : https://hal.archives-ouvertes.fr/inria-00073220

]. D. Sangiorgi and D. Walker, The ?-calculus: a Theory of Mobile Processes, pp.32-86, 2001.

A. Vijay, M. Saraswat, P. Rinard, and . Panangaden, The semantic foundations of concurrent constraint programming, POPL '91, pp.133-134, 1991.

V. Saraswat and P. Lincoln, Higher-order Linear Concurrent Constraint Programming, p.150, 1992.

A. Vijay and . Saraswat, Concurrent constraint programming, pp.37-133, 1993.

V. Saraswat, R. Jagadeesan, and V. Gupta, Foundations of timed concurrent constraint programming, Proceedings Ninth Annual IEEE Symposium on Logic in Computer Science, pp.93-95, 1994.
DOI : 10.1109/LICS.1994.316085

S. Dana and . Scott, Domains for Denotational Semantics, ICALP, pp.577-613, 1982.

]. Shapiro, The family of concurrent logic programming languages, ACM Computing Surveys, vol.21, issue.3, 1921.
DOI : 10.1145/72551.72555

]. Ueda, N. Kato, K. Hara, and K. Mizuno, LMNtal as a Unifying Declarative Language: Live Demonstration, Proc. of ICLP 06, p.38, 2006.
DOI : 10.1007/11799573_47

D. Frank and . Valencia, Decidability of infinite-state timed CCP processes and first-order LTL, Theor. Comput. Sci, vol.330, issue.86, pp.66-67, 2005.

L. Wischik, P. Wischik, and . Gardner, Explicit fusions, Theoretical Computer Science, vol.340, issue.3, pp.606-630, 2005.
DOI : 10.1016/j.tcs.2005.03.017

]. E. Zaffanella, R. Giacobazzi, and G. Levi, Abstracting synchronization in concurrent constraint programming, Journal of Functional and Logic Programming, vol.1997, issue.141, p.142, 1997.
DOI : 10.1007/3-540-58402-1_6