| 2009 |
|---|
| 103 | EE | Enrica Nicolini,
Christophe Ringeissen,
Michaël Rusinowitch:
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets.
TACAS 2009: 428-442 |
| 2008 |
|---|
| 102 | EE | Florent Jacquemard,
Michaël Rusinowitch:
Closure of Hedge-Automata Languages by Hedge Rewriting.
RTA 2008: 157-171 |
| 101 | EE | Tarek Abbes,
Adel Bouhoula,
Michaël Rusinowitch:
An inference system for detecting firewall filtering rules anomalies.
SAC 2008: 2122-2128 |
| 100 | EE | Yannick Chevalier,
Ralf Küsters,
Michaël Rusinowitch,
Mathieu Turuani:
Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption.
ACM Trans. Comput. Log. 9(4): (2008) |
| 99 | EE | Yannick Chevalier,
Michaël Rusinowitch:
Hierarchical combination of intruder theories.
Inf. Comput. 206(2-4): 352-377 (2008) |
| 98 | EE | Florent Jacquemard,
Michaël Rusinowitch,
Laurent Vigneron:
Tree automata with equality constraints modulo equational theories.
J. Log. Algebr. Program. 75(2): 182-208 (2008) |
| 2007 |
|---|
| 97 | EE | Tarek Abbes,
Adel Bouhoula,
Michaël Rusinowitch:
A Traffic Classification Algorithm for Intrusion Detection.
AINA Workshops (1) 2007: 188-193 |
| 96 | EE | Yannick Chevalier,
Denis Lugiez,
Michaël Rusinowitch:
Towards an Automatic Analysis of Web Service Security.
FroCos 2007: 133-147 |
| 95 | EE | Yannick Chevalier,
Denis Lugiez,
Michaël Rusinowitch:
Verifying Cryptographic Protocols with Subterms Constraints.
LPAR 2007: 181-195 |
| 94 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
Intruders with Caps.
RTA 2007: 20-35 |
| 93 | EE | Abdessamad Imine,
Michaël Rusinowitch:
Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms.
Rewriting, Computation and Proof 2007: 213-234 |
| 92 | EE | Véronique Cortier,
Michaël Rusinowitch,
Eugen Zalinescu:
Relating two standard notions of secrecy
CoRR abs/0706.0502: (2007) |
| 91 | EE | Véronique Cortier,
Michaël Rusinowitch,
Eugen Zalinescu:
Relating two standard notions of secrecy.
Logical Methods in Computer Science 3(3): (2007) |
| 2006 |
|---|
| 90 | EE | Véronique Cortier,
Michaël Rusinowitch,
Eugen Zalinescu:
Relating Two Standard Notions of Secrecy.
CSL 2006: 303-318 |
| 89 | EE | Florent Jacquemard,
Michaël Rusinowitch,
Laurent Vigneron:
Tree Automata with Equality Constraints Modulo Equational Theories.
IJCAR 2006: 557-571 |
| 88 | EE | Yannick Chevalier,
Michaël Rusinowitch:
Hierarchical Combination of Intruder Theories.
RTA 2006: 108-122 |
| 87 | EE | Eugen Zalinescu,
Véronique Cortier,
Michaël Rusinowitch:
Relating two standard notions of secrecy.
Trustworthy Software 2006 |
| 86 | EE | Alessandro Armando,
David A. Basin,
Jorge Cuéllar,
Michaël Rusinowitch,
Luca Viganò:
Automated Reasoning for Security Protocol Analysis.
J. Autom. Reasoning 36(1-2): 1-3 (2006) |
| 85 | EE | Abdessamad Imine,
Michaël Rusinowitch,
Gérald Oster,
Pascal Molli:
Formal design and verification of operational transformation algorithms for copies convergence.
Theor. Comput. Sci. 351(2): 167-183 (2006) |
| 2005 |
|---|
| 84 | EE | Alessandro Armando,
David A. Basin,
Yohan Boichut,
Yannick Chevalier,
Luca Compagna,
Jorge Cuéllar,
Paul Hankes Drielsma,
Pierre-Cyrille Héam,
Olga Kouchnarenko,
Jacopo Mantovani,
Sebastian Mödersheim,
David von Oheimb,
Michaël Rusinowitch,
Judson Santiago,
Mathieu Turuani,
Luca Viganò,
Laurent Vigneron:
The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications.
CAV 2005: 281-285 |
| 83 | EE | Abdessamad Imine,
Pascal Molli,
Gérald Oster,
Michaël Rusinowitch:
Towards Synchronizing Linear Collaborative Objects with Operational Transformation.
FORTE 2005: 411-427 |
| 82 | EE | Yannick Chevalier,
Michaël Rusinowitch:
Combining Intruder Theories.
ICALP 2005: 639-651 |
| 81 | EE | Véronique Cortier,
Michaël Rusinowitch,
Eugen Zalinescu:
A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures.
PPDP 2005: 12-22 |
| 80 | EE | Yannick Chevalier,
Ralf Küsters,
Michaël Rusinowitch,
Mathieu Turuani:
Deciding the Security of Protocols with Commuting Public Key Encryption.
Electr. Notes Theor. Comput. Sci. 125(1): 55-66 (2005) |
| 79 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
Closure properties and decision problems of dag automata.
Inf. Process. Lett. 94(5): 231-240 (2005) |
| 78 | EE | Yannick Chevalier,
Ralf Küsters,
Michaël Rusinowitch,
Mathieu Turuani:
An NP decision procedure for protocol insecurity with XOR.
Theor. Comput. Sci. 338(1-3): 247-274 (2005) |
| 2004 |
|---|
| 77 | | David A. Basin,
Michaël Rusinowitch:
Automated Reasoning - Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004, Proceedings
Springer 2004 |
| 76 | EE | Abdessamad Imine,
Pascal Molli,
Gérald Oster,
Michaël Rusinowitch:
Deductive Verification of Distributed Groupware Systems.
AMAST 2004: 226-240 |
| 75 | | Michaël Rusinowitch:
A Decidable Analysis of Security Protocols.
IFIP TCS 2004: 21 |
| 74 | EE | Tarek Abbes,
Adel Bouhoula,
Michaël Rusinowitch:
Protocol Analysis in Intrusion Detection Using Decision Tree.
ITCC (1) 2004: 404-408 |
| 73 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
Unification Modulo ACUI Plus Distributivity Axioms.
J. Autom. Reasoning 33(1): 1-28 (2004) |
| 72 | | Michaël Rusinowitch:
Éditorial.
Technique et Science Informatiques 23(3): 289-290 (2004) |
| 71 | EE | Georg Gottlob,
Miki Hermann,
Michaël Rusinowitch:
2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword.
Theory Comput. Syst. 37(6): 639-640 (2004) |
| 2003 |
|---|
| 70 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
Unification Modulo ACU I Plus Homomorphisms/Distributivity.
CADE 2003: 442-457 |
| 69 | EE | Yannick Chevalier,
Ralf Küsters,
Michaël Rusinowitch,
Mathieu Turuani,
Laurent Vigneron:
Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions.
CSL 2003: 128-141 |
| 68 | EE | Abdessamad Imine,
Pascal Molli,
Gérald Oster,
Michaël Rusinowitch:
Proving Correctness of Transformation Functions Functions in Real-Time Groupware.
ECSCW 2003: 277-293 |
| 67 | EE | Julien Musset,
Michaël Rusinowitch:
Computing Meta-transitions for Linear Transition Systems with Polynomials.
FME 2003: 562-581 |
| 66 | EE | Yannick Chevalier,
Ralf Küsters,
Michaël Rusinowitch,
Mathieu Turuani:
Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents.
FSTTCS 2003: 124-135 |
| 65 | EE | Yannick Chevalier,
Ralf Küsters,
Michaël Rusinowitch,
Mathieu Turuani:
An NP Decision Procedure for Protocol Insecurity with XOR.
LICS 2003: 261-270 |
| 64 | EE | Siva Anantharaman,
Paliath Narendran,
Michaël Rusinowitch:
ACID-Unification Is NEXPTIME-Decidable.
MFCS 2003: 169-178 |
| 63 | EE | Hubert Comon,
Paliath Narendran,
Robert Nieuwenhuis,
Michaël Rusinowitch:
Deciding the confluence of ordered term rewrite systems.
ACM Trans. Comput. Log. 4(1): 33-55 (2003) |
| 62 | EE | Michaël Rusinowitch:
Automated analysis of security protocols.
Electr. Notes Theor. Comput. Sci. 86(3): (2003) |
| 61 | EE | Alessandro Armando,
Silvio Ranise,
Michaël Rusinowitch:
A rewriting approach to satisfiability procedures.
Inf. Comput. 183(2): 140-164 (2003) |
| 60 | | Michaël Rusinowitch,
Sorin Stratulat,
Francis Klay:
Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm.
J. Autom. Reasoning 30(2): 53-177 (2003) |
| 59 | EE | Michaël Rusinowitch,
Mathieu Turuani:
Protocol insecurity with a finite number of sessions, composed keys is NP-complete.
Theor. Comput. Sci. 1-3(299): 451-475 (2003) |
| 2002 |
|---|
| 58 | EE | Alessandro Armando,
David A. Basin,
Mehdi Bouallagui,
Yannick Chevalier,
Luca Compagna,
Sebastian Mödersheim,
Michaël Rusinowitch,
Mathieu Turuani,
Luca Viganò,
Laurent Vigneron:
The AVISS Security Protocol Analysis Tool.
CAV 2002: 349-353 |
| 57 | EE | Paliath Narendran,
Michaël Rusinowitch:
Guest Editorial.
Inf. Comput. 178(2): 345 (2002) |
| 56 | EE | Alessandro Armando,
Michaël Rusinowitch,
Sorin Stratulat:
Incorporating Decision Procedures in Implicit Induction.
J. Symb. Comput. 34(4): 241-258 (2002) |
| 55 | EE | Adel Bouhoula,
Michaël Rusinowitch:
Observational proofs by rewriting.
Theor. Comput. Sci. 275(1-2): 675-698 (2002) |
| 2001 |
|---|
| 54 | EE | Michaël Rusinowitch,
Mathieu Turuani:
Protocol Insecurity with Finite Number of Sessions is NP-Complete.
CSFW 2001: 174- |
| 53 | EE | Alessandro Armando,
Silvio Ranise,
Michaël Rusinowitch:
Uniform Derivation of Decision Procedures by Superposition.
CSL 2001: 513-527 |
| 52 | EE | Michaël Rusinowitch:
Rewriting for Deduction and Verification.
RTA 2001: 2 |
| 51 | EE | Michaël Rusinowitch:
The practice of cryptographic protocol verification.
Electr. Notes Theor. Comput. Sci. 55(1): (2001) |
| 50 | | Rakesh M. Verma,
Michaël Rusinowitch,
Denis Lugiez:
Algorithms and Reductions for Rewriting Problems.
Fundam. Inform. 46(3): 257-276 (2001) |
| 2000 |
|---|
| 49 | | Michaël Rusinowitch,
Sorin Stratulat,
Francis Klay:
Mechanical Verification of an Ideal Incremental ABR Conformance.
CAV 2000: 344-357 |
| 48 | EE | Paliath Narendran,
Michaël Rusinowitch:
The Theory of Total Unary RPO Is Decidable.
Computational Logic 2000: 660-672 |
| 47 | EE | Florent Jacquemard,
Michaël Rusinowitch,
Laurent Vigneron:
Compiling and Verifying Security Protocols.
LPAR 2000: 131-160 |
| 1999 |
|---|
| 46 | | Paliath Narendran,
Michaël Rusinowitch:
Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings
Springer 1999 |
| 45 | EE | Gregory Kucherov,
Michaël Rusinowitch:
Patterns in Words versus Patterns in Trees: A Brief Survey and New Results.
Ershov Memorial Conference 1999: 283-296 |
| 1998 |
|---|
| 44 | | Paliath Narendran,
Michaël Rusinowitch,
Rakesh M. Verma:
RPO Constraint Solving Is in NP.
CSL 1998: 385-398 |
| 43 | EE | Narjes Berregeb,
Adel Bouhoula,
Michaël Rusinowitch:
Observational Proofs with Critical Contexts.
FASE 1998: 38-53 |
| 42 | | Hubert Comon,
Paliath Narendran,
Robert Nieuwenhuis,
Michaël Rusinowitch:
Decision Problems in Ordered Rewriting.
LICS 1998: 276-286 |
| 41 | EE | Rakesh M. Verma,
Michaël Rusinowitch,
Denis Lugiez:
Algorithms and Reductions for Rewriting Problems.
RTA 1998: 166-180 |
| 1997 |
|---|
| 40 | EE | Gregory Kucherov,
Michaël Rusinowitch:
Matching a Set of Strings with Variable Length don't Cares.
Theor. Comput. Sci. 178(1-2): 129-154 (1997) |
| 1996 |
|---|
| 39 | | Narjes Berregeb,
Adel Bouhoula,
Michaël Rusinowitch:
Automated Verification by Induction with Associative-Commutative Operators.
CAV 1996: 220-231 |
| 38 | | Narjes Berregeb,
Adel Bouhoula,
Michaël Rusinowitch:
SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories.
RTA 1996: 428-431 |
| 37 | EE | Eric Monfroy,
Michaël Rusinowitch,
René Schott:
Implementing non-linear constraints with cooperative solvers.
SAC 1996: 63-72 |
| 36 | | Paliath Narendran,
Michaël Rusinowitch:
Any Ground Associative-Commutative Theory Has a Finite Canonical System.
J. Autom. Reasoning 17(1): 131-143 (1996) |
| 1995 |
|---|
| 35 | | Adel Bouhoula,
Michaël Rusinowitch:
SPIKE: A System for Automatic Inductive Proofs.
AMAST 1995: 576-577 |
| 34 | | Gregory Kucherov,
Michaël Rusinowitch:
Matching a Set of Strings with Variable Length Don't Cares.
CPM 1995: 230-247 |
| 33 | | Emmanuel Kounalis,
Michaël Rusinowitch:
Reasoning with Conditional Axioms.
Ann. Math. Artif. Intell. 15(2): 125-149 (1995) |
| 32 | | Michaël Rusinowitch,
Laurent Vigneron:
Automated Deduction Associative-Commutative Operators.
Appl. Algebra Eng. Commun. Comput. 6: 23-56 (1995) |
| 31 | EE | Gregory Kucherov,
Michaël Rusinowitch:
Undecidability of Ground Reducibility for Word Rewriting Systems with Variables.
Inf. Process. Lett. 53(4): 209-215 (1995) |
| 30 | | Adel Bouhoula,
Michaël Rusinowitch:
Implicit Induction in Conditional Theories.
J. Autom. Reasoning 14(2): 189-235 (1995) |
| 29 | | Adel Bouhoula,
Emmanuel Kounalis,
Michaël Rusinowitch:
Automated Mathematical Induction.
J. Log. Comput. 5(5): 631-668 (1995) |
| 1994 |
|---|
| 28 | | Gregory Kucherov,
Michaël Rusinowitch:
The Complexitiy of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables.
CTRS 1994: 262-275 |
| 27 | EE | Gregory Kucherov,
Michaël Rusinowitch:
On ground reducibility problem for word rewriting systems with variables.
SAC 1994: 271-276 |
| 1993 |
|---|
| 26 | | Michaël Rusinowitch,
Jean-Luc Remy:
Conditional Term Rewriting Systems, Third International Workshop, CTRS-92, Pont-à-Mousson, France, July 8-10, 1992, Proceedings
Springer 1993 |
| 25 | | Adel Bouhoula,
Michaël Rusinowitch:
Automatic Case Analysis in Proof by Induction.
IJCAI 1993: 88-94 |
| 24 | | Paliath Narendran,
Michaël Rusinowitch:
The Unifiability Problem in Ground AC Theories
LICS 1993: 364-370 |
| 1992 |
|---|
| 23 | | Adel Bouhoula,
Emmanuel Kounalis,
Michaël Rusinowitch:
SPIKE, an Automatic Theorem Prover.
LPAR 1992: 460-462 |
| 22 | | Jieh Hsiang,
Hélène Kirchner,
Pierre Lescanne,
Michaël Rusinowitch:
The Term Rewriting Approach to Automated Theorem Proving.
J. Log. Program. 14(1&2): 71-99 (1992) |
| 1991 |
|---|
| 21 | | Emmanuel Kounalis,
Michaël Rusinowitch:
Studies on the Ground Convergence Property of Conditional Theories.
AMAST 1991: 363-376 |
| 20 | | Michaël Rusinowitch,
Laurent Vigneron:
Automated deduction with associative commutative operators.
FAIR 1991: 185-199 |
| 19 | | Emmanuel Kounalis,
Michaël Rusinowitch:
Automatic Proof Methods for Algebraic Specifications.
FCT 1991: 307-317 |
| 18 | | Paliath Narendran,
Michaël Rusinowitch:
Any Gound Associative-Commutative Theory Has a Finite Canonical System.
RTA 1991: 423-434 |
| 17 | EE | Jieh Hsiang,
Michaël Rusinowitch:
Proving Refutational Completeness of Theorem-Proving Strategies: The Transfinite Semantic Tree Method.
J. ACM 38(3): 559-587 (1991) |
| 16 | | Emmanuel Kounalis,
Michaël Rusinowitch:
On Word Problems in Horn Theories.
J. Symb. Comput. 11(1/2): 113-127 (1991) |
| 15 | | Michaël Rusinowitch:
Theorem-Proving with Resolution and Superposition.
J. Symb. Comput. 11(1/2): 21-49 (1991) |
| 1990 |
|---|
| 14 | | Emmanuel Kounalis,
Michaël Rusinowitch:
Mechanizing Inductive Reasoning.
AAAI 1990: 240-245 |
| 13 | | Emmanuel Kounalis,
Michaël Rusinowitch:
A Proof System for Conditional Algebraic Specifications.
CTRS 1990: 51-63 |
| 12 | | Béchir el Ayeb,
Pierre Marquis,
Michaël Rusinowitch:
Deductive/Abductvie Diagnosis: The DA-Principles.
ECAI 1990: 47-52 |
| 11 | | Béchir el Ayeb,
Pierre Marquis,
Michaël Rusinowitch:
A New Diagnosis Approach by Deduction and Abduction.
Expert Systems in Engineering 1990: 32-46 |
| 10 | | Emmanuel Kounalis,
Michaël Rusinowitch:
Mechanizing inductive reasoning.
Bulletin of the EATCS 41: 216-226 (1990) |
| 1988 |
|---|
| 9 | | Emmanuel Kounalis,
Michaël Rusinowitch:
On Word Problems in Horn Theories.
CADE 1988: 527-537 |
| 8 | | Michaël Rusinowitch:
Theorem-Proving with Resolution and Superposition: An Extension of the Knuth and Bendic Procedure to a Complete Set of Inference Rules.
FGCS 1988: 524-531 |
| 1987 |
|---|
| 7 | | Emmanuel Kounalis,
Michaël Rusinowitch:
On Word Problems in Horn Theories.
CTRS 1987: 144-160 |
| 6 | | Jieh Hsiang,
Michaël Rusinowitch:
On Word Problems in Equational Theories.
ICALP 1987: 54-71 |
| 5 | | Jieh Hsiang,
Michaël Rusinowitch,
Kô Sakai:
Complete Inference Rules for the Cancellation Laws.
IJCAI 1987: 990-992 |
| 4 | | Michaël Rusinowitch:
On Termination of the Direct Sum of Term-Rewriting Systems.
Inf. Process. Lett. 26(2): 65-70 (1987) |
| 3 | | Michaël Rusinowitch:
Path of Subterms Ordering and Recursive Decomposition Ordering Revisited.
J. Symb. Comput. 3(1/2): 117-131 (1987) |
| 1986 |
|---|
| 2 | | Jieh Hsiang,
Michaël Rusinowitch:
A New Method for Establishing Refutational Completeness in Theorem Proving.
CADE 1986: 141-152 |
| 1985 |
|---|
| 1 | | Michaël Rusinowitch:
Path of Subterms Ordering and Recursive Decomposition Ordering Revisited.
RTA 1985: 225-240 |
