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]
M. 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.
[2]
A. 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.
[3]
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.
[4]
M. 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.
[5]
Y. Boichut, R. Courbis, P.-C. Heam, 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.
[6]
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.
[7]
Y. 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.
[8]
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.
[9]
A. 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.
[10]
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.

Publications of the year

Articles in International Peer-Reviewed Journal

[11]
T. Abbes, A. Bouhoula, M. Rusinowitch.
Efficient Decision Tree for Protocol Analysis in Intrusion Detection, in: International Journal of Security and Networks, 2010.
http://hal.inria.fr/inria-00528201
[12]
S. Anantharaman, H. Lin, C. Lynch, P. Narendran, M. Rusinowitch.
Unification modulo Homomorphic Encryption, in: Journal of Automated Reasoning, 2010, vol. (To appear).
http://hal.inria.fr/inria-00502850
[13]
Y. Chevalier, M. Rusinowitch.
Compiling and securing cryptographic protocols, in: Information Processing Letters, 2010, vol. 110, no 3, p. 116–122.
http://hal.inria.fr/inria-00527633
[14]
Y. Chevalier, M. Rusinowitch.
Decidability of Equivalence of Symbolic Derivations, in: Journal of Automated Reasoning, 2010.
http://hal.inria.fr/inria-00527630
[15]
Y. Chevalier, M. Rusinowitch.
Symbolic Protocol Analysis in the Union of Disjoint Intruder Theories: Combining Decision Procedures, in: Theoretical Computer Science, 2010, vol. 411, no 10, p. 1261-1282.
http://hal.inria.fr/inria-00455290
[16]
H. Comon-Lundh, V. Cortier, E. Zalinescu.
Deciding security properties for cryptographic protocols. Application to key cycles, in: ACM Transactions on Computational Logic, 2010, vol. 11, no 2.
http://hal.inria.fr/inria-00525775
[17]
V. Cortier, S. Delaune.
Decidability and combination results for two notions of knowledge in security protocols, in: Journal of Automated Reasoning, 2010.
http://hal.inria.fr/inria-00525778
[18]
V. Cortier, S. Kremer, B. Warinschi.
A Survey of Symbolic Methods in Computational Analysis of Cryptographic Systems, in: Journal of Automated Reasoning, 2010.
http://hal.inria.fr/inria-00525776
[19]
P. De Saqui-Sannes, T. Villemur, B. Fontan, S. Mota, M. S. Bouassida, N. Chridi, I. Chrisment, L. Vigneron.
Formal Verification of Secure Group Communications Using AVISPA and TURTLE, in: Innovations in Systems and Software Engineering, 2010, vol. 6, p. 125-133.
http://hal.inria.fr/hal-00447682
[20]
P.-C. Heam, O. Kouchnarenko, J. Voinot.
Component Simulation-based Substitutivity Managing QoS and Composition Issues, in: Science of Computer Programming, 2010, vol. 75, no 10, p. 898-917.
http://hal.inria.fr/inria-00511466
[21]
P.-C. Heam, C. Nicaud, S. Schmitz.
Parametric Random Generation of Deterministic Tree Automata, in: Theoretical Computer Science, 2010, vol. 411, p. 3469-3480.
http://hal.inria.fr/inria-00511450
[22]
J. Liu, L. Vigneron.
Design and Verification of a Non-Repudiation Protocol Based on Receiver-Side Smart Card, in: IET Information Security, March 2010, vol. 4, no 1, p. 15-29.
http://hal.inria.fr/inria-00426527/en/
[23]
P.-A. Masson, M.-L. Potet, J. Julliand, R. Tissot, F. Bouquet, B. Legeard, E. Jaffuel, B. Chetali, J. Andronick, A. Haddad.
An Access Control Model Based Testing Approach for Smart Card Applications: Results of the POSÉ Project, in: Journal of Information Assurance and Security, 2010, vol. 5, no 1, p. 335-351.
http://hal.inria.fr/inria-00533220
[24]
E. Nicolini, C. Ringeissen, M. Rusinowitch.
Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator, in: Fundamenta Informaticae, 2010, vol. 103.
http://hal.inria.fr/inria-00526683
[25]
D.-K. Tran, C. Ringeissen, S. Ranise, H. Kirchner.
Combination of Convex Theories: Modularity, Deduction Completeness, and Explanation, in: Journal of Symbolic Computation, Feb 2010, vol. 45, no 2, p. 261-286.
http://hal.inria.fr/inria-00428583

