Bibliography
Major publications by the team in recent years
-
1M. Abadi, V. Cortier.
Deciding knowledge in security protocols under equational theories, in: Theoretical Computer Science, November 2006, vol. 387, no 1-2, p. 2-32. -
2A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, P.-C. Héam, O. Kouchnarenko, J. Mantovani, S. Mödersheim, D. von Oheimb, M. Rusinowitch, J. Santos Santiago, M. Turuani, L. Viganò, L. Vigneron.
The AVISPA Tool for the automated validation of internet security protocols and applications, in: 17th International Conference on Computer Aided Verification, CAV'2005, Edinburgh, Scotland, Lecture Notes in Computer Science, Springer, 2005, vol. 3576, p. 281-285. -
3A. Armando, S. Ranise, M. Rusinowitch.
A Rewriting Approach to Satisfiability Procedures, in: Journal of Information and Computation — Special Issue on Rewriting Techniques and Applications (RTA'01), June 2003, vol. 183, no 2, p. 140–164. -
4M. Baudet, V. Cortier, S. Kremer.
Computationally Sound Implementations of Equational Theories against Passive Adversaries, in: Information and Computation, April 2009, vol. 207, no 4, p. 496-520. -
5Y. Boichut, R. Courbis, P.-C. Héam, O. Kouchnarenko.
Finer is better: Abstraction Refinement for Rewriting Approximations, in: 19th International Conference on Rewriting Techniques and Applications - RTA'2008, Hagenberg, Austria, A. Voronkov (editor), Lecture Notes in Computer Science, Springer, 2008, vol. 5117, p. 48-62. -
6F. Bouquet, B. Legeard, F. Peureux.
CLPS-B: A Constraint Solver to Animate a B Specification, in: International Journal of Software Tools for Technology Transfer, STTT, August 2004, vol. 6, no 2, p. 143–157. -
7Y. Chevalier, R. Kuesters, M. Rusinowitch, M. Turuani.
Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption, in: ACM Transactions on Computational Logic (TOCL), 2008, vol. 9, Article 24. -
8Y. Chevalier, L. Vigneron.
Strategy for Verifying Security Protocols with Unbounded Message Size, in: Journal of Automated Software Engineering, April 2004, vol. 11, no 2, p. 141–166. -
9A. Giorgetti, J. Groslambert, J. Julliand, O. Kouchnarenko.
Verification of Class Liveness Properties with Java Modelling Language, in: IET Software, 2008, vol. 2, no 6, p. 500-514. -
10E. Nicolini, C. Ringeissen, M. Rusinowitch.
Combinable Extensions of Abelian Groups, in: Proc. of 22nd International Conference on Automated Deduction, CADE-22, Montreal, Canada, R. Schmidt (editor), Lecture Notes in Artificial Intelligence, Springer, 2009, vol. 5663, p. 51–66.
Doctoral Dissertations and Habilitation Theses
-
11M. Ahmad.
Stratégies d'optimisation de la mémoire pour la calcul d'applications linéaires et l'indexation de document partagés, Université Henri Poincaré - Nancy I, November 2011.
http://hal. inria. fr/ tel-00641866/ en -
12M. Arnaud.
Vérification formelle de protocoles de routage sécurisés, ENS Cachan, December 2011. -
13T. Avanesov.
Résolution de contraintes de déductibilité. Application à la composition de services Web sécurisés, Université Henri Poincaré - Nancy I, September 2011.
http://hal. inria. fr/ tel-00641237/ en -
14P.-C. Bué.
Contributions à la génération automatique de tests à partir de critères de sélection dynamique par abstraction de modèles, Université de Franche-Comté, September 2011. -
15S. Ciobaca.
Verification and Composition of Security Protocols with Applications to Electronic Voting, ENS Cachan, December 2011. -
16R. Courbis.
Contributions à l'analyse de systèmes par approximation d'ensembles réguliers, Université de Franche-Comté, September 2011.
http://hal. inria. fr/ tel-00643842/ en -
17L. Vigneron.
Déduction automatique appliquée à l'analyse et la vérification de systèmes infinis, Université Nancy II, November 2011, Habilitation à Diriger des Recherches.
http://hal. inria. fr/ tel-00642467/ en
Articles in International Peer-Reviewed Journal
-
18S. Anantharaman, H. Lin, C. Lynch, P. Narendran, M. Rusinowitch.
Unification modulo Homomorphic Encryption, in: Journal of Automated Reasoning, 2011, no A paraitre.
http://hal. inria. fr/ inria-00618336/ en -
19M. Berrima, N. Ben Rajeb, V. Cortier.
Deciding knowledge in security protocols under some e-voting theories, in: RAIRO - Theoretical Informatics and Applications, 2011. [ DOI : 10.1051/ita/2011119 ]
http://hal. inria. fr/ inria-00638515/ en -
20K. Cabrera Castillos, F. Dadeau, J. Julliand.
Scenario-based testing from UML/OCL behavioral models Application to POSIX compliance, in: International Journal on Software Tools for Technology Transfer (STTT), February 2011, vol. 13, no 5, p. 431-448. [ DOI : 10.1007/s10009-011-0189-7 ]
http://hal. inria. fr/ hal-00640379/ en -
21S. Ciobaca, S. Delaune, S. Kremer.
Computing knowledge in security protocols under convergent equational theories, in: Journal of Automated Reasoning, 2011, To appear. [ DOI : 10.1007/s10817-010-9197-7 ]
http://hal. inria. fr/ inria-00636794/ en -
22V. Cortier, S. Kremer, B. Warinschi.
A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems., in: Journal of Automated Reasoning, 2011, vol. 46, no 3-4, p. 225-259. [ DOI : 10.1007/s10817-010-9187-9 ]
http://hal. inria. fr/ inria-00525776/ en -
23P.-C. Héam.
On the Complexity of Computing the Profinite Closure of a Rational Language, in: Theoretical Computer Science, 2011, vol. 412, no 41, p. 5808-5813.
http://hal. inria. fr/ hal-00641554/ en -
24J. Lasalle, F. Bouquet, B. Legeard, F. Peureux.
SysML to UML model transformation for test generation purpose, in: ACM SIGSOFT Software Engineering Notes, 2011, vol. 36, no 1, p. 1-8. -
25C. Lynch, S. Ranise, C. Ringeissen, D.-K. Tran.
Automatic Decidability and Combinability, in: Information and Computation, 2011, vol. 209, no 7, p. 1026-1047. [ DOI : 10.1016/j.ic.2011.03.005 ]
http://hal. inria. fr/ inria-00586936/ en
International Conferences with Proceedings
-
26M. Arnaud, V. Cortier, S. Delaune.
Deciding security for protocols with recursive tests, in: 23rd International Conference on Automated Deduction (CADE'11), Wroclaw, Poland, N. Bjoerner, V. Sofronie-Stokkermans (editors), Springer, 2011, p. 49-63. [ DOI : 10.1007/978-3-642-22438-6_6 ]
http://hal. inria. fr/ inria-00638557/ en -
27T. Avanesov, Y. Chevalier, M. A. Mekki, M. Rusinowitch.
Web Services Verification and Prudent Implementation, in: 4th SETOP International Workshop on Autonomous and Spontaneous Security, Leuven, Belgium, Lecture Notes in Computer Science, Springer, 2012.
http://hal. inria. fr/ hal-00641326/ en -
28T. Avanesov, Y. Chevalier, M. A. Mekki, M. Rusinowitch, M. Turuani.
Distributed Orchestration of Web Services under Security Constraints, in: 4th SETOP International Workshop on Autonomous and Spontaneous Security, Leuven, Belgium, Lecture Notes in Computer Science, Springer, 2012.
http://hal. inria. fr/ hal-00641321/ en -
29W. Belkhir, A. Giorgetti.
Lazy Rewriting Modulo Associativity and Commutativity, in: WRS 2011, 10-th Int. workshop on Reduction Strategies in Rewriting and Programming, Novi Sad, Serbia, 2011, p. 17–21.
http://hal. inria. fr/ hal-00642515/ en -
30D. Bernhard, V. Cortier, O. Pereira, B. Smyth, B. Warinschi.
Adapting Helios for provable ballot secrecy, in: 16th European Symposium on Research in Computer Security (ESORICS'11), Louvain, Belgium, 2011.
http://hal. inria. fr/ inria-00638554/ en -
31K. Cabrera Castillos, J. Botella.
Scenario Based Test Generation Using Test Designer, in: 1st International Workshop on Scenario-Based Testing (SCENARIOS'2011), Berlin, Germany, F. Dadeau, L. du Bousquet (editors), IEEE Computer Society Press, July 2011, p. 79-88. [ DOI : 10.1109/ICSTW.2011.93 ]
http://hal. inria. fr/ hal-00640382/ en -
32K. Cabrera Castillos, F. Dadeau, J. Julliand, T. Safouan.
Measuring Test Properties Coverage for evaluating UML/OCL Model-Based Tests, in: 23rd IFIP Int. Conf. on Testing Software and Systems, Paris, France, B. Wolff, F. Zaidi (editors), Lecture Notes in Computer Science, Springer-Verlag, November 2011, vol. 7019. [ DOI : 10.1007/978-3-642-24580-0_4 ]
http://hal. inria. fr/ hal-00640312/ en -
33O. Chebaro, N. Kosmatov, A. Giorgetti, J. Julliand.
The SANTE Tool: Value Analysis, Program Slicing and Test Generation for C Program Debugging, in: 5th International Conference on Tests & Proofs, Zurich, Switzerland, Lecture Notes in Computer Science, June 2011, vol. 6706, p. 78-83.
http://hal. inria. fr/ inria-00622904/ en -
34A. Cherif, A. Imine, M. Rusinowitch.
Optimistic Access Control for Distributed Collaborative Editors, in: 2011 ACM Symposium on Applied Computing (SAC), Taichung, Taiwan, ACM, 2011, p. 861-868.
http://hal. inria. fr/ inria-00576880/ en -
35C. Chevalier, S. Delaune, S. Kremer.
Transforming Password Protocols to Compose, in: 31st Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'11), Mumbai, India, LIPIcs, 2011, vol. 13, p. 204-216.
http://hal. inria. fr/ inria-00636753/ en -
36Y. Chevalier, M. A. Mekki, M. Rusinowitch.
Orchestration under Security Constraints, in: Formal Methods for Components and Objects (FMCO 2010), Graz, Austria, B. Aichernig, F. de Boer, M. Bonsangue (editors), LNCS, Springer, November 2011, vol. 6957, p. 23-44.
http://hal. inria. fr/ hal-00642855/ en -
37H. Comon-Lundh, V. Cortier.
How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones., in: Symposium on Theoretical Aspects of Computer Science - STACS2011, Dortmund, Germany, LIPIcs, 2011, vol. 9, p. 29-44.
http://hal. inria. fr/ hal-00573590/ en -
38V. Cortier, J. Detrey, P. Gaudry, F. Sur, E. Thomé, M. Turuani, P. Zimmermann.
Ballot stuffing in a postal voting system, in: Revote 2011 - International Workshop on Requirements Engineering for Electronic Voting Systems, Trento, Italy, IEEE, 2011, p. 27 - 36. [ DOI : 10.1109/REVOTE.2011.6045913 ]
http://hal. inria. fr/ inria-00612418/ en -
39V. Cortier, B. Smyth.
Attacking and fixing Helios: An analysis of ballot secrecy, in: 24th IEEE Computer Security Foundations Symposium (CSF'11), Cernay-la-Ville, France, IEEE Computer Society Press, 2011, p. 297-311. [ DOI : 10.1109/CSF.2011.27 ]
http://hal. inria. fr/ inria-00638556/ en -
40V. Cortier, B. Warinschi.
A composable computational soundness notion (Abstract), in: 7th Workshop on Formal and Computational Cryptography (FCC 2011), Paris, France, 2011.
http://hal. inria. fr/ inria-00638558/ en -
41V. Cortier, B. Warinschi.
A Composable Computational Soundness Notion, in: 18th ACM Conference on Computer and Communications Security, Chicago, United States, ACM, 2011, p. 63-74.
http://hal. inria. fr/ inria-00638552/ en -
42R. Courbis.
Rewriting Approximations For Properties Verification Over CCS Specifications, in: FSEN'11, 4th Int. Conf. of Fundamentals of Software Ingeneering, Teheran, Iran, Lecture Notes in Computer Science, Springer, April 2011, To appear. -
43G. Cécé, A. Giorgetti.
Simulations over Two-Dimensional On-Line Tessellation Automata, in: DLT 2011, Developments in Language Theory, Milan, Italy, G. Mauri, A. Leporati (editors), Springer, 2011, vol. 6795, p. 141–152. [ DOI : 10.1007/978-3-642-22321-1_13 ]
http://hal. inria. fr/ hal-00642531/ en -
44F. Dadeau, P.-C. Héam, R. Kheddam.
Mutation-Based Test Generation from Security Protocols in HLPSL, in: 4th International Conference on Software Testing Verification and Validation (ICST'2011), Berlin, Germany, IEEE Computer Society Press, March 2011, p. 240-248. [ DOI : 10.1109/ICST.2011.42 ]
http://hal. inria. fr/ inria-00559850/ en -
45F. Dadeau, F. Peureux.
Grey-Box Testing and Verification of Java/JML, in: 3rd International Workshop on Constraints in Software Testing Verification and Analysis, Berlin, Germany, A. Gotlieb, G. Fraser (editors), IEEE Computer Society Press, July 2011, p. 298-303. [ DOI : 10.1109/ICSTW.2011.30 ]
http://hal. inria. fr/ hal-00640381/ en -
46J. Dormoy, O. Kouchnarenko, A. Lanoix.
Runtime Verification of Temporal Patterns for Dynamic Reconfigurations of Components, in: FACS 2011, Oslo, Norway, LNCS, September 2011.
http://hal. inria. fr/ hal-00642345/ en -
47J. Dormoy, O. Kouchnarenko, A. Lanoix.
Using Temporal Logic for Dynamic Reconfigurations of Components, in: 7th International Workshop on Formal Aspects of Component Software - FACS'2010, Guimaraes, Portugal, January 2011.
http://hal. inria. fr/ inria-00541613/ en -
48I. Enderlin, F. Dadeau, A. Giorgetti, A. Ben Othman.
Praspel: A Specification Language for Contract-Based Testing in PHP, in: 23rd IFIP Int. Conf. on Testing Software and Systems (ICTSS'11), Paris, France, B. Wolff, F. Zaidi (editors), Lecture Notes in Computer Science, Springer-Verlag, November 2011, vol. 7019, p. 64–79. [ DOI : 10.1007/978-3-642-24580-0_6 ]
http://hal. inria. fr/ hal-00640279/ en -
49E. Fourneret, F. Bouquet, F. Dadeau, S. Debricon.
Selective Test Generation Method for Evolving Critical Systems, in: 1st International Workshop on Regression Testing, Berlin, Germany, P. Runeson, S. Yoo (editors), IEEE Computer Society Press, July 2011. [ DOI : 10.1109/ICSTW.2011.95 ]
http://hal. inria. fr/ hal-00640384/ en -
50E. Fourneret, F. Bouquet.
UML/OCL based impact analysis to test evolving critical software, in: ETAI'11, Society for Electronics, Telecommunications, Automatics and Informatics 10-th Int. Conf., Ohrid, Macedonia, The Former Yugoslav Republic Of, September 2011.
http://hal. inria. fr/ hal-00649252/ en -
51E. Fourneret, M. Ochoa, F. Bouquet, J. Botella, J. Jürjens, P. Yousefi.
Model-Based Security Verification and Testing for Smart-cards, in: ARES 2011, 6-th Int. Conf. on Availability, Reliability and Security, Vienna, Austria, IEEE, 2011, p. 272-279.
http://hal. inria. fr/ hal-00649256/ en -
52P.-C. Héam, V. Hugot, O. Kouchnarenko.
Loops and Overloops for Tree Walking Automata, in: International Conference on Implementation and Application of Automata, Blois, France, Lecture Notes in Computer Science, Springer, 2011, vol. 6807, p. 166-177.
http://hal. inria. fr/ hal-00641743/ en -
53P.-C. Héam, C. Masson.
A Random Testing Approach Using Pushdown Automata, in: Tests and Proofs, Zurich, Switzerland, Lecture Notes in Computer Science, Springer, 2011, vol. 6706, p. 119-133.
http://hal. inria. fr/ hal-00641750/ en -
54P.-C. Héam, C. Nicaud.
Seed, an Easy-to-Use Random Generator of Recursive Data Structures for Testing, in: 4th IEEE International Conference on Software Testing, Verification and Validation (ICST'11), Berlin, Germany, IEEE, 2011, p. 60 - 69. [ DOI : 10.1109/ICST.2011.31 ]
http://hal. inria. fr/ hal-00620373/ en -
55A. Lanoix, J. Dormoy, O. Kouchnarenko.
Combining Proof and Model-checking to Validate Reconfigurable Architectures, in: FESCA 2011, joint to ETAPS 2011, Saarbrucken, Germany, Electronic Notes in Theoretical Computer Science, April 2011, vol. 279:2, p. 43-57.
http://hal. inria. fr/ hal-00642348/ en -
56J. Lasalle, F. Peureux, F. Fondement.
Development of an automated MBT toolchain from UML/SysML models, in: UML & FM 2011, Limerick, Ireland, Ireland, 2011, p. 247–256, 4-th IEEE Int. Workshop on UML and Formal Methods. Published in a special issue of Innovations in Systems and Software Engineering (ISSE) NASA journal, Volume 7, Number 4.
http://hal. inria. fr/ hal-00649263/ en -
57J. Lasalle, F. Peureux, J. Guillet.
Automatic test concretization to supply end-to-end MBT for automotive mecatronic systems, in: ETSE 2011, 1st Int. Workshop on End-to-End Test Script Engineering. In conjuction with ISSTA 2011, Toronto, Canada, Canada, 2011, p. 16–23. [ DOI : 10.1145/2002931.2002934 ]
http://hal. inria. fr/ hal-00649265/ en -
58J. Prasad Achara, A. Imine, M. Rusinowitch.
DeSCal — Decentralized Shared Calendar for P2P and Ad-Hoc Networks, in: The 10th International Symposium on Parallel and Distributed Computing (ISPDC 2011), Cluj-Napoca, Romania, July 2011.
http://hal. inria. fr/ hal-00644749/ en -
59C. Ringeissen, V. Senni.
Modular Termination and Combinability for Superposition Modulo Counter Arithmetic, in: Frontiers of Combining Systems, 8th International Symposium, FroCoS'2011, Saarbruecken, Germany, Lecture Notes in Artificial Intelligence, Springer, 2011, vol. 6989, p. 211-226. [ DOI : 10.1007/978-3-642-24364-6_15 ]
http://hal. inria. fr/ inria-00636589/ en
Scientific Books (or Scientific Book chapters)
-
60F. Bouquet, B. Legeard, N. Pickaert.
Industrialiser le test fonctionnel Pour maîtriser les risques métier et accroître l'efficacité du test, DUNOD, November 2011.
http://hal. inria. fr/ hal-00645019/ en -
61F. Dadeau, F. Peureux, B. Legeard, R. Tissot, J. Julliand, P.-A. Masson, F. Bouquet.
Test Generation using Symbolic Animation of Models, in: Model-Based Testing for Embedded Systems, J. Zander, I. Schieferdecker, P. J. Mosterman (editors), Series on Computational Analysis, Synthesis, Design of Dynamic Systems, CRC Press, September 2011.
http://hal. inria. fr/ inria-00532604/ en -
62F. Massacci, F. Bouquet, E. Fourneret, J. Jürjens, M. Lund, S. Madelénat, J. Muehlberg, F. Paci, S. Paul, F. Piessens, B. Solhaug, S. Wenzel.
Orchestrating Security and System Engineering for Evolving Systems, in: Towards a Service-Based Internet, 2011, vol. 6994, p. 134–143. [ DOI : 10.1007/978-3-642-24755-2_12 ]
http://hal. inria. fr/ hal-00649258/ en
Books or Proceedings Editing
-
63V. Cortier, K. Chatzikokolakis (editors)
Proceedings of the 8th International Workshop on Security Issues in Concurrency, Electronic Proceedings in Theoretical Computer Science, 2011, 51 p. [ DOI : 10.4204/EPTCS.51 ]
http://hal. inria. fr/ hal-00641020/ en -
64S. Kremer, V. Cortier (editors)
Formal Models and Techniques for Analyzing Security Protocols, Cryptology and Information Security Series, IOS Press, 2011, vol. 5.
http://hal. inria. fr/ inria-00636787/ en
Internal Reports
-
65S. Anantharaman, C. Bouchard, P. Narendran, M. Rusinowitch.
Unification modulo Block Chaining, September 2011, To appear.
http://hal. inria. fr/ inria-00618376/ en -
66S. Anantharaman, P. Narendran, M. Rusinowitch.
String rewriting and security analysis: An extension of a result of Book and Otto, 2011, To appear.
http://hal. inria. fr/ hal-00659009 -
67R. Chadha, S. Ciobaca, S. Kremer.
Automated verification of equivalence properties of cryptographic protocols, October 2011.
http://hal. inria. fr/ inria-00632564/ en -
68A. Cherif, A. Imine.
On the Undoability Problem in Distributed Collaborative Applications, November 2011.
http://hal. inria. fr/ hal-00646127/ en -
69V. Cortier, C. Wiedling.
A formal analysis of the Norwegian e-voting protocol, INRIA, November 2011, no RR-7781.
http://hal. inria. fr/ inria-00636115/ en -
70H. Mahfoud, A. Imine.
Secure Querying of Recursive XML Views: A Standard XPath-based Technique, November 2011.
http://hal. inria. fr/ hal-00646135/ en -
71B. Smyth, V. Cortier.
A note on replay attacks that violate privacy in electronic voting schemes, INRIA, June 2011, no RR-7643.
http://hal. inria. fr/ inria-00599182/ en
Other Publications
-
72W. Belkhir, A. Giorgetti, M. Lenczner.
Rewriting and Symbolic Transformations for Multiscale Methods, 2011, 25 pages.
http://hal. inria. fr/ hal-00643047/ en -
73P.-C. Héam, V. Hugot, O. Kouchnarenko.
From Linear Temporal Logic Properties to Rewrite Propositions, October 2011, Work document.
http://hal. inria. fr/ hal-00643416/ en
-
74A. Armando, D. Basin, Y. Boichut, Y. Chevalier, L. Compagna, J. Cuellar, P. Hankes Drielsma, P.-C. Héam, O. Kouchnarenko, J. Mantovani, S. Mödersheim, D. Von Oheimb, M. Rusinowitch, J. Santos Santiago, L. Vigano, M. Turuani, L. Vigneron.
The AVISPA Tool for the automated validation of internet security protocols and applications, in: 17th International Conference on Computer Aided Verification - CAV 2005, Lecture Notes in Computer Science, Springer, 2005, vol. 3576, p. 281-285. -
75C. Arora, M. Turuani.
Validating Integrity for the Ephemerizer's Protocol with CL-Atse, in: Formal to Practical Security: Papers Issued from the 2005-2008 French-Japanese Collaboration, Lecture Notes in Computer Science, Springer, 2009, vol. 5458, p. 21–32. -
76F. Baader, K. U. Schulz.
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures, in: Journal of Symbolic Computation, February 1996, vol. 21, no 2, p. 211–243. -
77F. Bellegarde, C. Darlot, J. Julliand, O. Kouchnarenko.
Reformulation: a Way to Combine Dynamic Properties and Refinement, in: International Symposium Formal Methods Europe (FME 2001), LNCS, Springer-Verlag, 2001, vol. 2021. -
78E. Bernard, B. Legeard, X. Luck, F. Peureux.
Generation of Test Sequences from Formal Specifications: GSM 11-11 Standard Case-Study, in: International Journal on Software Practice and Experience, 2004, vol. 34, no 10, p. 915–948. -
79Y. Boichut, P.-C. Héam, O. Kouchnarenko.
Vérifier automatiquement les protocoles de sécurité, in: Techniques de l'ingénieur, October 2007, p. RE95-1–RE95-8. -
80F. Bouquet, B. Legeard.
Reification of Executable Test Scripts in Formal Specification-Based Test Generation: The Java Card Transaction Mechanism Case Study, in: Formal Methods, FME 2003, Springer-Verlag, September 2003, vol. 2805, p. 778–795. -
81F. Bouquet, B. Legeard, F. Peureux.
CLPS-B - A Constraint Solver for B, in: International Conference on Tools and Algorithms for Construction and Analysis of Systems, TACAS2002, Grenoble, France, Lecture Notes in Computer Science, Springer, April 2002, vol. 2280, p. 188–204. -
82V. Cortier, S. Delaune, P. Lafourcade.
A Survey of Algebraic Properties Used in Cryptographic Protocols, in: Journal of Computer Security, 2006, vol. 14, no 1, p. 1–43.
http://www. loria. fr/ ~cortier/ Papiers/ survey. ps -
83P.-C. David, T. Ledoux, T. Coupaye, M. Léger.
FPath and FScript: Language support for navigation and reliable reconfiguration of Fractal architectures, in: Annales des telecommunications-annals of telecommunications, December 2008, vol. Volume 64, no Numbers 1-2 / février 2009, p. 45-63.
http://hal. inria. fr/ hal-00468474/ en -
84J. Dick, A. Faivre.
Automating the Generation and Sequencing of Test Cases from Model-Based Specifications, in: FME'93: Industrial-Strength Formal Methods, Lecture Notes in Computer Science, Springer-Verlag, April 1993, vol. 670, p. 268–284. -
85S. Even, O. Goldreich.
On the Security of Multi-Party Ping-Pong Protocols, in: IEEE Symposium on Foundations of Computer Science, 1983, p. 34-39.
http://citeseer. ist. psu. edu/ 46982. html -
86M.-C. Gaudel, A. Denise, S.-D. Gouraud, R. Lassaigne, J. Oudinet, S. Peyronnet.
Coverage-biased Random Exploration of Models, in: Electr. Notes Theor. Comput. Sci., 2008, vol. 220, no 1, p. 3-14. -
87P.-C. Héam, O. Kouchnarenko, Y. Boichut.
Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives, in: Joint Proceedings of the 8th, 9th, and 10th International Workshops on Verification of Infinite-State Systems (INFINITY), Lisbon, Portugal, Electronic Notes in Theoretical Computer Science, 2009, vol. 239.
http://hal. inria. fr/ inria-00429356/ en/ -
88B. Legeard, F. Bouquet, N. Pickaert.
Industrialiser le test fonctionnel, Management des systèmes d'information, Dunod, 2009.
http://hal. inria. fr/ inria-00430538/ en/ -
89N. Liu, W. ye Zhu, Y. fei Zhu.
Security Protocol Analysis Based on Rewriting Approximation, in: . Second International Symposium on Electronic Commerce and Security, ISECS '09, IEEE, 2009, p. 318-322. -
90M. Turuani.
The CL-AtSe Protocol Analyser, in: Term Rewriting and Applications - Proc. of RTA, Seattle, WA, USA, Lecture Notes in Computer Science, 2006, vol. 4098, p. 277–286.