Travelled to:
1 × Brazil
1 × Czech Republic
1 × Denmark
1 × Estonia
1 × Germany
1 × Hungary
1 × Japan
1 × Taiwan
1 × The Netherlands
2 × Canada
2 × Italy
2 × Spain
3 × Austria
3 × France
3 × Portugal
4 × United Kingdom
9 × USA
Collaborated with:
P.Narendran F.Jacquemard Y.Chevalier S.Anantharaman A.Bouhoula ∅ N.Berregeb J.Hsiang L.Vigneron E.Nicolini C.Ringeissen V.Cortier E.Zalinescu R.M.Verma M.Turuani A.Armando J.Musset G.Kucherov E.Kounalis R.Küsters A.Cherif A.Imine T.Abbes S.Ranise S.Stratulat F.Klay D.Lugiez E.Monfroy R.Schott C.Bouchard H.Comon R.Nieuwenhuis P.Hibbs L.Compagna S.Mödersheim L.Viganò S.Erbatur C.Lynch D.A.Basin J.Cuéllar D.v.Oheimb M.Bouallagui Y.Boichut P.H.Drielsma P.Héam O.Kouchnarenko J.Mantovani J.Santiago W.Arsac T.Avanesov M.Barletta A.Calvi A.Cappai R.Carbone G.Erzse S.Frau M.Minea G.Pellegrino S.E.Ponta M.Rocchetto M.T.Dashti
Talks about:
theori (9) rewrit (7) problem (5) system (5) modulo (5) protocol (4) intrud (4) combin (4) verif (4) word (4)
Person: Michaël Rusinowitch
DBLP: Rusinowitch:Micha=euml=l
Facilitated 2 volumes:
Contributed to:
Wrote 40 papers:
- LATA-2013-JacquemardR #automaton #term rewriting
- Rewrite Closure and CF Hedge Automata (FJ, MR), pp. 371–382.
- IJCAR-2012-AnantharamanELNR #unification
- Unification Modulo Synchronous Distributivity (SA, SE, CL, PN, MR), pp. 14–29.
- LATA-2012-AnantharamanBNR #unification
- Unification Modulo Chaining (SA, CB, PN, MR), pp. 70–82.
- TACAS-2012-ArmandoAABCCCCCCEFMMOPPRRDTV #architecture #automation #framework #platform #security #trust #validation
- The AVANTSSAR Platform for the Automated Validation of Trust and Security of Service-Oriented Architectures (AA, WA, TA, MB, AC, AC, RC, YC, LC, JC, GE, SF, MM, SM, DvO, GP, SEP, MR, MR, MTD, MT, LV), pp. 267–282.
- SAC-2011-CherifIR #collaboration #data access #distributed #editing
- Optimistic access control for distributed collaborative editors (AC, AI, MR), pp. 861–868.
- PPDP-2010-JacquemardR #verification #xml
- Rewrite-based verification of XML updates (FJ, MR), pp. 119–130.
- CADE-2009-NicoliniRR
- Combinable Extensions of Abelian Groups (EN, CR, MR), pp. 51–66.
- TACAS-2009-NicoliniRR #integer #satisfiability
- Satisfiability Procedures for Combination of Theories Sharing Integer Offsets (EN, CR, MR), pp. 428–442.
- RTA-2008-JacquemardR
- Closure of Hedge-Automata Languages by Hedge Rewriting (FJ, MR), pp. 157–171.
- SAC-2008-AbbesBR #detection
- An inference system for detecting firewall filtering rules anomalies (TA, AB, MR), pp. 2122–2128.
- RTA-2007-AnantharamanNR
- Intruders with Caps (SA, PN, MR), pp. 20–35.
- CSL-2006-CortierRZ #standard
- Relating Two Standard Notions of Secrecy (VC, MR, EZ), pp. 303–318.
- IJCAR-2006-JacquemardRV #automaton #constraints #equation #similarity
- Tree Automata with Equality Constraints Modulo Equational Theories (FJ, MR, LV), pp. 557–571.
- RTA-2006-ChevalierR
- Hierarchical Combination of Intruder Theories (YC, MR), pp. 108–122.
- CAV-2005-ArmandoBBCCCDHKMMORSTVV #automation #internet #protocol #security #validation
- The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications (AA, DAB, YB, YC, LC, JC, PHD, PCH, OK, JM, SM, DvO, MR, JS, MT, LV, LV), pp. 281–285.
- ICALP-2005-ChevalierR
- Combining Intruder Theories (YC, MR), pp. 639–651.
- PPDP-2005-CortierRZ #encryption #protocol #verification
- A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures (VC, MR, EZ), pp. 12–22.
- CADE-2003-AnantharamanNR #morphism #unification
- Unification Modulo ACU I Plus Homomorphisms/Distributivity (SA, PN, MR), pp. 442–457.
- CSL-2003-ChevalierKRTV #bound
- Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions (YC, RK, MR, MT, LV), pp. 128–141.
- FME-2003-MussetR #linear
- Computing Meta-transitions for Linear Transition Systems with Polynomials (JM, MR), pp. 562–581.
- LICS-2003-ChevalierKRT #protocol
- An NP Decision Procedure for Protocol Insecurity with XOR (YC, RK, MR, MT), pp. 261–270.
- CAV-2002-ArmandoBBCCMRTVV #analysis #protocol #security
- The AVISS Security Protocol Analysis Tool (AA, DAB, MB, YC, LC, SM, MR, MT, LV, LV), pp. 349–353.
- CSL-2001-ArmandoRR
- Uniform Derivation of Decision Procedures by Superposition (AA, SR, MR), pp. 513–527.
- RTA-2001-Rusinowitch #deduction #verification
- Rewriting for Deduction and Verification (MR), p. 2.
- CAV-2000-RusinowitchSK #consistency #incremental #verification
- Mechanical Verification of an Ideal Incremental ABR Conformance (MR, SS, FK), pp. 344–357.
- CL-2000-NarendranR #decidability #formal method
- The Theory of Total Unary RPO Is Decidable (PN, MR), pp. 660–672.
- CSL-1998-NarendranRV #constraints #theorem proving
- RPO Constraint Solving Is in NP (PN, MR, RMV), pp. 385–398.
- FASE-1998-BerregebBR #proving
- Observational Proofs with Critical Contexts (NB, AB, MR), pp. 38–53.
- LICS-1998-ComonNNR #order #problem
- Decision Problems in Ordered Rewriting (HC, PN, RN, MR), pp. 276–286.
- RTA-1998-VermaRL #algorithm #problem #reduction
- Algorithms and Reductions for Rewriting Problems (RMV, MR, DL), pp. 166–180.
- CAV-1996-BerregebBR #automation #commutative #induction #verification
- Automated Verification by Induction with Associative-Commutative Operators (NB, AB, MR), pp. 220–231.
- RTA-1996-BerregebBR #commutative #induction #named #proving
- SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories (NB, AB, MR), pp. 428–431.
- SAC-1996-MonfroyRS #constraints #implementation
- Implementing non-linear constraints with cooperative solvers (EM, MR, RS), pp. 63–72.
- SAC-1994-KucherovR #on the #problem #term rewriting #word
- On ground reducibility problem for word rewriting systems with variables (GK, MR), pp. 271–276.
- RTA-1991-NarendranR #canonical #commutative #finite
- Any Gound Associative-Commutative Theory Has a Finite Canonical System (PN, MR), pp. 423–434.
- CADE-1988-KounalisR #on the #problem #word
- On Word Problems in Horn Theories (EK, MR), pp. 527–537.
- ICALP-1987-HsiangR #equation #on the #problem #word
- On Word Problems in Equational Theories (JH, MR), pp. 54–71.
- CADE-1986-HsiangR #proving #theorem proving
- A New Method for Establishing Refutational Completeness in Theorem Proving (JH, MR), pp. 141–152.
- RTA-1985-Rusinowitch #composition #recursion #revisited
- Path of Subterms Ordering and Recursive Decomposition Ordering Revisited (MR), pp. 225–240.
- CADE-2019-AnantharamanHNR #equation #unification #word
- Unification Modulo Lists with Reverse Relation with Certain Word Equations (SA, PH, PN, MR), pp. 1–17.