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]
D. Zucchelli.
Combinaison de Méthodes de Vérification, Ph. D. Thesis, Université Henri Poincaré - Nancy I, 01 2008
http://tel.archives-ouvertes.fr/tel-00329849/en/.

Articles in International Peer-Reviewed Journal

[11]
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 p
http://hal.inria.fr/inria-00329740/en/.
[12]
Y. Chevalier, M. Rusinowitch.
Hierarchical combination of intruder theories, in: Information and Computation, 2008, vol. 206, p. 352-377
http://hal.inria.fr/inria-00329715/en/.
[13]
V. Cortier, S. Delaune.
Safely Composing Security Protocols, in: Formal Methods in System Design, 2008
http://hal.inria.fr/inria-00332354/en/.
[14]
A. Giorgetti, J. Groslambert, J. Julliand, O. Kouchnarenko.
Verification of class liveness properties with Java modeling language, in: IET (Institution of Engineering and Technology) Software, December 2008, vol. 2, no 6, p. 500-514
http://hal.inria.fr/inria-00332862/en/.
[15]
P.-C. Heam, Y. Boichut.
A Theorerical Limit for Safety Verification Techniques with Regular Fix-point Computations, in: Information Processing Letters, 2008, vol. 108, p. 1-2
http://hal.inria.fr/inria-00328487/en/.
[16]
P.-C. Heam, G. Cécé, Y. Mainier.
Efficiency of Automata in Semicommutations Verification Techniques, in: Theoretical Informatics and Applications, 2008, vol. 42, p. 197-215
http://hal.inria.fr/inria-00328514/en/.
[17]
P.-C. Heam.
A Note on Partially Ordered Tree Automata, in: Information Processing Letters, 2008, vol. 108, p. 242-246
http://hal.inria.fr/inria-00328495/en/.
[18]
F. Jacquemard, M. Rusinowitch, L. Vigneron.
Tree Automata with Equality Constraints Modulo Equational Theories, in: Journal of Logic and Algebraic Programming, April 2008, vol. 75, no 2, p. 182-208
http://hal.inria.fr/inria-00329693/en/.
[19]
E. Monfroy, O. Perrin, C. Ringeissen.
Modeling Web services Composition with Constraints, in: Selected Papers of the Third Colombian Conference on Computer Science, Special Issue of "Revista Avances en Sistemas e Informática", 2008, vol. 5, no 1.

Articles in National Peer-Reviewed Journal

[20]
G. Cécé, P.-C. Héam, Y. Mainier.
Clôtures transitives de semi-commutations et model-checking régulier, in: TSI, Technique et Science Informatiques, 2008, vol. 27, no 1-2, p. 7–28.

International Peer-Reviewed Conference/Proceedings

