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, n^o 1-2, pp. 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. Vigano, 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, pp. 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, n^o 2, pp. 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, n^o 4, pp. 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, pp. 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, n^o 2, pp. 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, n^o 2, pp. 141–166.
• 9F. 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, M. Harman, B. Korel (editors), IEEE Computer Society Press, March 2011. [ DOI : 10.1109/ICST.2011.42 ]
  http://hal.inria.fr/inria-00559850/en
• 10A. Giorgetti, J. Groslambert, J. Julliand, O. Kouchnarenko.
  Verification of Class Liveness Properties with Java Modelling Language, in: IET Software, 2008, vol. 2, n^o 6, pp. 500-514.
• 11E. 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, pp. 51–66.

Publications of the year

Doctoral Dissertations and Habilitation Theses

• 12K. Cabrera Castillos.
  Generation automatique de scenarios de tests à partir de proprietes temporelles et de modèles comportementaux, Université de Franche-Comté, November 2013.
  http://hal.inria.fr/tel-00924485
• 13V. Hugot.
  Tree Automata, Approximations, and Constraints for Verification. Tree (Not-Quite) Regular Model-Checking, Université de Franche-Comté, September 2013, co-directeur: Pierre-Cyrille Héam.
  http://hal.inria.fr/tel-00909608
• 14E. Tushkanova.
  Calculs schématiques pour l'analyse de procédures de décision, Université de Franche-Comté, July 2013.
  http://hal.inria.fr/tel-00910929

Articles in International Peer-Reviewed Journals

• 15S. Anantharaman, C. Bouchard, P. Narendran, M. Rusinowitch.
  Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining, in: Logical Methods in Computer Science, 2014, (To appear).
  http://hal.inria.fr/hal-00854841
• 16M. Arnaud, V. Cortier, S. Delaune.
  Modeling and Verifying Ad Hoc Routing Protocols, in: Information and Computation, 2013, To appear.
  http://hal.inria.fr/hal-00881009
• 17M. Baudet, V. Cortier, S. Delaune.
  YAPA: A generic tool for computing intruder knowledge, in: ACM Transactions on Computational Logic, 2013, vol. 14, n^o 1. [ DOI : 10.1145/2422085.2422089 ]
  http://hal.inria.fr/hal-00732901
• 18W. Belkhir, A. Giorgetti, L. Michel.
  A Symbolic Transformation Language and its Application to a Multiscale Method, in: Journal of Symbolic Computation, December 2013.
  http://hal.inria.fr/hal-00917323
• 19A. Cherif, A. Imine, M. Rusinowitch.
  Practical access control management for distributed collaborative editors, in: Pervasive and Mobile Computing, September 2013. [ DOI : 10.1016/j.pmcj.2013.09.004 ]
  http://hal.inria.fr/hal-00915315
• 20V. Cheval, V. Cortier, S. Delaune.
  Deciding equivalence-based properties using constraint solving, in: Theoretical Computer Science, 2013, vol. 492, pp. 1-39. [ DOI : 10.1016/j.tcs.2013.04.016 ]
  http://hal.inria.fr/hal-00881060
• 21C. Chevalier, S. Delaune, S. Kremer, M. D. Ryan.
  Composition of Password-based Protocols, in: Formal Methods in System Design, 2013. [ DOI : 10.1007/s10703-013-0184-6 ]
  http://hal.inria.fr/hal-00878640
• 22V. Cortier, B. Smyth.
  Attacking and fixing Helios: An analysis of ballot secrecy, in: Journal of Computer Security, 2013, vol. 21, n^o 1, pp. 89-148. [ DOI : 10.3233/JCS-2012-0458 ]
  http://hal.inria.fr/hal-00732899
• 23V. Cortier, G. Steel.
  A Generic Security API for Symmetric Key Management on Cryptographic Devices, in: Information and Computation, 2013, To appear.
  http://hal.inria.fr/hal-00881072