Articles in National Peer-Reviewed Journal

[26]
F. Fondement, P.-A. Muller, B. Wittmann, F. Ambert, F. Bouquet, J. Lasalle, E. Oudot, F. Peureux, B. Legeard, M. Alter, C. Scherrer.
VETESS : IDM, Test et SysML, in: Génie logiciel, 2010, no 93, p. 43–48.
http://hal.inria.fr/inria-00533277

International Peer-Reviewed Conference/Proceedings

[27]
Z. Ahmed, A. Imine, M. Rusinowitch.
Safe and Efficient Strategies for Updating Firewall Policies, in: 7th International Conference on Trust, Privacy & Security in Digital Business - TrustBus 2010, Espagne Bilbao, Springer, Aug 2010, vol. 6264, p. 45-57, The original publication is available at www.springerlink.com.
http://hal.inria.fr/inria-00529077
[28]
S. Anantharaman, H. Lin, C. Lynch, P. Narendran, M. Rusinowitch.
Cap Unification: Application to Protocol Security modulo Homomorphic Encryption, in: 5th ACM Symposium on Information, Computer and Communications Security - ASIACCS 2010, Chine Beijing, ACM, Apr 2010.
http://hal.inria.fr/inria-00448703
[29]
M. Arnaud, V. Cortier, S. Delaune.
Modeling and Verifying Ad Hoc Routing Protocols, in: 23rd IEEE Computer Security Foundations Symposium - CSF'10, Royaume-Uni Edinburgh, 2010.
http://hal.inria.fr/inria-00525779
[30]
T. Avanesov, Y. Chevalier, M. Rusinowitch, M. Turuani.
Satisfiability of General Intruder Constraints with a Set Constructor, in: The Fifth International Conference on Risks and Security of Internet and Systems - CRiSIS 2010, Canada Montreal, 2010.
http://hal.inria.fr/inria-00531025
[31]
P. Balbiani, F. Cheikh, P.-C. Heam, O. Kouchnarenko.
Composition of services with constraints, in: Formal Aspects of Component Software, Pays-Bas Eindhoven, Jan 2010, vol. 263, p. pp. 31-46, Rapport de recherche CWI, Amsterdam, NL, SEN-E0902, pp. 99-113.
http://hal.inria.fr/hal-00429876
[32]
H. Boucheneb, A. Imine, M. Najem.
Symbolic Model-Checking of Optimistic Replication Algorithms, in: 8th International Conference on Integrated Formal Methods - IFM 2010, France Nancy, Springer Berlin / Heidelberg, Oct 2010, vol. 6396, p. 89-104, The original publication is available at www.springerlink.com.
http://hal.inria.fr/inria-00524535
[33]
F. Bouquet, P.-C. Bué, J. Julliand, P.-A. Masson.
Test Generation Based on Abstraction and Test Purposes to Complement Structural Tests, in: A-MOST'10, 6th int. Workshop on Advances in Model Based Testing, in conjunction with ICST'10, France Paris, 2010, p. 54–61.
http://hal.inria.fr/inria-00533281
[34]
P.-C. Bué, F. Dadeau, A. De Kermadec, F. Bouquet.
Building a Test-ready Abstraction of a Behavioral Model using CLP, in: 4th International Conference on Tests and Proofs - TAP 2010, Espagne Malaga, Springer-Verlag, Jul 2010, vol. 6143, p. 167-182, The original publication is available at www.springerlink.com.
http://hal.inria.fr/inria-00532608
[35]
P.-C. Bué, F. Dadeau, P.-C. Héam.
Model-Based Testing using Symbolic Animation and Machine Learning, in: 2nd Workshop on Constraints in Software Testing, Verification, and Analysis - CSTVA'2010, France Paris, IEEE Press, Apr 2010.
http://hal.inria.fr/inria-00532977
[36]
O. Chebaro, N. Kosmatov, A. Giorgetti, J. Julliand.
Combining Static Analysis and Test Generation for C Program Debugging, in: 4th international conference Tests and proofs - TAP'10, Espagne Malaga, Springer-Verlag, 2010, vol. 6143, p. 94–100, The original publication is available at www.springerlink.com.
http://hal.inria.fr/inria-00527877
[37]
A. Cherif, A. Imine, M. Rusinowitch.
Optimistic Access Control for Collaborative Editing Systems, in: Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), Taichung, Taiwan, March 21-24 2011, to appear.
[38]
S. Ciobaca, V. Cortier.
Protocol composition for arbitrary primitives, in: 23rd IEEE Computer Security Foundations Symposium - CSF'10, Royaume-Uni Edinburgh, 2010, p. 322-336.
http://hal.inria.fr/inria-00525781
[39]
A. De Kermadec, F. Dadeau, F. Bouquet.
Assessing the Quality of B Models, in: SEFM'10 - 8th IEEE International Conference on Software Engineering and Formal Methods, Italie Pisa, Sep 2010.
http://hal.inria.fr/inria-00532974
[40]
A. Giorgetti.
Guessing a Conjecture in Enumerative Combinatorics and Proving It with a Computer Algebra System, in: International workshop on Symbolic Computation in Software Science - SCSS'10, Autriche Linz, 2010, p. 5–18.
http://hal.inria.fr/inria-00527883
[41]
A. Giorgetti, A. Hammad, B. Tatibouët.
Using SysML for Smart Surface Modeling, in: dMEMS'10, 1st workshop on design, control and software implementation for distributed MEMS, France Besançon, IEEE, 2010, p. 100–107.
http://hal.inria.fr/inria-00525791
[42]
A. Giorgetti, C. Marché, E. Tushkanova, O. Kouchnarenko.
Specifying Generic Java Programs: two case studies, in: 11th International Workshop on Language Descriptions, Tools, and Applications - LDTA'2010, Chypre Paphos, 2010, p. 92–106.
http://hal.inria.fr/inria-00525784
[43]
P.-C. Heam, V. Hugot, O. Kouchnarenko.
SAT Solvers for Queries over Tree Automata with Constraints, in: 2nd Workshop on Constraints in Software Testing, Verification and Analysis - CSTVA'10, joint to ICST'10, France Paris, 2010.
http://hal.inria.fr/inria-00523951
[44]
P.-C. Heam, O. Kouchnarenko, J. Voinot.
Component Simulation-based Substitutivity Managing QoS Aspects, in: Formal Aspects On Component Softwre - FACS'08, Espagne Malaga, Jan 2010, vol. 260 (2010), p. 109-123.
http://hal.inria.fr/inria-00329909
[45]
A. Imine.
On Coordinating Collaborative Objects, in: 9th International Workshop on the Foundations of Coordination Languages and Software Architectures (FOCLASA), France Paris, Open Publishing Association, Sep 2010, vol. 30, p. 78-92.
http://hal.inria.fr/inria-00529071
[46]
F. Jacquemard, M. Rusinowitch.
Rewrite-based verification of XML updates, in: 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming - PPDP'10, Autriche Hagenberg, ACM, Jul 2010, p. 119-130.
http://hal.inria.fr/inria-00529620
[47]
M. D. Mechaoui, A. Cherif, A. Imine, F. Bendella.
Log Garbage Collector-based Real Time Collaborative Editor for Mobile Devices, in: 6th International Conference on Collaborative Computing: Networking, Applications and Worksharing (CollaborateCom 2010), États-Unis Chicago, Oct 2010.
http://hal.inria.fr/inria-00529082

