Team Cassis

Members
Overall Objectives
Scientific Foundations
Application Domains
Software
New Results
Contracts and Grants with Industry
Other Grants and Activities
Dissemination
Bibliography

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, no 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, no 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, no 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, no 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, no 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, no 1, p. 291–353.

Publications of the year

Doctoral dissertations and Habilitation theses

[10]
H. Hoerdegen.
Vérification des protocoles cryptographiques : Comparaison des modèles symboliques avec une application des résultats — Étude des protocoles récursifs, Thèse de Doctorat, Université Henri Poincaré, Nancy, France, Novembre 2007.
[11]
D.-K. Tran.
Conception de procédures de décision par combinaison et saturation, Thèse de Doctorat, Université Henri Poincaré, Nancy, France, Février 2007
http://www.loria.fr/~tran/Thesis/PhD-Tran.pdf.
[12]
E. Zalinescu.
Sécurité des protocoles cryptographiques: décidabilité et résultats de transfert, Thèse de Doctorat, Université Henri Poincaré, Nancy, France, Décembre 2007.

Articles in refereed journals and book chapters

[13]
Y. Boichut, P.-C. Héam, O. Kouchnarenko.
Vérifier automatiquement les protocoles de sécurité, in: Techniques de l'ingénieur, October 2007.
[14]
M. S. Bouassida, N. Chridi, I. Chrisment, O. Festor, L. Vigneron.
Automated Verification of a Key Management Architecture for Hierarchical Group Protocols, in: Annals of Telecommunications, November-December 2007, vol. 62, no 11-12, p. 1365-1387.
[15]
G. Cécé, P.-C. Héam, Y. Mainier.
Efficiency of Automata in Semi-Commutation Verification Techniques, in: Theoretical Informatics and Applications, Also available as Research Report 5001, INRIA, France, 2007.
[16]
N. Chridi, L. Vigneron.
24, in: Strategy for Flaws Detection based on a Services-driven Model for Group Protocols, Future and Trends in Constraint Programming, ISTE, April 2007, p. 361-370.
[17]
V. Cortier, M. Rusinowitch, E. Zalinescu.
Relating two Standard Notions of Secrecy, in: Logical Methods in Computer Science, July 2007, vol. 3, no 3
http://www.lmcs-online.org/ojs/viewarticle.php?id=273&layout=abstract.
[18]
S. Ghilardi, E. Nicolini, S. Ranise, D. Zucchelli.
Decision Procedures for Extensions of the Theory of Arrays, in: Annals of Mathematics and Artificial Intelligence, 2007, vol. 50, no 3-4, p. 231-254.

Publications in Conferences and Workshops