• 24D. Galindo.
  A note on an IND-CCA2 secure Paillier-based cryptosystem, in: Information Processing Letters, November 2013, vol. 113, n^o 22-24, pp. 913-914. [ DOI : 10.1016/j.ipl.2013.09.008 ]
  http://hal.inria.fr/hal-00909726
• 25D. Galindo, S. Vivek.
  Limits of a conjecture on a leakage-resilient cryptosystem, in: Information Processing Letters, April 2014, vol. 114, n^o 4, pp. 192-196. [ DOI : 10.1016/j.ipl.2013.11.014 ]
  http://hal.inria.fr/hal-00933429
• 26B. Yang, W. Belkhir, M. Lenczner.
  Computer-Aided Derivation of Multi-scale Models: A Rewriting Framework, in: International Journal for Multiscale Computational Engineering, December 2013, 26 pages.
  http://hal.inria.fr/hal-00916568

Invited Conferences

• 27F. Jacquemard, M. Rusinowitch.
  Unranked tree rewriting and effective closures of languages, in: Meeting of the IFIP WG 1.6 on Term Rewriting, Eindhoven, Netherlands, Jürgen Giesl, June 2013.
  http://hal.inria.fr/hal-00852379
• 28M. Rusinowitch.
  Automated verification of security protocols and application to services, in: Verification and Evaluation of Computer and Communication Systems, Florence, Italy, H. Boucheneb, F. Flammini (editors), Alessandro Fantechi, University of Florence, Italy, November 2013.
  http://hal.inria.fr/hal-00915323
• 29L. Vigneron.
  Déduction automatique appliquée à l'analyse et la vérification de systèmes infinis, in: Approches Formelles dans l'Assistance au Développement de Logiciels, Nancy, France, J. Souquières, V. Wiels (editors), April 2013.
  http://hal.inria.fr/hal-00916581

International Conferences with Proceedings

• 30F. Ambert, F. Bouquet, J. Lasalle, B. Legeard, F. Peureux.
  Applying a Def-Use Approach on Signal Exchange to Implement SysML Model-Based Testing, in: ECMFA'13, 9-th European Conference on Modelling Foundations and Applications, Montpellier, France, Lecture Notes in Computer Science, Springer, 2013, vol. 7949, pp. 134–151. [ DOI : 10.1007/978-3-642-39013-5_10 ]
  http://hal.inria.fr/hal-00913694