National Peer-Reviewed Conference/Proceedings

[48]
P.-C. Bué, J. Julliand, P.-A. Masson, F. Bouquet.
Associer des techniques de preuve et de résolution de contraintes pour la construction d'abstractions, in: 10èmes Journées Francophones Internationales sur les Approches Formelles dans l'Assistance au Développement de Logiciels - AFADL 2010, France Poitiers, Jun 2010, p. 11-25.
http://hal.inria.fr/inria-00533260
[49]
A. Caciula, R. Courbis, V. Felea, P.-C. Heam, R. Ionescu.
Une approche parallèle et distribuée pour la complétion d'automates d'arbre, in: 10èmes Journées Francophones Internationales sur les Approches Formelles dans l'Assistance au Développement de Logiciels - AFADL 2010, France Poitiers, Jun 2010, vol. 10, 43 p.
http://hal.inria.fr/hal-00530350
[50]
R. Courbis, P.-C. Heam, P. Jourdan, O. Kouchnarenko.
Approximations par réécriture pour deux problèmes indécidables, in: AFADL, France Poitiers, Jun 2010, vol. 10, 7 p.
http://hal.inria.fr/hal-00530341

Scientific Books (or Scientific Book chapters)

[51]
F. 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), CRC Press, 2010, To be published in 2011.
http://hal.inria.fr/inria-00532604