[21]
T. Abbes, A. Bouhoula, M. Rusinowitch.
An inference system for detecting firewall filtering rules anomalies, in: 23rd Annual ACM Symposium on Applied Computing - SAC'08, Fortaleza, Ceara, Brazil, R. L. Wainwright, H. Haddad (editors), ACM, 2008, p. 2122-2128
http://hal.inria.fr/inria-00329730/en/.
[22]
H. Abdelnur, T. Avanesov, M. Rusinowitch, R. State.
Abusing SIP Authentication, in: Information Assurance and Security (ISIAS), Naples, Italy, IEEE, 2008, p. 237-242
http://hal.inria.fr/inria-00326077/en/.
[23]
P. Balbiani, Y. Chevalier, M. El Houri.
A Logical Approach to Dynamic Role-Based Access Control, in: Artificial Intelligence: Methodology, Systems, and Applications, 13th International Conference, AIMSA 2008, Varna, Bulgaria, Lecture Notes in Computer Science, Springer, September 2008, vol. 5253, p. 194-208.
[24]
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
http://hal.inria.fr/inria-00327583/en/.
[25]
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/.
[26]
F. Bouquet, C. Grandpierre, B. Legeard, F. Peureux.
A test generation solution to automate software testing, in: AST'08, 3rd Int. workshop on Automation of Software Test, Leipzig, Germany, ACM Press, May 2008, p. 45-48
http://doi.acm.org/10.1145/1370042.1370052.
[27]
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, USA, IEEE, 2008, p. 529-537
http://hal.inria.fr/inria-00330338/en/.
[28]
H. Comon-Lundh, V. Cortier.
Computational soundness of observational equivalence, in: 15th ACM Conference on Computer and Communications Security - CCS'08, Alexandria, USA, ACM, 2008
http://hal.inria.fr/inria-00323195/en/.
[29]
F. Dadeau, A. De Kermadec, R. Tissot.
Combining Scenario- and Model-Based Testing to ensure POSIX Compliance, in: First International Conference on Abstract State Machines, B and Z - ABZ'08, London, UK, E. Börger, M. Butler, J. P. Bowen, P. Boca (editors), Lecture Notes in Computer Science, Springer, 2008, vol. 5238, p. 153-166
http://hal.inria.fr/inria-00329965/en/.
[30]
F. Dadeau, J. Lamboley, T. Moutet, M.-L. Potet.
A Verifiable Conformance Relationship between Smart Card Applets and B security Models, in: First International Conference on Abstract State Machines, B and Z - ABZ'08, London, UK, E. Börger, M. Butler, J. P. Bowen, P. Boca (editors), Lecture Notes in Computer Science, Springer, 2008, vol. 5238, p. 237-250
http://hal.inria.fr/inria-00329966/en/.
[31]
F. Dadeau, R. Tissot, M.-L. Potet.
A B Formal Framework for Security Developments in the Domain of Smart Card Applications, in: 23rd International Information Security Conference - SEC'08 IFIP, Milano, Italy, Springer, 2008, vol. 278, p. 141-155
http://hal.inria.fr/inria-00329973/en/.
[32]
S. Ghilardi, E. Nicolini, S. Ranise, D. Zucchelli.
Towards SMT Model Checking of Array-based Systems, in: Proceedings of the 4th International Joint Conference on Automated Reasoning, IJCAR, Sydney (Australia), A. Armando, P. Baumgartner, G. Dowek (editors), Lecture Notes in Computer Science, Springer, 2008, vol. 5195, p. 67-82.
[33]
E. Gioan, S. Burckel.
In Situ Design of Register Operations, in: ISVLSI'08: IEEE Computer Society Annual Symposium on Very-Large-Scale Integration, Montpellier, France, IEEE Computer Society, 04 2008, vol. Trends in VLSI Technology and Design, 4 p
http://hal-lirmm.ccsd.cnrs.fr/lirmm-00287659/en/.
[34]
N. Guermouche, O. Perrin, C. Ringeissen.
A Mediator Based Approach For Services Composition, in: International Conference on Software Engineering Research, Management and Applications (SERA'08), Prague, Czech Republic, 2008
http://hal.inria.fr/inria-00275221/en/.
[35]
N. Guermouche, O. Perrin, C. Ringeissen.
Timed Specification For Web Services Compatibility Analysis, in: Proc. of the 3rd International Workshop on Automated Specification and Verification of Web Systems, Venice, Italy, Dec. 2007, Electronic Notes in Theoretical Computer Science, Elsevier, 2008, vol. 200/3, p. 155-170.
[36]
P.-C. Heam, O. Kouchnarenko, J. Voinot.
Component Simulation-based Substitutivity Managing QoS Aspects, in: 5th International Workshop on Formal Aspects On Component Softwre - FACS'08, Malaga, Spain, C. Canal, C. Pasareanu (editors), To appear in ENTCS, 2008
http://hal.inria.fr/inria-00329909/en/.
[37]
A. Imine.
Decentralized Concurrency Control for Real-time Collaborative Editors, in: 8th international conference on New technologies in distributed systems, NOTERE, Lyon, France, D. Benslimane, A. Ouksel (editors), ACM, June 2008, p. 313-321
http://hal.inria.fr/inria-00338859/en/.
[38]
A. Imine.
Flexible Concurrency Control for Real-time Collaborative Editors, in: 28th International Conference on Distributed Computing Systems Workshops, ICDCSW, Beijing, China, IEEE Computer Society, June 2008, p. 423-428
http://hal.inria.fr/inria-00338871/en/.
[39]
F. Jacquemard, M. Rusinowitch.
Closure of Hedge-Automata Languages by Hedge Rewriting, 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. 157-171
http://hal.inria.fr/inria-00329803/en/.
[40]
F. Klay, L. Vigneron.
Automatic Methods for Analyzing Non-Repudiation Protocols with an Active Intruder, in: 5th International Workshop on Formal Aspects in Security and Trust (FAST), Malaga, Spain, P. Degano, J. Guttman, F. Martinelli (editors), 15 pages. To appear as LNCS, 2008, p. 165-180
http://hal.inria.fr/inria-00329808/en/.
[41]
E. Monfroy, O. Perrin, C. Ringeissen.
Dynamic Web Services Provisioning with Constraints, in: International Conference on Cooperative Information Systems, OTM 2008, Part I, Monterrey, Mexico, R. Meersman, Z. Tari (editors), Lecture Notes in Computer Science, This work is partly funded by the INRIA-CONICYT project "CoreWeb" and the INRIA associate team "VanaWeb"., Springer, 2008, vol. 5331, p. 26-43
http://hal.inria.fr/inria-00329815/en/.
[42]
V. Pretre, F. Bouquet, C. Lang.
Automating UML Models Merge for Web Services Testing, in: iiWAS2008, 10th int. Conf. on Information Integration and Web-based Applications and Services, To appear, 2008.

Workshops without Proceedings

[43]
S. Anantharaman, H. Lin, C. Lynch, P. Narendran, M. Rusinowitch.
Active Intruders with Caps, in: FCS-ARSPA-WITS'08, Pittsburgh, USA, 2008
http://hal.inria.fr/inria-00330532/en/.
[44]
N. Chridi, M. Turuani, M. Rusinowitch.
Towards a Constrained-based Verification of Parameterized Cryptographic Protocols, in: LOPSTR 2008: Logic-based Program Synthesis and Transformation, Valencia, Spain, M. Hanus (editor), 2008
http://hal.inria.fr/inria-00332484/en/.
[45]
H. Comon-Lundh, V. Cortier.
Computational soundness of observational equivalence, in: 4th Workshop on Formal and Computational Cryptography - FCC 2008, Pittsburgh, USA, 2008
http://hal.inria.fr/inria-00323199/en/.

Internal Reports

[46]
Y. Boichut, P.-C. Heam.
A Theoretical Limit for Safety Verification Techniques with Regular Fix-point Computations, Research Report, INRIA, January 2008, no RR-6411
http://hal.inria.fr/inria-00204579/en/.
[47]
H. Boucheneb, A. Imine.
Experiments in Model-Checking Optimistic Replication Algorithms, RR-6510, INRIA, 2008
http://hal.inria.fr/inria-00274423/en/.
[48]
H. Comon-Lundh, V. Cortier.
Computational soundness of observational equivalence, RR-6508, INRIA, 2008
http://hal.inria.fr/inria-00274158/en/.
[49]
J.-F. Couchot, A. Giorgetti, N. Stouls.
Graph-based Reduction of Program Verification Conditions, RR-6702, INRIA, October 2008
http://hal.inria.fr/inria-00339847/en/.
[50]
F. Dadeau, P.-C. Héam, J. Levrey.
A Combination of Model-Based Testing and Random Testing Approaches using Automata, 21 pages, LIFC - Laboratoire d'Informatique de l'Université de Franche Comté, October 2008, no RR2008-10.
[51]
E. Nicolini, C. Ringeissen, M. Rusinowitch.
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets, RR-6697, INRIA, 2008
http://hal.inria.fr/inria-00331735/en/.
[52]
D.-K. Tran, C. Ringeissen, S. Ranise, H. Kirchner.
Combination of Convex Theories: Modularity, Deduction Completeness, and Explanation, RR-6688, INRIA, 2008
http://hal.inria.fr/inria-00331479/en/.

Other Publications

[53]
A. Berregba.
Du Contrôle d'Accès Dynamique pour les Editeurs Collaboratifs, Mémoire de Master Recherche, LORIA, Université Henri Poincaré, Nancy, 2008.

References in notes

[54]
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.
[55]
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.
[56]
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.
[57]
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.
[58]
A. Bouajjani, A. Muscholl, T. Touili.
Permutation Rewriting and Algorithmic Verification, in: LICS, 2001.
[59]
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.
[60]
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.
[61]
S. Burckel.
Procédé et Système de Transmission de Données, INPI 05 12491 - FR 2894743 - PCT FR2006/002692, december 2005, Patent.
[62]
S. Burckel, E. Gioan.
Procédé d'Optimisation des Ressources Mémoires, INPI FR0705152, july 2007, Patent.
[63]
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.
[64]
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.
[65]
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.
[66]
G. Feuillade, T. Genet, V. V. T. Tong.
Reachability Analysis over Term Rewriting Systems, in: J. Autom. Reasoning, 2004, vol. 33, no 3-4, p. 341-383.
[67]
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.
[68]
G. T. Leavens, A. L. Baker, C. Ruby.
JML: a Java Modeling Language, in: Formal Underpinnings of Java Workshop (at OOPSLA '98), October 1998.
[69]
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