[19]
T. Abbes, A. Bouhoula, M. Rusinowitch.
A Traffic Classification Algorithm for Intrusion Detection, in: Symposium on Frontiers in Networking with Applications (FINA-07), Workshops Proceedings, Niagara Falls, Canada, IEEE Computer Society, May 2007, vol. 1, p. 188-193.
[20]
S. Anantharaman, P. Narendran, M. Rusinowitch.
Intruders with Caps, F. Baader (editor), Lecture Notes in Computer Science, Springer , Paris, France, June 2007, vol. 4533, p. 20-35
http://www.loria.fr/~rusi/pub/rta07.pdf.
[21]
M. Arnaud, V. Cortier, S. Delaune.
Combining algorithms for deciding knowledge in security protocols, 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. 103-117
http://www.loria.fr/~cortier/Papiers/FROCOS07.pdf.
[22]
Y. Boichut, P.-C. Héam, O. Kouchnarenko.
Tree Automata for Detecting Attacks on Protocols with Algebraic Cryptographic Primitives, in: INFINITY'07, Int. Ws. on Verification of Infinite-State Systems, joint to CONCUR'07, Lisboa, Portugal, The final version will be published in EN in Theoretical Computer Science, Elsevier, September 2007, p. 44-53.
[23]
F. Bouquet, J.-F. Couchot, F. Dadeau, A. Giorgetti.
Instantiation of Parameterized Data Structures for Model-Based Testing, in: B'2007, the 7th Int. B Conference, Besancon, France, Lecture Notes in Computer Science, Springer, January 2007, vol. 4355, p. 96–110.
[24]
F. Bouquet, F. Dadeau, J. Groslambert.
JML2B: Checking JML specifications with B machines, in: 7th Int. B Conference - Tool Session, Besancon, France, Lecture Notes in Computer Science, Springer, January 2007, vol. 4355, p. 285–288.
[25]
F. Bouquet, C. Grandpierre, B. Legeard, F. Peureux, N. Vacelet, M. Utting.
A subset of precise UML for model-based testing, in: A-MOST'07: Proceedings of the 3rd international workshop on Advances in Model-based Testing, London, United Kingdom, ACM Press, July 2007, p. 95-104.
[26]
S. Bursuc, H. Comon-Lundh, S. Delaune.
Deducibility Constraints, Equational Theory and Electronic Money, in: Rewriting, Computation and Proof — Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of his 60th Birthday, Cachan, France, H. Comon-Lundh, C. Kirchner, H. Kirchner (editors), Lecture Notes in Computer Science, Springer, June 2007, vol. 4600, p. 196-212
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PS/BCD-jpj07.ps.
[27]
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
http://www.loria.fr/~rusi/pub/frocos07.pdf.
[28]
Y. Chevalier, D. Lugiez, M. Rusinowitch.
Verifying Cryptographic Protocols with Subterms Constraints, in: Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, Proceedings, Erevan, Armenie, N. Dershowitz, A. Voronkov (editors), Lecture Notes in Artificial Intelligence, Springer, October 2007, vol. 4790, p. 181-195
http://www.loria.fr/~rusi/pub/lpar07.pdf.
[29]
V. Cortier, W. Bogdan, E. Zalinescu.
Synthetizing Secure Protocols, in: Proceedings of the 12th European Symposium On Research In Computer Security (ESORICS'07), Dresden, Germany, Springer, September 2007, vol. 4734, p. 406-421
http://www.loria.fr/~cortier/Papiers/compiler.pdf.
[30]
V. Cortier, S. Delaune.
Deciding Knowledge in Security Protocols for Monoidal Equational Theories, in: Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, Proceedings, Yerevan, Armenia, Lecture Notes in Artificial Intelligence, Springer, October 2007, vol. 4790, p. 196-210
http://www.loria.fr/~cortier/Papiers/LPAR07.pdf.
[31]
V. Cortier, S. Delaune.
Deciding Knowledge in Security Protocols for Monoidal Equational Theories, in: Proceedings of the Joint Workshop on Foundations of Computer Security and Automated Reasoning for Security Protocol Analysis (FCS-ARSPA'07), Wrocław, Poland, P. Degano, R. Küsters, L. Viganò, S. Zdancewic (editors), July 2007, p. 63-80
http://www.loria.fr/~cortier/Papiers/FCS-ARSPA07.pdf.
[32]
V. Cortier, J. Delaitre, S. Delaune.
Safely Composing Security Protocols, in: Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), New Delhi, India, V. Arvind, S. Prasad (editors), Lecture Notes in Computer Science, Springer, December 2007, vol. 4855, p. 352-363
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/CDD-fsttcs07.pdf.
[33]
V. Cortier, S. Delaune, G. Steel.
A Formal Theory of Key Conjuring, in: Proceedings of the 20th IEEE Computer Security Foundations Symposium (CSF'07), Venice, Italy, IEEE Computer Society Press, July 2007, p. 79-93
http://www.loria.fr/~cortier/Papiers/CSF07.pdf.
[34]
V. Cortier, G. Keighren, G. Steel.
Automatic Analysis of the Security of XOR-based Key Management Schemes, in: 13th International Conference on Tools and Algorithms for the Construction and Analysis of Systems (TACAS'07), Braga, Portugal, Lecture Notes in Computer Science, Springer, March 2007, vol. 4424, p. 538-552
http://www.loria.fr/~cortier/Papiers/TACAS07.pdf.
[35]
V. Cortier, R. Küsters, B. Warinschi.
A Cryptographic Model for Branching Time Security Properties – the Case of Contract Signing Protocols, in: 3rd Workshop on Formal and Computational Cryptography (FCC 2007), Venice, Italy, July 2007.
[36]
V. Cortier, R. Küsters, B. Warinschi.
A Cryptographic Model for Branching Time Security Properties – the Case of Contract Signing Protocols, in: Proceedings of the 12th European Symposium On Research In Computer Security (ESORICS'07), Dresden, Germany, Springer, September 2007, vol. 4734, p. 422-437
http://www.loria.fr/~Ecortier/Papiers/CortierKuestersWarinschi-ESORICS-2007.pdf.
[37]
V. Cortier, E. Zalinescu.
Deciding key cycles for security protocols, in: 3rd Workshop on Formal and Computational Cryptography (FCC 2007), Venice, Italy, July 2007.
[38]
S. Delaune, S. Kremer, M. D. Ryan.
Symbolic Bisimulation for the Applied Pi Calculus, in: Proceedings of the 5th International Workshop on Security Issues in Concurrency (SecCo'07), Lisbon, Portugal, D. Goria, C. Palamidessi (editors), Electronic Notes in Theoretical Computer Science, Elsevier Science Publishers, September 2007
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-secco07.pdf.
[39]
S. Delaune, S. Kremer, M. D. Ryan.
Symbolic Bisimulation for the Applied Pi-Calculus, in: Proceedings of the 27th Conference on Foundations of Software Technology and Theoretical Computer Science (FSTTCS'07), New Delhi, India, V. Arvind, S. Prasad (editors), Lecture Notes in Computer Science, Springer, December 2007, no 4855/2007
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/DKR-fsttcs07.pdf.
[40]
S. Delaune, H. Lin, Ch. Lynch.
Protocol Verification via Rigid/Flexible Resolution, in: Logic for Programming, Artificial Intelligence, and Reasoning, 14th International Conference, LPAR 2007, Yerevan, Armenia, Proceedings, Yerevan, Armenia, N. Dershowitz, A. Voronkov (editors), Lecture Notes in Artificial Intelligence, Springer, October 2007, vol. 4790, p. 242-256.
[41]
S. Delaune, H. Lin, Ch. Lynch.
Protocol verification via rigid/flexible resolution, in: Proceedings of the Workshop on Automated Deduction: Decidability, Complexity, Tractability (ADDCT'07), Bremen, Germany, S. Ghilardi, U. Sattler, V. Sofronie-Stokkermans, A. Tiwari (editors), LNCS, July 2007, no 4790/2007.
[42]
E. Descourvières, S. Debricon, D. Gendreau, P. Lutz, L. Philippe, F. Bouquet.
Towards automatic control for microfactories, in: 5th Int. Conf. on Industrial Automation, Montréal, Québec, Canada, ETS , June 2007.
[43]
S. Ghilardi, E. Nicolini, S. Ranise, D. Zucchelli.
Combination Methods for Satisfiability and Model-Checking of Infinite-State Systems, in: Proceedings of the 21st Conference on Automated Deduction (CADE 2007), Bremen (Germany), F. Pfenning (editor), Lecture Notes in Computer Science, Springer, 2007, vol. 4603, p. 362-378.
[44]
S. Ghilardi, E. Nicolini, S. Ranise, D. Zucchelli.
Noetherianity and Combination Problems, in: Proceedings of the 6th International Workshop on Frontiers of Combining Systems (FroCoS 2007), Liverpool (UK), B. Konev, F. Wolter (editors), Lecture Notes in Computer Science, Springer, 2007, vol. 4720, p. 206-220.
[45]
A. Giorgetti, J. Groslambert.
Un programme annoté en vaut deux, in: Journées francophones des langages applicatifs (JFLA'07), Aix-les-Bains, France, P.-E. Moreau (editor), INRIA, January 2007, p. 87-101.
[46]
N. Guermouche, O. Perrin, C. Ringeissen.
Timed Specification For Web Services Compatibility Analysis, in: Proc. of 3rd International Workshop on Automated Specification and Verification of Web Systems, WWV, December 2007.
[47]
P.-C. Heam, O. Kouchnarenko, J. Voinot.
How to Handle QoS Aspects in Web Services Substitutivity Verification, in: International Workshop on Information Systems & Web Services, as part of the 16th IEEE International Workshops on Enabling Technologies: Infrastructures for Collaborative Enterprises (WETICE 2007), Paris, France, June 2007.
[48]
A. Imine, M. Rusinowitch.
Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms, in: Rewriting, Computation and Proof, Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday, Cachan, France, H. Comon-Lundh, C. Kirchner, H. Kirchner (editors), Lecture Notes in Computer Science, Springer, June 2007, vol. 4600, p. 196-212
http://http://www.loria.fr/~rusi/pub/jpj07.pdf.
[49]
R. Laleau, Y. Ledru, D. Bert, F. Bouquet, M. Lemoine, C. Dubois, S. Vignes, V. Viguié Donzeau-Gouge.
Using Computer Science Modeling Techniques for Airport Security Certification, in: RCIS'07, 1st Int. Conf. on Research Challenges in Information Science, Ouarzazate, Morocco, April 2007, p. 61-72.
[50]
C. Lynch, D.-K. Tran.
Automatic Decidability and Combinability Revisisted, in: Conference on Automated Deduction (CADE'07), Bremen, Germany, F. Pfenning (editor), Lecture Notes in Computer Science, July 2007, vol. 4603, p. 328-344.
[51]
V. Pretre, F. Bouquet, C. Lang.
A Model-Based Validation Framework for Web Services, in: ICSSEA'2007 - 5th International Workshop on System Testing and Validation (STV'2007), Paris, France, Fraunhofer book series, December 2007, p. 63-76.
[52]
S. Ranise, C. Ringeissen, D.-K. Tran.
Combining Proof Producing Decision Procedures, in: Frontier of Combining System (FroCos'07), Liverpool, UK, F. Wolter (editor), Lecture Notes in Computer Science, Springer, September 2007, vol. 4720, p. 237-251.
[53]
S. Ranise, C. Scharff.
Building Extended Canonizers by Graph-Based Deduction, in: 4th Int. Colloquium on Theoretical Aspects of Computing (ICTAC'07), Macao, SAR, China, Lecture Notes in Computer Science, Springer, September 2007, vol. 4711, p. 440-454.
[54]
J. Santiago, L. Vigneron.
Optimistic Non-repudiation Protocol Analysis, in: Proceedings of the Workshop in Information Security Theory and Practices (WISTP'2007), Smart Cards, Mobile and Ubiquitous Computing Systems, Heraklion (Greece), D. S. et al. (editor), Lecture Notes in Computer Science, Springer, May 2007, vol. 4462, p. 90-101
http://www.loria.fr/~vigneron/Work/papers/SantiagoV-WISTP07.pdf.

Internal Reports

[55]
M. Arnaud, V. Cortier, S. Delaune.
Combining algorithms for deciding knowledge in security protocols, 28 pages, INRIA, February 2007, no 6118.
[56]
V. Cortier, S. Delaune, G. Steel.
A Formal Theory of Key Conjuring, 38 pages, INRIA, February 2007, no 6134.
[57]
P.-C. Heam, O. Kouchnarenko, J. Voinot.
Towards Formalizing QoS of Web Services with Weighted Automata, 22 pages, INRIA, June 2007, no RR-6218
https://hal.inria.fr/inria-00154453.
[58]
P.-C. Héam.
Transitive Closures of Semi-commutation Relations on Regular omega-Languages, 20 pages, INRIA, June 2007, no RR-6239
https://hal.inria.fr/inria-00158285.
[59]
F. Klay, J. Santiago, L. Vigneron.
Automatic Methods for Analyzing Non-Repudiation Protocols with an Active Intruder, Research Report, INRIA, October 2007, no 6324
https://hal.inria.fr/inria-00179550/en/.

Miscellaneous

[60]
S. Burckel.
Complexity of some Path Problems in DAGs and Linear Orders, 2007, arXiv:0710.2268.
[61]
S. Burckel.
Reduce Problems From Braid Groups To Braid Monoids, 2007, arXiv:0709.3887.
[62]
R. Courbis.
Raffinement d'approximations pour la vérification de MIDlet, Mémoire de Master Recherche, LIFC, Université de Franche-Comté, 2007.
[63]
N. Guermouche, O. Perrin, C. Ringeissen.
A Mediator Based Approach For Services Composition, 2007, Research report.

References in notes

[64]
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, no 2, p. 211–243.
[65]
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.
[66]
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, no 10, p. 915–948.
[67]
Y. Boichut.
Approximations pour la vérification automatique de protocoles de sécurité, Thèse de Doctorat, LIFC, Université de Franche-Comté, Besançon (France), septembre 2006.
[68]
Y. Boichut, P.-C. Héam, O. Kouchnarenko.
Handling Algebraic Properties in Automatic Analysis of Security Protocols, in: 3rd International Colloquium on Theoretical Aspects of Computing, ICTAC, Tunis, Tunisia, Lecture Notes in Computer Science, November 2006, vol. 4281, p. 153–167.
[69]
Y. Boichut, N. Kosmatov, L. Vigneron.
Validation of Prouve Protocols using the Automatic Tool TA4SP, in: Proceedings of 3rd Taiwanese-French Conference on Information Technology (TFIT), Nancy, France, March 2006, p. 467-480.
[70]
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.
[71]
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.
[72]
G. Cécé, P.-C. Héam, Y. Mainier.
Clôtures transitives de semi-commutations et model-checking régulier, in: Congrès Approches Formelles dans l'Assistance au Développement de Logiciels, AFADL'04, Besançon, France, J. Julliand (editor), June 2004, p. 257–268.
[73]
G. Cécé, P.-C. Héam, Y. Mainier.
Efficiency of Automata in Semi-Commutation Verification Techniques, in: Theoretical Informatics and Applications, Also available as Research Report 5001, INRIA, France, 2004
http://hal.inria.fr/inria-00077039.
[74]
Y. Chevalier, M. Rusinowitch.
Combining Intruder Theories, in: Proc. of the Int. Coll. on Automata, Languages and Programming, ICALP, Lisbon, Portugal, Lecture Notes in Computer Science, Springer, 2005, vol. 3580, p. 639-651.
[75]
V. 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.
[76]
D. Déharbe, S. Ranise.
Light-Weight Theorem Proving for Debugging and Verifying Units of Code, in: Proc. of the International Conference on Software Engineering and Formal Methods (SEFM03), Brisbane, Australia, IEEE Computer Society Press, September 2003
http://www.loria.fr/~ranise/pubs/sefm03.ps.gz.
[77]
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.
[78]
G. T. Leavens, A. L. Baker, C. Ruby.
JML: a Java Modeling Language, in: Formal Underpinnings of Java Workshop (at OOPSLA '98), October 1998.
[79]
S. Ranise, C. Ringeissen, D.-K. Tran.
Nelson-Oppen, Shostak and the Extended Canonizer: A Family Picture with a Newborn, in: First International Colloquium on Theoretical Aspects of Computing - ICTAC 2004, Guiyang, Chine, Lecture Notes in Computer Science, Springer, September 2004, vol. 3407, p. 372-386.
[80]
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.

previous
next