Bibliography

Major publications by the team in recent years

[1]

A. 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, p. 140–164.

[2]

F. 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, p. 143–157.

[3]

Y. 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, p. 141–166.

[4]

H. Comon-Lundh, V. Cortier.
Security properties: two agents are sufficient, in: Science of Computer Programming, March 2004, vol. 50, n^o 1-3, p. 51–71
http://www.loria.fr/~cortier/Papiers/ComonCortierSCP03.ps.

[5]

F. Jacquemard, M. Rusinowitch, L. Vigneron.
Compiling and Verifying Security Protocols, in: Logic for Programming and Automated Reasoning (LPAR'00), Reunion Island, France, A. Voronkov, M. Parigot (editors), Lecture Notes in Computer Science, Springer, 2000, vol. 1955, p. 131–160.

[6]

B. Legeard, F. Peureux.
B-Testing-Tools : génération de tests aux limites à partir de spécifications B, in: TSI, Techniques et Sciences Informatiques, Hermès-Lavoisier, 2002, vol. 21, n^o 9, p. 1189–1218.

[7]

B. Legeard, F. Peureux, M. Utting.
Automated Boundary Testing from Z and B, in: Formal Methods Europe (FME 2002), L.-H. Eriksson, P. Lindsay (editors), Lecture Notes in Computer Science, Springer, 2002, vol. 2391, p. 21–40.

[8]

M. Rusinowitch, M. Turuani.
Protocol Insecurity with Finite Number of Sessions and Composed Keys is NP-complete, in: Theoretical Computer Science, April 2003, vol. 299, p. 451–475
http://www.loria.fr/~rusi/pub/tcsprotocol.ps.gz.

[9]

C. Tinelli, C. Ringeissen.
Unions of Non-Disjoint Theories and Combinations of Satisfiability Procedures, in: Theoretical Computer Science, 2003, vol. 290, n^o 1, p. 291–353.

Publications of the year

Doctoral Dissertations and Habilitation Theses

[10]

N. Chridi.
Contributions à la vérification automatique de protocoles de groupes, Université Henri Poincaré - Nancy 1, 09 2009
http://tel.archives-ouvertes.fr/tel-00417290/en/, Ph. D. Thesis.

[11]

V. Cortier.
Analyse des protocoles cryptographiques: des modèles symboliques aux modèles calculatoires, Institut National Polytechnique de Lorraine, 11 2009, Habilitation à Diriger des Recherches.

[12]

P.-C. Heam.
Automates finis pour la fiabilité logicielle et l'analyse d'accessibilité, Université de Franche-Comté, 11 2009
http://tel.archives-ouvertes.fr/tel-00432301/en/, Habilitation à Diriger des Recherches.

[13]

C. Ringeissen.
Raisonnement équationnel et méthodes de combinaison: de la programmation à la preuve, Université Henri Poincaré - Nancy 1, 11 2009, Habilitation à Diriger des Recherches.

Articles in International Peer-Reviewed Journal

[14]

H. Abdelnur, T. Avanesov, M. Rusinowitch, R. State.
Abusing SIP authentication, in: Journal of Information Assurance and Security, 2009, vol. 4, n^o 4, p. 311-318
http://hal.inria.fr/inria-00405356/en/.

[15]

M. 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, p. 496-520.

[16]

Y. Boichut, R. Courbis, P.-C. Heam, O. Kouchnarenko.
Handling Left-Quadratic Rules when Completing Tree Automata, in: International Journal of Foundations of Computer Science, 2009, vol. 20, n^o 5, p. 837-849
http://hal.inria.fr/inria-00427030/en/.

[17]

V. Cortier, S. Delaune.
Safely composing security protocols, in: Formal Methods in System Design, 2009, vol. 34, n^o 1, p. 1–36
http://hal.inria.fr/inria-00332354/en/.

[18]

F. Dadeau, P.-C. Héam, J. Levrey.
On the Use of Uniform Random Generation of Automata for Testing, in: Electronic Notes in Theoretical Computer Science, 2009, vol. 253, n^o 2
http://hal.inria.fr/inria-00429236/en/.

[19]

F. Dadeau, R. Tissot.
jSynoPSys - A Scenario-Based Testing Tool based on the Symbolic Animation of B Machines, in: Electronic Notes in Theoretical Computer Science, 2009, vol. 253, n^o 2
http://hal.inria.fr/inria-00429234/en/.

[20]

L. Jing, L. Vigneron.
Design and Verification of a Non-repudiation Protocol Based on Receiver-Side Smart Card, in: IET Information Security, 2009
http://hal.inria.fr/inria-00426527/en/.

[21]

V. Pretre, A. De Kermadec, F. Bouquet, C. Lang, F. Dadeau.
Automated UML models merging for web services testing, in: International Journal of Web and Grid Services, 2009, vol. 5, n^o 2
http://hal.inria.fr/inria-00429242/en/.

Articles in National Peer-Reviewed Journal

[22]

F. Dadeau, A. Haddad, T. Moutet.
Test fonctionnel de conformité vis-à-vis d'une politique de contôle d'accès, in: Technique et Science Informatiques, 4 2009, vol. 28/4
http://hal.inria.fr/inria-00429230/en/.

International Peer-Reviewed Conference/Proceedings

[23]

S. Anantharaman, C. Lynch, P. Narendran, M. Rusinowitch.
Unification Modulo Homomorphic Encryption, in: Frontiers of Combining Systems, 7th International Symposium, FroCoS 2009, Trento, Italy, S. Ghilardi, R. Sebastiani (editors), Lecture Notes in Computer Science, Springer, 2009, vol. 5749, p. 100-116
http://hal.inria.fr/inria-00426798/en/.

[24]

M. Arnaud, V. Cortier, S. Delaune.
Modeling and Verifying Ad Hoc Routing Protocol, in: Preliminary Proceedings of the 4th International Workshop on Security and Rewriting Techniques (SecReT'09), Port Jefferson, NY, USA, H. Comon-Lundh, C. Meadows (editors), July 2009, p. 33-46
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/ACD-secret09.pdf.

[25]

P. Balbiani, Y. Chevalier, M. El-Houri.
A Logical Framework for Reasoning about Policies with Trust Negotiations and Workflows in a Distributed Environment, in: Proceedings of the 4th International Conference on Risks and Security of Internet and Systems, Toulouse, France, IEEE, 2009, p. 3-11
http://hal.inria.fr/inria-00432528/en/.

[26]

M. Baudet, V. Cortier, S. Delaune.
YAPA: A generic tool for computing intruder knowledge, in: 20th International Conference on Rewriting Techniques and Applications (RTA'09), Brasília, Brazil, Lecture Notes in Computer Science, Springer, June 2009, vol. 5595, p. 148-163.

[27]

Y. Boichut, P.-C. Heam, O. Kouchnarenko.
How to Tackle Integer Weighted Automata Positivity, in: 3rd International Workshop on Reachability Problems, RP 2009, Palaiseau, France, O. Bournez, I. Potapov (editors), Lecture Notes in Computer Science, 2009, vol. 5797, p. 79-92
http://hal.inria.fr/inria-00428998/en/.

[28]

H. Boucheneb, A. Imine.
On Model-Checking Optimistic Replication Algorithms, in: 29th IFIP WG 6.1 International Conference, FMOODS/FORTE 2009, Lisbon, Portugal, 2009, p. 73-89
http://hal.inria.fr/inria-00431335/en/.

[29]

A. Cherif, A. Imine.
Undo-Based Access Control for Distributed Collaborative Editors, in: Cooperative Design, Visualization, and Engineering, 6th International Conference, CDVE 2009, Luxembourg, Luxembourg, 2009
http://hal.inria.fr/inria-00431344/en/.

[30]

N. Chridi, M. Turuani, M. Rusinowitch.
Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists, in: Proceedings of the 22nd IEEE Computer Security Foundations Symposium (CSF'09), Port Jefferson, NY, USA, IEEE, 2009, p. 277-289
http://hal.inria.fr/inria-00426919/en/.

[31]

V. Cortier.
Verification of Security Protocols (invited tutorial), in: 10th Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI'09), Savanah, USA, Lecture Notes in Computer Science, Springer, January 2009, vol. 5403, p. 5-13.

[32]

V. Cortier, S. Delaune.
A method for proving observational equivalence, in: Proceedings of the 22nd IEEE Computer Security Foundations Symposium (CSF'09), Port Jefferson, NY, USA, IEEE Computer Society Press, July 2009, p. 266-276.

[33]

V. Cortier, G. Steel.
A Generic Security API for Symmetric Key Management on Cryptographic Devices, in: Proceedings of the 14th European Symposium On Research In Computer Security (ESORICS'09), St Malo, France, Lecture Notes in Coputer Science, Springer, September 2009, vol. 5789, p. 605-620.

[34]

J.-F. Couchot, A. Giorgetti, N. Stouls.
Graph Based Reduction of Program Verification Conditions, in: Automated Formal Methods (AFM'09), colocated with CAV'09, Grenoble, France, H. Saïdi, N. Shankar (editors), ACM Press, 2009, p. 40–47
http://hal.inria.fr/inria-00402204/en/, PFC (Plate-Forme de Confiance) - Pôle de compétitivité System@tic.

[35]

R. Courbis, P.-C. Héam, O. Kouchnarenko.
TAGED Approximations for Temporal Properties Model-Checking, in: 14th International Conference on Implementation and Application of Automata, CIAA 2009, Sydney, Australia, S. Maneth (editor), Lecture Notes in Computer Science, Springer, July 2009, vol. 5642, p. 135-144
http://hal.inria.fr/inria-00380048/en/.

[36]

E. Gioan, S. Burckel, E. Thomé.
Mapping Computation with No Memory, in: 8th International Conference on Unconventional Computation - UC09, Ponta Delgada, Portugal, Springer, 2009, 15 p
http://hal-lirmm.ccsd.cnrs.fr/lirmm-00395080/en/.

[37]

P.-C. Heam, 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/.

[38]

P.-C. Héam, C. Nicaud, S. Schmitz.
Random Generation of Deterministic Tree (Walking) Automata, in: 14th International Conference on Implementation and Application of Automata - CIAA 2009 Implementation and Application of Automata, Sydney, Australia, S. Maneth (editor), Springer-Verlag, 2009, vol. 5642, p. 115–124
http://hal.inria.fr/inria-00408316/en/.

[39]

A. Imine, A. Cherif, M. Rusinowitch.
A Flexible Access Control Model for Distributed Collaborative Editors, in: Secure Data Management, 6th VLDB Workshop, SDM 2009, Lyon, France, 2009
http://hal.inria.fr/inria-00431341/en/.

[40]

F. Klay, L. Vigneron.
Automatic Methods for Analyzing Non-repudiation Protocols with an Active Intruder, in: Formal Aspects in Security and Trust, 5th International Workshop, FAST 2008, Malaga, Spain, October 9-10, 2008, Revised Selected Papers, P. Degano, J. D. Guttman, F. Martinelli (editors), Lecture Notes in Computer Science, Springer, 2009, vol. 5491, p. 192-209
http://hal.inria.fr/inria-00376450/en/.

[41]

O. Kouchnarenko, N. Sidorova, N. Trcka.
Petri Nets with May/Must Semantics, in: Concurrency, Specification, and Programming, Kraków-Przegorzały, Poland, Humboldt University, 2009, vol. 1, p. 291-302
http://hal.inria.fr/inria-00426835/en/.

[42]

E. 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.

[43]

E. Nicolini, C. Ringeissen, M. Rusinowitch.
Data Structures with Arithmetic Constraints: a Non-Disjoint Combination, in: Frontiers of Combining Systems, 7th International Symposium, FroCoS 2009, Proceedings, Trento, Italy, S. Ghilardi, R. Sebastiani (editors), Lecture Notes in Artificial Intelligence, Springer, 2009, vol. 5749, p. 335–350.

[44]

E. Nicolini, C. Ringeissen, M. Rusinowitch.
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets, in: Proc. of 15th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, TACAS 2009, York, UK, S. Kowalewski, A. Philippou (editors), Lecture Notes in Computer Science, Springer, 2009, vol. 5505, p. 428–442.

[45]

P. Saqui-Sannes, T. Villemur, B. Fontan, S. Mota, M. S. Bouassida, N. Chridi, I. Chrisment, L. Vigneron.
UML Modeling and Formal Verification of Secure Group Communication Protocols, in: Second IEEE international workshop UML and Formal Methods, Rio de Janeiro, Brazil, 2009
http://hal.inria.fr/inria-00429747/en/, 6 pages.

National Peer-Reviewed Conference/Proceedings

[46]

S. Debricon, F. Bouquet, B. Legeard.
From Business Processes to Integration Testing, in: Actes des 5èmes journées sur l'Ingénierie Dirigée par les Modèles, Nancy, O. Zendra (editor), LORIA, 2009, vol. 1
http://hal.inria.fr/inria-00430539/en/.

Workshops without Proceedings

[47]

P. Balbiani, F. Cheikh, P.-C. Heam, O. Kouchnarenko.
Composition of services with constraints, in: Formal Aspects of Component Software, Eindhoven, The Netherlands, 2009
http://hal.archives-ouvertes.fr/hal-00429876/en/.

Scientific Books (or Scientific Book chapters)

[48]

C. 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.

[49]

B. Legeard, F. Bouquet, P. Natacha.
Industrialiser le test fonctionnel, Management des systèmes d'information, Dunod, 2009
http://hal.inria.fr/inria-00430538/en/.

Books or Proceedings Editing

[50]

V. Cortier, C. Kirchner, M. Okada, H. Sakurada (editors)
Formal to practical Security, Lecture Notes in Computer Science, Springer, Springer, 2009, vol. 5458.

Internal Reports

[51]

M. Ahmad, S. Burckel.
Sequential decomposition of operations and compilers optimization, 2009
http://hal.inria.fr/inria-00428722/en/, Research Report.

[52]

Z. Ahmed, A. Imine, M. Rusinowitch.
Safe and Efficient Strategies for Updating Firewall Policies, 2009
http://hal.inria.fr/inria-00381778/en/, RR-6940.

[53]

M. Berrima, N. Ben Rajeb, V. Cortier.
Deciding knowledge in security protocols under some e-voting theories, 2009
http://hal.inria.fr/inria-00375784/en/, RR-6903.

[54]

Y. Chevalier, M. Rusinowitch.
Compiling and securing cryptographic protocols, 2009
http://hal.inria.fr/inria-00426669/en/, Research Report.

[55]

V. Cortier, S. Kremer, B. Warinschi.
A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems, 2009
http://hal.inria.fr/inria-00379776/en/, RR-6912.

[56]

V. Cortier, G. Steel.
Synthesising Secure APIs, 2009
http://hal.inria.fr/inria-00369395/en/, RR-6882.

[57]

A. Imine, A. Cherif, M. Rusinowitch.
An Optimistic Mandatory Access Control Model for Distributed Collaborative Editors, 2009
http://hal.inria.fr/inria-00381941/en/, RR-6939.

[58]

F. Jacquemard, M. Rusinowitch.
Rewrite based Verification of XML Updates, 2009
http://hal.inria.fr/inria-00408162/en/, RR-7007.

[59]

E. Nicolini, C. Ringeissen, M. Rusinowitch.
Combinable Extensions of Abelian Groups, 2009
http://hal.inria.fr/inria-00383041/en/, RR-6920.

[60]

E. Nicolini, C. Ringeissen, M. Rusinowitch.
Data Structures with Arithmetic Constraints: a Non-Disjoint Combination, 2009
http://hal.inria.fr/inria-00397080/en/, RR-6963.

Other Publications

[61]

E. Tushkanova, A. Giorgetti, O. Kouchnarenko.
Specifying and Proving a Sorting Algorithm, 2009
http://hal.archives-ouvertes.fr/hal-00429040/en/.

References in notes

[62]

F. Baader, K. U. Schulz.
Unification in the Union of Disjoint Equational Theories: Combining Decision Procedures, in: Journal of Symbolic Computation, February 1996, vol. 21, n^o 2, p. 211–243.

[63]

F. 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.

[64]

E. 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, p. 915–948.

[65]

Y. Boichut, R. Courbis, P.-C. Heam, O. Kouchnarenko.
Handling Left-Quadratic Rules when Completing Tree Automata, in: 2nd Workshop on Reachability Problems - RP'08, Electronic Notes in Theoretical Computer Science, Liverpool, UK, V. Halava, I. Potapov (editors), Elsevier Science Publishers, 2008
http://hal.inria.fr/inria-00329900/en/.

[66]

Y. 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.

[67]

Y. Boichut, P.-C. Heam, O. Kouchnarenko.
Approximation based tree regular model checking, in: Nordic Journal of Computing, 2008, vol. 14, p. 216-241
http://hal.inria.fr/inria-00429345/en/.

[68]

F. 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.

[69]

F. 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.

[70]

Y. Chevalier, D. Lugiez, M. Rusinowitch.
Towards an Automatic Analysis of Web Service Security, in: Proceedings of the 6th International Symposium on Frontiers of Combining Systems (FroCoS'07), Liverpool, UK, F. Wolter (editor), Lecture Notes in Artificial Intelligence, Springer, September 2007, vol. 4720, p. 133-147.

[71]

V. 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, p. 1–43
http://www.loria.fr/~cortier/Papiers/survey.ps.

[72]

S. 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.

[73]

G. Feuillade, T. Genet, V. V. T. Tong.
Reachability Analysis over Term Rewriting Systems, in: J. Autom. Reasoning, 2004, vol. 33, n^o 3-4, p. 341-383.

[74]

D. Krob.
The Equality Problem for Rational Series with Multiplicities in the Tropical Semiring is Undecidable, in: Internatioanl Journal of Algebra and Computation, 1994, vol. 4, n^o 3.

[75]

G. T. Leavens, A. L. Baker, C. Ruby.
JML: a Java Modeling Language, in: Formal Underpinnings of Java Workshop (at OOPSLA '98), October 1998.

[76]

M. 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.