, Deciding knowledge in security protocols under equational theories, Theoretical Computer Science, vol.367, issue.1-2, pp.2-32, 2006.
DOI : 10.1016/j.tcs.2006.08.032
URL : https://hal.archives-ouvertes.fr/inria-00000554
, The AVANTSSAR Platform for the Automated Validation of Trust and Security of Service-Oriented Architectures, of Lecture Notes in Computer Science, pp.267-282, 2012.
DOI : 10.1007/978-3-642-28756-5_19
URL : https://hal.archives-ouvertes.fr/hal-00759725
, Modeling and reasoning about business processes under authorization constraints: A planning-based approach, Proceedings of the Twenty-Third International Conference on Automated Planning and Scheduling, ICAPS 2013, 2013.
DOI : 10.1007/978-3-642-03748-1_7
, Model checking authorization requirements in business processes, Computers & Security, vol.40, pp.1-22, 2014.
DOI : 10.1016/j.cose.2013.10.002
, Web Services Verification and Prudent Implementation, DPM/SETOP 2011, pp.173-189, 2012.
DOI : 10.1007/978-3-642-28879-1_12
URL : https://hal.archives-ouvertes.fr/hal-00641326
, Satisfiability of general intruder constraints with and without a set constructor, Journal of Symbolic Computation, vol.80, 2011.
DOI : 10.1016/j.jsc.2016.07.009
URL : https://hal.archives-ouvertes.fr/hal-01405842
, Towards the Orchestration of Secured Services under Non-disclosure Policies, MMM-ACNS, pp.130-145, 2012.
DOI : 10.1007/978-3-642-33704-8_12
URL : https://hal.archives-ouvertes.fr/hal-00755947
, Deciding security of protocols against off-line guessing attacks, Proceedings of the 12th ACM conference on Computer and communications security , CCS '05, pp.16-25, 2005.
DOI : 10.1145/1102120.1102125
, A High Level Protocol Specification Language for Industrial Security-Sensitive Protocols, of Automated Software Engineering. Austrian Computer Society, Austria, pp.193-205, 2004.
URL : https://hal.archives-ouvertes.fr/inria-00100219
, Automatic Composition of Services with Security Policies, 2008 IEEE Congress on Services, Part I, pp.529-537, 2008.
DOI : 10.1109/SERVICES-1.2008.13
URL : https://hal.archives-ouvertes.fr/inria-00330338
, Orchestration under Security Constraints, Proceedings of FMCO 2010, pp.23-44, 2012.
DOI : 10.1007/11805618_21
URL : https://hal.archives-ouvertes.fr/hal-00642855
, Deciding security properties for cryptographic protocols. application to key cycles, ACM Transactions on Computational Logic, vol.11, issue.2, 2010.
DOI : 10.1145/1656242.1656244
URL : https://hal.archives-ouvertes.fr/inria-00525775
, A logic for constraint-based security protocol analysis, 2006 IEEE Symposium on Security and Privacy (S&P'06), pp.155-168, 2006.
DOI : 10.1109/SP.2006.3
, Secure service orchestration in open networks, Journal of Systems Architecture, vol.57, issue.3, pp.231-239, 2011.
DOI : 10.1016/j.sysarc.2010.09.001
, On the security of public key protocols. Information Theory, IEEE Transactions on, vol.29, issue.2, pp.198-208, 1983.
, Role-based access control, 15th NIST-NCSC National Computer Security Conference, pp.554-563, 1992.
, Integrated Specification and Verification of Security Protocols and Policies, 2011 IEEE 24th Computer Security Foundations Symposium, pp.27-29, 2011.
DOI : 10.1109/CSF.2011.9
, A logic of trust and reputation, Logic Journal of IGPL, vol.18, issue.1, pp.214-244, 2010.
DOI : 10.1093/jigpal/jzp077
URL : https://hal.archives-ouvertes.fr/hal-00405595
, Infinite State AMC-Model Checking for Cryptographic Protocols, 22nd Annual IEEE Symposium on Logic in Computer Science (LICS 2007), pp.181-192, 2007.
DOI : 10.1109/LICS.2007.26
, Logical Analysis and Verification of Cryptographic Protocols, Thèse de doctorat, 2009.
, Trust and Norms in the Context of Computer Security: A Logical Formalization, Deontic Logic in Computer Science, pp.50-64, 2008.
DOI : 10.1007/978-3-540-70525-3_6
, On the Relative Soundness of the Free Algebra Model for Public Key Encryption, Proceedings of the 2007 FCS-ARSPA Workshop of Electronic Notes in Theoretical Computer Science, pp.43-54, 2005.
DOI : 10.1016/j.entcs.2004.05.018
, Towards an Integrated Formal Analysis for Security and Trust, 7th IFIP WG 6.1 International Conference, FMOODS 2005, pp.115-130, 2005.
DOI : 10.1007/3-540-45608-2_3
, Automatic recognition of tractability in inference relations, Journal of the ACM, vol.40, issue.2, pp.284-303, 1993.
DOI : 10.1145/151261.151265
, Constraint solving for bounded-process cryptographic protocol analysis, Proceedings of the 8th ACM conference on Computer and Communications Security , CCS '01, pp.166-175, 2001.
DOI : 10.1145/501983.502007
, Network of Excellence on Engineering Secure Future Internet Software Services and Systems, NESSoS project, pp.2010-2014
, Protocol insecurity with a finite number of sessions and composed keys is NP-complete, Theoretical Computer Science, vol.299, issue.1-3, pp.451-475, 2003.
DOI : 10.1016/S0304-3975(02)00490-5
, The CL-Atse Protocol Analyser, Term Rewriting and Applications (RTA). LNCS 4098, pp.277-286, 2006.
DOI : 10.1007/11805618_21
URL : https://hal.archives-ouvertes.fr/inria-00103573
, Towards the Secure Provision and Consumption in the Internet of Services, Privacy and Security in Digital Business -9th International Conference of Lecture Notes in Computer Science, 2012.
DOI : 10.1007/978-3-642-32287-7_19
, The SPaCIoS Project: Secure Provision and Consumption in the Internet of Services, 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation, p.2013, 2013.
DOI : 10.1109/ICST.2013.75