M. Abadi, Corrigendum: The power of temporal proofs, Theor. Comput. Sci, vol.70, issue.2, 1990.

M. Abadi and B. Blanchet, Analyzing Security Protocols with Secrecy Types and Logic Programs, Journal of the ACM, vol.52, issue.1, 2005.
DOI : 10.1145/1044731.1044735
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.20.3131

M. Abadi and A. D. Gordon, A calculus for cryptographic protocols, Proceedings of the 4th ACM conference on Computer and communications security , CCS '97, pp.36-47, 1997.
DOI : 10.1145/266420.266432

R. M. Amadio, D. Lugiez, and V. Vanackère, On the symbolic reduction of processes with cryptographic functions, Theor. Comput. Sci, vol.290, issue.1, 2003.
URL : https://hal.archives-ouvertes.fr/inria-00072478

B. Blanchet, Security protocols: from linear to classical logic by abstract interpretation, Information Processing Letters, vol.95, issue.5, 2005.
DOI : 10.1016/j.ipl.2005.05.011

M. Boreale and M. G. Buscemi, A method for symbolic analysis of security protocols, Theoretical Computer Science, vol.338, issue.1-3, pp.1-3, 2005.
DOI : 10.1016/j.tcs.2005.03.044

E. Borger, E. Gradel, and Y. Gurevich, The Classical Decision Problem, 2001.
DOI : 10.1007/978-3-642-59207-2

J. R. Buchi, On a Decision Method in Restricted Second Order Arithmetic, Proc. of Int. Conf. on Logic, Methodology, and Philosophy of Science, 1962.
DOI : 10.1007/978-1-4613-8928-6_23

A. Cortesi, G. Filé, F. Ranzato, R. Giacobazzi, and C. Palamidessi, Complementation in abstract interpretation, ACM Trans. Program. Lang. Syst, vol.19, issue.1, 1997.

F. Crazzolara and G. Winskel, Petri nets in cryptographic protocols, Proceedings 15th International Parallel and Distributed Processing Symposium. IPDPS 2001, p.3, 2001.
DOI : 10.1109/IPDPS.2001.925135

F. S. De-boer, M. Gabbrielli, E. Marchiori, and C. Palamidessi, Proving concurrent constraint programs correct, ACM Transactions on Programming Languages and Systems, vol.19, issue.5, 1997.

A. Degtyarev, M. Fisher, and A. Lisitsa, Equality and monodic first-order temporal logic, Studia Logica, vol.72, issue.2, 2002.

D. E. Denning and G. M. Sacco, Timestamps in key distribution protocols, Communications of the ACM, vol.24, issue.8, p.24, 1981.
DOI : 10.1145/358722.358740

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

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

I. M. Hodkinson, F. Wolter, and M. Zakharyaschev, Decidable fragment of firstorder temporal logics, Ann. Pure Appl. Logic, vol.106, pp.1-3, 2000.

Z. Manna and A. Pnueli, The Temporal Logic of Reactive and Concurrent Systems: Specification, 1991.
DOI : 10.1007/978-1-4612-0931-7

S. Merz, Decidability and incompleteness results for first-order temporal logics of linear time, Journal of Applied Non-Classical Logics, vol.56, issue.1, 1992.
DOI : 10.1016/0304-3975(86)90157-X

R. Milner, Communicating and Mobile Systems: the Pi-Calculus, 1999.

M. L. Minsky, Computation: finite and infinite machines, 1967.

M. Nielsen, C. Palamidessi, and F. Valencia, On the expressive power of temporal concurrent constraint programming languages, Proceedings of the 4th ACM SIGPLAN international conference on Principles and practice of declarative programming , PPDP '02, 2002.
DOI : 10.1145/571157.571173

M. Nielsen, C. Palamidessi, and F. Valencia, Temporal concurrent constraint programming: Denotation, logic and applications, Nordic Journal of Computing, vol.9, issue.1, 2002.
DOI : 10.7146/brics.v8i48.21708
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.16.3124

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

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

V. A. Saraswat, Concurrent constraint programming, Proceedings of the 17th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '90, 1993.
DOI : 10.1145/96709.96733

V. A. Saraswat, M. Rinard, and P. Panangaden, The semantic foundations of concurrent constraint programming, Proceedings of the 18th ACM SIGPLAN-SIGACT symposium on Principles of programming languages , POPL '91, 1991.
DOI : 10.1145/99583.99627

A. Szalas and L. Holenderski, Incompleteness of first-order temporal logic with until, Theoretical Computer Science, vol.57, issue.2-3, 1988.
DOI : 10.1016/0304-3975(88)90045-X

F. D. Valencia, Decidability of infinite-state timed CCP processes and first-order LTL, Theoretical Computer Science, vol.330, issue.3, 2005.
DOI : 10.1016/j.tcs.2004.10.009