• 31M. Arapinis, V. Cortier, S. Kremer, M. D. Ryan.
  Practical Everlasting Privacy, in: 2nd Conferences on Principles of Security and Trust (POST'13), Rome, Italy, D. Basin, J. Mitchell (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 7796, pp. 21-40. [ DOI : 10.1007/978-3-642-36830-1_2 ]
  http://hal.inria.fr/hal-00878630
• 32M. Arnaud, V. Cortier, C. Wiedling.
  Analysis of an electronic Boardroom Voting System, in: VoteID'13 - 4th International Conference on e-Voting and Identity - 2013, Guildford, United Kingdom, J. Heather, S. Schneider, V. Teague (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 7985, pp. 109-126. [ DOI : 10.1007/978-3-642-39185-9_7 ]
  http://hal.inria.fr/hal-00881011
• 33H. Bao Thien, A. Imine.
  On Constrained Adding Friends in Social Networks, in: SocInfo - The 5th International Conference on Social Informatics - 2013, Kyoto, Japan, A. Jatowt, E.-P. Lim, Y. Ding, A. Miura, T. Tezuka, G. Dias, K. Tanaka, A. J. Flanagin, B. T. Dai (editors), Lecture Notes in Computer Science, Springer, November 2013, vol. 8238, pp. 467-477. [ DOI : 10.1007/978-3-319-03260-3_40 ]
  http://hal.inria.fr/hal-00916037
• 34W. Belkhir, Y. Chevalier, M. Rusinowitch.
  Fresh-Variable Automata for Service Composition, in: SYNASC 2013 -15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, Timisoara, Romania, IEEE, September 2013, 28 pages. 4 Figures.
  http://hal.inria.fr/hal-00914778
• 35F. Boehl, V. Cortier, B. Warinschi.
  Deduction Soundness: Prove One, Get Five for Free, in: CCS '13 - Proceedings of the 2013 ACM SIGSAC Conference on Computer and Communications Security - 2013, Berlin, Germany, ACM, 2013, pp. 1261-1272. [ DOI : 10.1145/2508859.2516711 ]
  http://hal.inria.fr/hal-00881023
• 36K. Cabrera Castillos, F. Dadeau, J. Julliand, S. Taha, B. Kanso.
  A Compositional Automata-based Semantics for Property Patterns, in: iFM'2013 - 10th International Conference on integrated Formal Methods, Turku, Finland, E. Johnsen, L. Petre (editors), Lecture Notes in Computer Science, Springer, June 2013, vol. 7940, pp. 316-330. [ DOI : 10.1007/978-3-642-38613-8_22 ]
  http://hal.inria.fr/hal-00912628
• 37V. Cheval, V. Cortier, A. Plet.
  Lengths may break privacy – or how to check for equivalences with length, in: CAV'13 - 25th International Conference on Computer Aided Verification - 2013, Saint Petersbourg, Russian Federation, N. Sharygina, H. Veith (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 8044, pp. 708-723. [ DOI : 10.1007/978-3-642-39799-8_50 ]
  http://hal.inria.fr/hal-00881065
• 38R. Chrétien, V. Cortier, S. Delaune.
  From security protocols to pushdown automata, in: ICALP'2013 - 40th International Colloquium on Automata, Languages and Programming - 2013, Riga, Lithuania, F. V. Fomin, R. Freivalds, M. Kwiatkowska, D. Peleg (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 7966, pp. 137-149. [ DOI : 10.1007/978-3-642-39212-2_15 ]
  http://hal.inria.fr/hal-00881066
• 39H. Comon-Lundh, V. Cortier, G. Scerri.
  Tractable inference systems: an extension with a deducibility predicate, in: CADE'24 - 24th International Conference on Automated Deduction - 2013, Lake Placid, United States, M. P. Bonacina (editor), Lecture Notes in Computer Science, Springer, 2013, vol. 7898, pp. 91-108. [ DOI : 10.1007/978-3-642-38574-2_6 ]
  http://hal.inria.fr/hal-00881068
• 40V. Cortier, D. Galindo, S. Glondu, M. Izabachène.
  Distributed ElGamal à la Pedersen - Application to Helios, in: WPES 2013 - Proceedings of the 12th ACM workshop on privacy in the electronic society - 2013, Berlin, Germany, ACM, 2013, pp. 131-142. [ DOI : 10.1145/2517840.2517852 ]
  http://hal.inria.fr/hal-00881076
• 41F. Dadeau, K. Cabrera Castillos, Y. Ledru, T. Triki, G. Vega, J. Botella, S. Taha.
  Test Generation and Evaluation from High-Level Properties for Common Criteria Evaluations – The TASCCC Testing Tool, in: ICST'2013 - IEEE Sixth International Conference on Software Testing, Verification and Validation, Luxembourg, Luxembourg, B. Baudry, A. Orso (editors), Yves Le Traon, March 2013, pp. 431-438. [ DOI : 10.1109/ICST.2013.60 ]
  http://hal.inria.fr/hal-00912639
• 42A. Dreyfus, P.-C. Heam, O. Kouchnarenko.
  Enhancing Approximations for Regular Reachability Analysis, in: CIAA 2013 - 18th International Conference on Implementation and Application of Automata - 2013, Halifax, Canada, S. Konstantinidis (editor), Lecture Notes in Computer Science, Springer, July 2013, vol. 7982, pp. 331-339. [ DOI : 10.1007/978-3-642-39274-0_29 ]
  http://hal.inria.fr/hal-00909204
• 43A. Dreyfus, P.-C. Heam, O. Kouchnarenko.
  Random Grammar-based Testing for Covering All Non-Terminals, in: 2013 IEEE Sixth International Conference on Software Testing, Verification and Validation - CSTVA Workshop, Luxembourg, Luxembourg, IEEE, March 2013.
  http://hal.inria.fr/hal-00909225
• 44I. Enderlin, A. Giorgetti, F. Bouquet.
  A Constraint Solver for PHP Arrays, in: ICSTW - Sixth International IEEE Conference on Software Testing, Verification and Validation Workshops - 2013, Luxembourg, Luxembourg, IEEE, 2013, pp. 218-223. [ DOI : 10.1109/ICSTW.2013.80 ]
  http://hal.inria.fr/hal-00909202
• 45S. Erbatur, D. Kapur, A. Marshall, P. Narendran, C. Ringeissen.
  Hierarchical Combination, in: CADE-24 - 24th International Conference on Automated Deduction - 2013, Lake Placid, United States, M. P. Bonacina (editor), Lecture Notes in Computer Science, Springer, June 2013, vol. 7898, pp. 249-266. [ DOI : 10.1007/978-3-642-38574-2_17 ]
  http://hal.inria.fr/hal-00878649
• 46D. Galindo, S. Vivek.
  A Leakage-Resilient Pairing-Based Variant of the Schnorr Signature Scheme, in: 14th IMA International Conference, IMACC 2013, Oxford, United Kingdom, M. Stam (editor), LNCS, Springer, December 2013, vol. 8308.
  http://hal.inria.fr/hal-00909745
• 47J.-M. Gauthier, F. Bouquet, A. Hammad, F. Peureux.
  Verification and Validation of Meta-Model Based Transformation from SysML to VHDL-AMS, in: MODELSWARD 2013, 1st Int. Conf. on Model-Driven Engineering and Software Development, Barcelona, Spain, 2013, pp. 123–128.
  http://hal.inria.fr/hal-00913739
• 48H. Ghabri, G. Maatoug, M. Rusinowitch.
  Compiling symbolic attacks to protocol implementation tests, in: Fourth International Symposium on Symbolic Computation in Software Science, Tunis, Tunisia, EPTCS, Adel Bouhoula and Tetsuo Ida and Fairouz Kamareddine, October 2013, vol. 122. [ DOI : 10.4204/EPTCS.122.4 ]
  http://hal.inria.fr/hal-00915320
• 49F. Jacquemard, M. Rusinowitch.
  Rewrite Closure and CF Hedge Automata, in: 7th International Conference on Language and Automata Theory and Application, Bilbao, Spain, Lecture Notes in Computer Science, Springer, 2013.
  http://hal.inria.fr/hal-00767719
• 50S. Kremer, R. Künnemann, G. Steel.
  Universally Composable Key-Management, in: 18th European Symposium on Research in Computer Security (ESORICS'13), Egham, United Kingdom, J. Crampton, S. Jajodia (editors), Lecture Notes in Computer Science, Springer, 2013, vol. 8134. [ DOI : 10.1007/978-3-642-40203-6_19 ]
  http://hal.inria.fr/hal-00878632
• 51H. Mahfoud, A. Imine, M. Rusinowitch.
  SVMAX: a system for secure and valid manipulation of XML data, in: IDEAS'13 Proceedings of the 17th International Database Engineering & Applications Symposium, Barcelone, Spain, B. C. Desai, J.-L. Larriba-Pey, J. Bernardino (editors), ACM, October 2013. [ DOI : 10.1145/2513591.2513657 ]
  http://hal.inria.fr/hal-00915318
• 52A. Randolph, A. Imine, H. Boucheneb, Q. Alejandro.
  Specification and Verification Using Alloy of Optimistic Access Control for Distributed Collaborative Editors, in: 18th International Workshop on Formal Methods for Industrial Critical Systems, Madrid, Spain, C. Pecheur, M. Dierkes (editors), Lecture Notes in Computer Science, Springer, September 2013, vol. 8187, pp. 184-198. [ DOI : 10.1007/978-3-642-41010-9_13 ]
  http://hal.inria.fr/hal-00917001
• 53E. Tushkanova, C. Ringeissen, A. Giorgetti, O. Kouchnarenko.
  Automatic Decidability: A Schematic Calculus for Theories with Counting Operators, in: RTA - 24th International Conference on Rewriting Techniques and Applications - 2013, Eindhoven, Netherlands, LIPIcs, Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik, June 2013, vol. 21, pp. 303-318. [ DOI : 10.4230/LIPIcs.RTA.2013.303 ]
  http://hal.inria.fr/hal-00878657

Conferences without Proceedings

• 54S. Erbatur, D. Kapur, A. Marshall, P. Narendran, C. Ringeissen.
  Hierarchical Combination of Unification Algorithms, in: The 27th International Workshop on Unification (UNIF 2013), Eindhoven, Netherlands, June 2013.
  http://hal.inria.fr/hal-00920509
• 55E. Tushkanova, C. Ringeissen, A. Giorgetti, O. Kouchnarenko.
  Automatic Decidability for Theories with Counting Operators, in: Automated Deduction: Decidability, Complexity, Tractability (workshop ADDCT), Lake Placid, United States, June 2013.
  http://hal.inria.fr/hal-00920496

Books or Proceedings Editing

• 56P. Fontaine, C. Ringeissen, R. Schmidt (editors)
  Frontiers of Combining Systems, Lecture Notes in Artificial Intelligence, Springer, September 2013, vol. 8152, 359 p.
  http://hal.inria.fr/hal-00868424

Internal Reports

• 57R. Chrétien, V. Cortier, S. Delaune.
  From security protocols to pushdown automata, Inria, April 2013, n^o RR-8290.
  http://hal.inria.fr/hal-00817230

Scientific Popularization

• 58A. Imine, M. Rusinowitch.
  Secure Collaboration for Smartphones, in: ERCIM News, April 2013, n^o 93.
  http://hal.inria.fr/hal-00915317

Other Publications

• 59W. Belkhir, Y. Chevalier, M. Rusinowitch.
  Guarded Variable Automata over Infinite Alphabets, 2013, 29 pages p, arXiv admin note: text overlap with arXiv:1302.4205.
  http://hal.inria.fr/hal-00914779
• 60V. Cortier, D. Galindo, S. Glondu, M. Izabachène.
  A generic construction for voting correctness at minimum cost - Application to Helios, 2013, Cryptology ePrint Archive, Report 2013/177.
  http://hal.inria.fr/hal-00881079
• 61A. Dreyfus, P.-C. Heam, O. Kouchnarenko, C. Masson.
  A Random Testing Approach Using Pushdown Automata, December 2013, submitted (minor revision required).
  http://hal.inria.fr/hal-00912392

References in notes

• 62S. Kremer, V. Cortier (editors)
  Formal Models and Techniques for Analyzing Security Protocols, Cryptology and Information Security Series, IOS Press, 2011, vol. 5, 312 p.
  http://hal.inria.fr/inria-00636787/en
• 63A. Armando, W. Arsac, T. Avanesov, M. Barletta, A. Calvi, A. Cappai, R. Carbone, Y. Chevalier, L. Compagna, J. Cuellar, G. Erzse, S. Frau, M. Minea, S. Mödersheim, D. Von Oheimb, G. Pellegrino, S. Elisa Ponta, M. Rocchetto, M. Rusinowitch, M. Torabi Dashti, M. Turuani, L. Vigano.
  The AVANTSSAR Platform for the Automated Validation of Trust and Security of Service-Oriented Architectures, in: Tools and Algorithms for the Construction and Analysis of Systems - 18th International Conference, TACAS 2012, Tallinn, Estonie, C. Flanagan, B. Konig (editors), Lecture Notes in Computer Science, Springer, 2012, vol. 7214, pp. 267-282. [ DOI : 10.1007/978-3-642-28756-5_19 ]
  http://hal.inria.fr/hal-00759725
• 64A. 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, pp. 281-285.
• 65C. 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, pp. 21–32.
• 66T. Avanesov, Y. Chevalier, M. Rusinowitch, M. Turuani.
  Towards the Orchestration of Secured Services under Non-disclosure Policies., in: 6th International Conference on Mathematical Methods, Models and Architectures for Computer Network Security, MMM-ACNS 2012, St. Petersburg, Russie, Fédération De, I. V. Kotenko, V. A. Skormin (editors), Lecture Notes in Computer Science, Springer, October 2012, vol. 7531, pp. 130-145. [ DOI : 10.1007/978-3-642-33704-8_12 ]
  http://hal.inria.fr/hal-00755947
• 67G. Bana, H. Comon-Lundh.
  Towards Unconditional Soundness: Computationally Complete Symbolic Attacker, in: Proceedings of the 1st International Conference on Principles of Security and Trust (POST'12), Lecture Notes in Computer Science, Springer, 2012, vol. 7215, pp. 189-208.
• 68F. 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.
• 69E. 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, n^o 10, pp. 915–948.
• 70Y. Boichut, P.-C. Héam, O. Kouchnarenko.
  Vérifier automatiquement les protocoles de sécurité, in: Techniques de l'ingénieur, October 2007, pp. RE95-1–RE95-8.
• 71F. 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, pp. 778–795.
• 72F. 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, pp. 188–204.
• 73V. Cheval, H. Comon-Lundh, S. Delaune.
  Trace Equivalence Decision: Negative Tests and Non-determinism, in: Proceedings of the 18th ACM Conference on Computer and Communications Security (CCS'11), Chicago, Illinois, USA, Y. Chen, G. Danezis, V. Shmatikov (editors), ACM Press, October 2011, pp. 321-330. [ DOI : 10.1145/2046707.2046744 ]
  http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CCD-ccs11.pdf
• 74V. Cortier, S. Delaune, P. Lafourcade.
  A Survey of Algebraic Properties Used in Cryptographic Protocols, in: Journal of Computer Security, 2006, vol. 14, n^o 1, pp. 1–43.
• 75F. Dadeau, K. Cabrera Castillos, R. Tissot.
  Scenario-Based Testing using Symbolic Animation of B Models, in: Software Testing, Verification and Reliability, March 2012, vol. 6, n^o 22, pp. 407-434.
  http://hal.inria.fr/hal-00760020
• 76J. 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, pp. 268–284.
• 77S. Even, O. Goldreich.
  On the Security of Multi-Party Ping-Pong Protocols, in: IEEE Symposium on Foundations of Computer Science, 1983, pp. 34-39.
  http://citeseer.ist.psu.edu/46982.html
• 78M.-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, n^o 1, pp. 3-14.
• 79P.-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.
  http://hal.inria.fr/hal-00641750/en
• 80B. Legeard, F. Bouquet, N. Pickaert.
  Industrialiser le test fonctionnel, Management des systèmes d'information, Dunod, 2009, 266 p.
  http://hal.inria.fr/inria-00430538/en/
• 81G. Sénizergues.
  The Equivalence Problem for Deterministic Pushdown Automata is Decidable, in: 24th International Colloquium on Automata, Languages and Programming (ICALP'97), Lecture Notes in Computer Science, Springer, 1997, pp. 671-681.
• 82M. 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, pp. 277–286.