Internal Reports

[52]
T. Avanesov, Y. Chevalier, M. Rusinowitch, M. Turuani.
Satisfiability of General Intruder Constraints with and without a Set Constructor, INRIA, May 2010, RR-7276.
http://hal.inria.fr/inria-00480632
[53]
G. Cécé, A. Giorgetti.
Simulations for a Class of Two-Dimensional Automata, INRIA, Oct 2010, RR-7425.
http://hal.inria.fr/inria-00527077
[54]
P.-C. Heam, V. Hugot, O. Kouchnarenko.
Random Generation of Positive TAGEDs wrt. the Emptiness Problem, INRIA, Nov 2010, RR-7441.
http://hal.inria.fr/inria-00531350
[55]
E. Monfroy, O. Perrin, C. Ringeissen, L. Vigneron.
A Constraint-based Approach to Web Services Provisioning, INRIA, Oct 2010, RR-7413.
http://hal.inria.fr/inria-00524590

Other Publications

[56]
R. Courbis.
Rewriting Approximations For Properties Verication Over CCS Specifications, 2010.
http://hal.inria.fr/hal-00530351

References in notes

[57]
A. 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.
[58]
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.
[59]
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.
[60]
M. Baudet.
Sécurité des protocoles cryptographiques : aspects logiques et calculatoires, Laboratoire Spécification et Vérification, ENS Cachan, France, January 2007.
http://www.lsv.ens-cachan.fr/Publis/PAPERS/PDF/these-baudet.pdf
[61]
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.
[62]
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.
[63]
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.
[64]
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.
[65]
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.
[66]
Y. Chevalier, M. A. Mekki, M. Rusinowitch.
Automatic Composition of Services with Security Policies, in: Web Service Composition and Adaptation Workshop (held in conjunction with SCC/SERVICES-2008), Honolulu États-Unis, IEEE, 2008, p. 529-537. [ DOI : 10.1109/SERVICES-1.2008.13 ]
[67]
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.
[68]
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
[69]
J. 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.
[70]
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://www.wisdom.weizmann.ac.il/~oded/eg83.html
[71]
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/
[72]
P.-C. Heam, C. Nicaud.
Seed: an easy to use random generator of recursive data structures for testing, 2009.
http://hal.inria.fr/inria-00528585/PDF/rr-lsv-2009-15.pdf
[73]
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/
[74]
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/
[75]
N. Liu, Wen-ye. Zhu, Yue-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.
[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.

previous
next