default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDMichaël Rusinowitch
Person information
- affiliation: INRIA, France
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
Journal Articles
- 2019
[j53]Florent Jacquemard, Michaël Rusinowitch:
One-variable context-free hedge automata. J. Comput. Syst. Sci. 104: 278-296 (2019)- 2017
- [j52]Tigran Avanesov, Yannick Chevalier
, Michaël Rusinowitch, Mathieu Turuani:
Intruder deducibility constraints with negation. Decidability and application to secured service compositions. J. Symb. Comput. 80: 4-26 (2017) - [j51]Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani:
Satisfiability of general intruder constraints with and without a set constructor. J. Symb. Comput. 80: 27-61 (2017) - 2016
- [j50]Tarek Abbes, Adel Bouhoula, Michaël Rusinowitch:
Detection of firewall configuration errors with updatable tree. Int. J. Inf. Sec. 15(3): 301-317 (2016) - [j49]Hiep H. Nguyen, Abdessamad Imine, Michaël Rusinowitch:
Network Structure Release under Differential Privacy. Trans. Data Priv. 9(3): 215-241 (2016) - 2015
- [j48]Walid Belkhir, Yannick Chevalier, Michaël Rusinowitch:
Parametrized automata simulation and application to service composition. J. Symb. Comput. 69: 40-60 (2015) - [j47]Frédéric Dadeau, Pierre-Cyrille Héam, Rafik Kheddam, Ghazi Maatoug, Michaël Rusinowitch:
Model-based mutation testing from security protocols in HLPSL. Softw. Test. Verification Reliab. 25(5-7): 684-711 (2015) - 2014
- [j46]Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch:
Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining. Log. Methods Comput. Sci. 10(1) (2014) - [j45]Asma Cherif, Abdessamad Imine, Michaël Rusinowitch:
Practical access control management for distributed collaborative editors. Pervasive Mob. Comput. 15: 62-86 (2014) - 2012
- [j44]Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Homomorphic Encryption. J. Autom. Reason. 48(2): 135-158 (2012) - [j43]Yannick Chevalier, Michaël Rusinowitch:
Decidability of Equivalence of Symbolic Derivations. J. Autom. Reason. 48(2): 263-292 (2012) - 2011
- [j42]Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
String Rewriting and Security Analysis: An Extension of a Result of Book and Otto. J. Autom. Lang. Comb. 16(2-4): 75-90 (2011) - 2010
- [j41]Enrica Nicolini, Christophe Ringeissen, Michaël Rusinowitch:
Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator. Fundam. Informaticae 105(1-2): 163-187 (2010) - [j40]Tarek Abbes, Adel Bouhoula, Michaël Rusinowitch:
Efficient decision tree for protocol analysis in intrusion detection. Int. J. Secur. Networks 5(4): 220-235 (2010) - [j39]Yannick Chevalier, Michaël Rusinowitch:
Compiling and securing cryptographic protocols. Inf. Process. Lett. 110(3): 116-122 (2010) - [j38]Yannick Chevalier, Michaël Rusinowitch:
Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures. Theor. Comput. Sci. 411(10): 1261-1282 (2010) - 2008
- [j37]Yannick Chevalier, Michaël Rusinowitch:
Hierarchical combination of intruder theories. Inf. Comput. 206(2-4): 352-377 (2008) - [j36]Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron:
Tree automata with equality constraints modulo equational theories. J. Log. Algebraic Methods Program. 75(2): 182-208 (2008) - [j35]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): 24:1-24:52 (2008) - 2007
- [j34]Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu:
Relating two standard notions of secrecy. Log. Methods Comput. Sci. 3(3) (2007) - 2006
- [j33]Siva Anantharaman, Paul Gastin, Gaétan Hains, John Mullins, Michaël Rusinowitch:
Editorial. J. Autom. Lang. Comb. 11(1): 5-6 (2006) - [j32]Alessandro Armando, David A. Basin, Jorge Cuéllar, Michaël Rusinowitch, Luca Viganò:
Automated Reasoning for Security Protocol Analysis. J. Autom. Reason. 36(1-2): 1-3 (2006) - [j31]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
- [j30]Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
Closure properties and decision problems of dag automata. Inf. Process. Lett. 94(5): 231-240 (2005) - [j29]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
- [j28]Tarek Abbes, Adel Bouhoula, Michaël Rusinowitch:
On the fly pattern matching for intrusion detection with Snort. Ann. des Télécommunications 59(9-10): 1045-1071 (2004) - [j27]Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo ACUI Plus Distributivity Axioms. J. Autom. Reason. 33(1): 1-28 (2004) - [j26]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) - [j25]Michaël Rusinowitch:
Éditorial. Tech. Sci. Informatiques 23(3): 289-290 (2004) - 2003
- [j24]Alessandro Armando, Silvio Ranise, Michaël Rusinowitch:
A rewriting approach to satisfiability procedures. Inf. Comput. 183(2): 140-164 (2003) - [j23]Michaël Rusinowitch, Sorin Stratulat, Francis Klay:
Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm. J. Autom. Reason. 30(2): 53-177 (2003) - [j22]Michaël Rusinowitch, Mathieu Turuani:
Protocol insecurity with a finite number of sessions, composed keys is NP-complete. Theor. Comput. Sci. 299(1-3): 451-475 (2003) - [j21]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) - 2002
- [j20]Paliath Narendran, Michaël Rusinowitch:
Guest Editorial. Inf. Comput. 178(2): 345 (2002) - [j19]Alessandro Armando, Michaël Rusinowitch, Sorin Stratulat:
Incorporating Decision Procedures in Implicit Induction. J. Symb. Comput. 34(4): 241-258 (2002) - [j18]Adel Bouhoula, Michaël Rusinowitch:
Observational proofs by rewriting. Theor. Comput. Sci. 275(1-2): 675-698 (2002) - 2001
- [j17]Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez:
Algorithms and Reductions for Rewriting Problems. Fundam. Informaticae 46(3): 257-276 (2001) - 1997
- [j16]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
- [j15]Paliath Narendran, Michaël Rusinowitch:
Any Ground Associative-Commutative Theory Has a Finite Canonical System. J. Autom. Reason. 17(1): 131-143 (1996) - 1995
- [j14]Michaël Rusinowitch, Laurent Vigneron:
Automated deduction with associative-commutative operators. Appl. Algebra Eng. Commun. Comput. 6: 23-56 (1995) - [j13]Emmanuel Kounalis, Michaël Rusinowitch:
Reasoning with Conditional Axioms. Ann. Math. Artif. Intell. 15(2): 125-149 (1995) - [j12]Gregory Kucherov, Michaël Rusinowitch:
Undecidability of Ground Reducibility for Word Rewriting Systems with Variables. Inf. Process. Lett. 53(4): 209-215 (1995) - [j11]Adel Bouhoula, Michaël Rusinowitch:
Implicit Induction in Conditional Theories. J. Autom. Reason. 14(2): 189-235 (1995) - [j10]Adel Bouhoula, Emmanuel Kounalis, Michaël Rusinowitch:
Automated Mathematical Induction. J. Log. Comput. 5(5): 631-668 (1995) - 1993
- [j9]Emmanuel Kounalis, Michaël Rusinowitch:
A Logical Framework for Concept Learning with Background Knowledge. Int. J. Artif. Intell. Tools 2(3): 329-348 (1993) - [j8]Béchir el Ayeb, Pierre Marquis, Michaël Rusinowitch:
Preferring diagnoses by abduction. IEEE Trans. Syst. Man Cybern. 23(3): 792-808 (1993) - 1992
- [j7]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
- [j6]Jieh Hsiang, Michaël Rusinowitch:
Proving Refutational Completeness of Theorem-Proving Strategies: The Transfinite Semantic Tree Method. J. ACM 38(3): 559-587 (1991) - [j5]Michaël Rusinowitch:
Theorem-Proving with Resolution and Superposition. J. Symb. Comput. 11(1/2): 21-49 (1991) - [j4]Emmanuel Kounalis, Michaël Rusinowitch:
On Word Problems in Horn Theories. J. Symb. Comput. 11(1/2): 113-127 (1991) - 1990
- [j3]Emmanuel Kounalis, Michaël Rusinowitch:
Mechanizing inductive reasoning. Bull. EATCS 41: 216-226 (1990) - 1987
- [j2]Michaël Rusinowitch:
On Termination of the Direct Sum of Term-Rewriting Systems. Inf. Process. Lett. 26(2): 65-70 (1987) - [j1]Michaël Rusinowitch:
Path of Subterms Ordering and Recursive Decomposition Ordering Revisited. J. Symb. Comput. 3(1/2): 117-131 (1987)
Conference and Workshop Papers
- 2024
- [c124]Wafik Zahwa, Abdelkader Lahmadi, Michaël Rusinowitch, Mondher Ayadi:
In-Network ACL Rules Placement using Deep Reinforcement Learning. MeditCom 2024: 341-346 - 2023
- [c123]Wafik Zahwa, Abdelkader Lahmadi, Michaël Rusinowitch, Mondher Ayadi:
Automated Placement of In-Network ACL Rules. NetSoft 2023: 486-491 - 2022
- [c122]Kamalkumar Macwan, Abdessamad Imine, Michaël Rusinowitch:
Differentially Private Friends Recommendation. FPS 2022: 236-251 - [c121]Ahmad Abboud, Rémi Garcia, Abdelkader Lahmadi, Michaël Rusinowitch, Adel Bouhoula, Mondher Ayadi:
Automatically Distributing and Updating In-Network Management Rules for Software Defined Networks. NOMS 2022: 1-9 - [c120]Kamalkumar Macwan, Abdessamad Imine, Michaël Rusinowitch:
Privacy Preserving Recommendations for Social Networks. SNAMS 2022: 1-8 - [c119]Yannick Chevalier, Michaël Rusinowitch:
Deciding Whether two Codes Have the Same Ambiguities is in co-NP. SYNASC 2022: 84-91 - 2021
- [c118]Sanaz Eidizadehakhcheloo, Bizhan Alipour Pijani, Abdessamad Imine, Michaël Rusinowitch:
Divide-and-Learn: A Random Indexing Approach to Attribute Inference Attacks in Online Social Networks. DBSec 2021: 338-354 - [c117]Noreddine Belhadj Cheikh, Abdessamad Imine, Michaël Rusinowitch:
FOX: Fooling with Explanations : Privacy Protection with Adversarial Reactions in Social Media. PST 2021: 1-10 - [c116]Yannick Chevalier, Michaël Rusinowitch:
Implementing Security Protocol Monitors. SCSS 2021: 22-34 - 2020
- [c115]Sanaz Eidizadehakhcheloo, Bizhan Alipour Pijani, Abdessamad Imine, Michaël Rusinowitch:
Your Age Revealed by Facebook Picture Metadata. ADBIS/TPDL/EDA Workshops 2020: 259-270 - [c114]Ahmad Abboud, Rémi Garcia, Abdelkader Lahmadi, Michaël Rusinowitch, Adel Bouhoula:
R2-D2: Filter Rule set Decomposition and Distribution in Software Defined Networks. CNSM 2020: 1-4 - [c113]Bizhan Alipour Pijani, Abdessamad Imine, Michaël Rusinowitch:
Online Attacks on Picture Owner Privacy. DEXA (2) 2020: 33-47 - [c112]Ahmad Abboud, Abdelkader Lahmadi, Michaël Rusinowitch, Miguel Couceiro, Adel Bouhoula, Mondher Avadi:
Double Mask: An Efficient Rule Encoding for Software Defined Networking. ICIN 2020: 186-193 - [c111]Ahmad Abboud, Rémi Garcia, Abdelkader Lahmadi, Michaël Rusinowitch, Adel Bouhoula:
Efficient Distribution of Security Policy Filtering Rules in Software Defined Networks. NCA 2020: 1-10 - [c110]Bizhan Alipour Pijani, Abdessamad Imine, Michaël Rusinowitch:
You are what emojis say about your pictures: language-independent gender inference attack on Facebook. SAC 2020: 1826-1834 - 2019
- [c109]Siva Anantharaman, Peter Hibbs, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Lists with Reverse Relation with Certain Word Equations. CADE 2019: 1-17 - [c108]Ahmad Abboud, Abdelkader Lahmadi, Michaël Rusinowitch, Miguel Couceiro, Adel Bouhoula:
Poster : Minimizing range rules for packet filtering using a double mask representation. Networking 2019: 1-2 - [c107]Bizhan Alipour, Abdessamad Imine, Michaël Rusinowitch:
Gender Inference for Facebook Picture Owners. TrustBus 2019: 145-160 - 2018
- [c106]Younes Abid, Abdessamad Imine, Michaël Rusinowitch:
Online Testing of User Profile Resilience Against Inference Attacks in Social Networks. ADBIS (Short Papers and Workshops) 2018: 105-117 - [c105]Younes Abid, Abdessamad Imine, Michaël Rusinowitch:
Sensitive Attribute Prediction for Social Networks Users. EDBT/ICDT Workshops 2018: 28-35 - 2017
- [c104]Younes Abid, Abdessamad Imine, Amedeo Napoli, Chedy Raïssi, Michaël Rusinowitch:
Two-Phase Preference Disclosure in Attributed Social Networks. DEXA (1) 2017: 249-263 - 2016
- [c103]Younes Abid, Abdessamad Imine, Amedeo Napoli, Chedy Raïssi, Michaël Rusinowitch:
Online Link Disclosure Strategies for Social Networks. CRiSIS 2016: 153-168 - [c102]Pierre-Cyrille Héam, Frédéric Dadeau, Rafik Kheddam, Ghazi Maatoug, Michaël Rusinowitch:
A Model-Based Testing Approach for Security Protocols. CSE/EUC/DCABES 2016: 553-556 - [c101]Younes Abid, Abdessamad Imine, Amedeo Napoli, Chedy Raïssi, Marc Rigolot, Michaël Rusinowitch:
Analyse d'activité et exposition de la vie privée sur les médias sociaux. EGC 2016: 545-546 - [c100]Mathieu Turuani, Thomas Voegtlin, Michaël Rusinowitch:
Automated Verification of Electrum Wallet. Financial Cryptography Workshops 2016: 27-42 - [c99]Hiep H. Nguyen, Abdessamad Imine, Michaël Rusinowitch:
Detecting Communities under Differential Privacy. WPES@CCS 2016: 83-93 - 2015
- [c98]Hiep H. Nguyen, Abdessamad Imine, Michaël Rusinowitch:
Differentially Private Publication of Social Graphs at Linear Cost. ASONAM 2015: 596-599 - [c97]Hiep H. Nguyen, Abdessamad Imine, Michaël Rusinowitch:
Anonymizing Social Graphs via Uncertainty Semantics. AsiaCCS 2015: 495-506 - [c96]Tushant Jha, Walid Belkhir, Yannick Chevalier, Michaël Rusinowitch:
Expressive Equivalence and Succinctness of Parametrized Automata with Respect to Finite Memory Automata. ICSOC Workshops 2015: 145-156 - 2014
- [c95]Walid Belkhir, Gisela Rossi, Michaël Rusinowitch:
A Parametrized Propositional Dynamic Logic with Application to Service Synthesis. Advances in Modal Logic 2014: 34-53 - [c94]Hiep H. Nguyen, Abdessamad Imine, Michaël Rusinowitch:
Enforcing Privacy in Decentralized Mobile Social Networks. ESSoS Doctoral Symposium 2014 - [c93]Hiep H. Nguyen, Abdessamad Imine, Michaël Rusinowitch:
A Maximum Variance Approach for Graph Anonymization. FPS 2014: 49-64 - [c92]Walid Belkhir, Yannick Chevalier, Michaël Rusinowitch:
An EXPTIME Algorithm for Data-Aware Service Simulation Using Parametrized Automata. ICSOC Workshops 2014: 295-307 - 2013
- [c91]Houari Mahfoud, Abdessamad Imine, Michaël Rusinowitch:
SVMAX: a system for secure and valid manipulation of XML data. IDEAS 2013: 154-161 - [c90]Florent Jacquemard, Michaël Rusinowitch:
Rewrite Closure and CF Hedge Automata. LATA 2013: 371-382 - [c89]Walid Belkhir, Yannick Chevalier, Michaël Rusinowitch:
Fresh-Variable Automata: Application to Service Composition. SYNASC 2013: 153-160 - 2012
- [c88]Siva Anantharaman, Serdar Erbatur, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Synchronous Distributivity. IJCAR 2012: 14-29 - [c87]Siva Anantharaman, Christopher Bouchard, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Chaining. LATA 2012: 70-82 - [c86]Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani:
Towards the Orchestration of Secured Services under Non-disclosure Policies. MMM-ACNS 2012: 130-145 - [c85]Alessandro Armando, Wihem Arsac, Tigran Avanesov, Michele Barletta, Alberto Calvi, Alessandro Cappai, Roberto Carbone, Yannick Chevalier, Luca Compagna, Jorge Cuéllar, Gabriel Erzse, Simone Frau, Marius Minea, Sebastian Mödersheim, David von Oheimb, Giancarlo Pellegrino, Serena Elisa Ponta, Marco Rocchetto, Michaël Rusinowitch, Mohammad Torabi Dashti, Mathieu Turuani, Luca Viganò:
The AVANTSSAR Platform for the Automated Validation of Trust and Security of Service-Oriented Architectures. TACAS 2012: 267-282 - [c84]Hatem Ghabri, Ghazi Maatoug, Michaël Rusinowitch:
Compiling symbolic attacks to protocol implementation tests. SCSS 2012: 39-49 - 2011
- [c83]Tigran Avanesov, Yannick Chevalier, Mohammed Anis Mekki, Michaël Rusinowitch:
Web Services Verification and Prudent Implementation. DPM/SETOP 2011: 173-189 - [c82]Tigran Avanesov, Yannick Chevalier, Mohammed Anis Mekki, Michaël Rusinowitch, Mathieu Turuani:
Distributed Orchestration of Web Services under Security Constraints. DPM/SETOP 2011: 235-252 - [c81]Jagdish Prasad Achara, Abdessamad Imine, Michaël Rusinowitch:
DeSCal - Decentralized Shared Calendar for P2P and Ad-Hoc Networks. ISPDC 2011: 223-231 - [c80]Asma Cherif, Abdessamad Imine, Michaël Rusinowitch:
Optimistic access control for distributed collaborative editors. SAC 2011: 861-868 - 2010
- [c79]Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Cap unification: application to protocol security modulo homomorphic encryption. AsiaCCS 2010: 192-203 - [c78]Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani:
Satisfiability of general intruder constraints with a set constructor. CRiSIS 2010: 1-8 - [c77]Yannick Chevalier, Mohammed Anis Mekki, Michaël Rusinowitch:
Orchestration under Security Constraints. FMCO 2010: 23-44 - [c76]Florent Jacquemard, Michaël Rusinowitch:
Rewrite-based verification of XML updates. PPDP 2010: 119-130 - [c75]Zeeshan Ahmed, Abdessamad Imine, Michaël Rusinowitch:
Safe and Efficient Strategies for Updating Firewall Policies. TrustBus 2010: 45-57 - 2009
- [c74]Enrica Nicolini, Christophe Ringeissen, Michaël Rusinowitch:
Combinable Extensions of Abelian Groups. CADE 2009: 51-66 - [c73]Najah Chridi, Mathieu Turuani, Michaël Rusinowitch:
Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists. CSF 2009: 277-289 - [c72]Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo Homomorphic Encryption. FroCoS 2009: 100-116 - [c71]Enrica Nicolini, Christophe Ringeissen, Michaël Rusinowitch:
Data Structures with Arithmetic Constraints: A Non-disjoint Combination. FroCoS 2009: 319-334 - [c70]Abdessamad Imine, Asma Cherif, Michaël Rusinowitch:
A Flexible Access Control Model for Distributed Collaborative Editors. Secure Data Management 2009: 89-106 - [c69]Enrica Nicolini, Christophe Ringeissen, Michaël Rusinowitch:
Satisfiability Procedures for Combination of Theories Sharing Integer Offsets. TACAS 2009: 428-442 - 2008
- [c68]Humberto J. Abdelnur, Tigran Avanesov, Michaël Rusinowitch, Radu State:
Abusing SIP Authentication. IAS 2008: 237-242 - [c67]Florent Jacquemard, Michaël Rusinowitch:
Closure of Hedge-Automata Languages by Hedge Rewriting. RTA 2008: 157-171 - [c66]Tarek Abbes, Adel Bouhoula, Michaël Rusinowitch:
An inference system for detecting firewall filtering rules anomalies. SAC 2008: 2122-2128 - [c65]Yannick Chevalier, Mohammed Anis Mekki, Michaël Rusinowitch:
Automatic Composition of Services with Security Policies. SERVICES I 2008: 529-537 - [c64]Siva Anantharaman, Hai Lin, Christopher Lynch, Paliath Narendran, Michaël Rusinowitch:
Unification modulo Homomorphic Encryption is Decidable. UNIF 2008: 1-15 - 2007
- [c63]Tarek Abbes, Adel Bouhoula, Michaël Rusinowitch:
A Traffic Classification Algorithm for Intrusion Detection. AINA Workshops (1) 2007: 188-193 - [c62]Abdessamad Imine, Michaël Rusinowitch:
Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms. Rewriting, Computation and Proof 2007: 213-234 - [c61]Yannick Chevalier, Denis Lugiez, Michaël Rusinowitch:
Towards an Automatic Analysis of Web Service Security. FroCoS 2007: 133-147 - [c60]Yannick Chevalier, Denis Lugiez, Michaël Rusinowitch:
Verifying Cryptographic Protocols with Subterms Constraints. LPAR 2007: 181-195 - [c59]Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
Intruders with Caps. RTA 2007: 20-35 - 2006
- [c58]Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron:
Tree Automata with Equality Constraints Modulo Equational Theories. IJCAR 2006: 557-571 - [c57]Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu:
Relating Two Standard Notions of Secrecy. CSL 2006: 303-318 - [c56]Eugen Zalinescu, Véronique Cortier, Michaël Rusinowitch:
Relating two standard notions of secrecy. Trustworthy Software 2006 - [c55]Yannick Chevalier, Michaël Rusinowitch:
Hierarchical Combination of Intruder Theories. RTA 2006: 108-122 - 2005
- [c54]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 - [c53]Abdessamad Imine, Pascal Molli, Gérald Oster, Michaël Rusinowitch:
Towards Synchronizing Linear Collaborative Objects with Operational Transformation. FORTE 2005: 411-427 - [c52]Yannick Chevalier, Michaël Rusinowitch:
Combining Intruder Theories. ICALP 2005: 639-651 - [c51]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 - 2004
- [c50]Abdessamad Imine, Pascal Molli, Gérald Oster, Michaël Rusinowitch:
Deductive Verification of Distributed Groupware Systems. AMAST 2004: 226-240 - [c49]Michaël Rusinowitch:
A Decidable Analysis of Security Protocols. IFIP TCS 2004: 21 - [c48]Tarek Abbes, Adel Bouhoula, Michaël Rusinowitch:
Protocol Analysis in Intrusion Detection Using Decision Tree. ITCC (1) 2004: 404-408 - [c47]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
Deciding the Security of Protocols with Commuting Public Key Encryption. ARSPA@IJCAR 2004: 55-66 - 2003
- [c46]Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
Unification Modulo ACU I Plus Homomorphisms/Distributivity. CADE 2003: 442-457 - [c45]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 - [c44]Abdessamad Imine, Pascal Molli, Gérald Oster, Michaël Rusinowitch:
Proving Correctness of Transformation Functions in Real-Time Groupware. ECSCW 2003: 277-293 - [c43]Julien Musset, Michaël Rusinowitch:
Computing Meta-transitions for Linear Transition Systems with Polynomials. FME 2003: 562-581 - [c42]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 - [c41]Yannick Chevalier, Ralf Küsters, Michaël Rusinowitch, Mathieu Turuani:
An NP Decision Procedure for Protocol Insecurity with XOR. LICS 2003: 261-270 - [c40]Siva Anantharaman, Paliath Narendran, Michaël Rusinowitch:
ACID-Unification Is NEXPTIME-Decidable. MFCS 2003: 169-178 - [c39]Michaël Rusinowitch:
Automated analysis of security protocols. WFLP 2003: 12-15 - 2002
- [c38]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 - 2001
- [c37]Michaël Rusinowitch, Mathieu Turuani:
Protocol Insecurity with Finite Number of Sessions is NP-Complete. CSFW 2001: 174-187 - [c36]Alessandro Armando, Silvio Ranise, Michaël Rusinowitch:
Uniform Derivation of Decision Procedures by Superposition. CSL 2001: 513-527 - [c35]Michaël Rusinowitch:
Rewriting for Deduction and Verification. RTA 2001: 2 - [c34]Michaël Rusinowitch:
The practice of cryptographic protocol verification. LACPV@CAV 2001: 3-4 - 2000
- [c33]Michaël Rusinowitch, Sorin Stratulat, Francis Klay:
Mechanical Verification of an Ideal Incremental ABR Conformance. CAV 2000: 344-357 - [c32]Paliath Narendran, Michaël Rusinowitch:
The Theory of Total Unary RPO Is Decidable. Computational Logic 2000: 660-672 - [c31]Florent Jacquemard, Michaël Rusinowitch, Laurent Vigneron:
Compiling and Verifying Security Protocols. LPAR 2000: 131-160 - 1999
- [c30]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
- [c29]Paliath Narendran, Michaël Rusinowitch, Rakesh M. Verma:
RPO Constraint Solving Is in NP. CSL 1998: 385-398 - [c28]Narjes Berregeb, Adel Bouhoula, Michaël Rusinowitch:
Observational Proofs with Critical Contexts. FASE 1998: 38-53 - [c27]Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch:
Decision Problems in Ordered Rewriting. LICS 1998: 276-286 - [c26]Rakesh M. Verma, Michaël Rusinowitch, Denis Lugiez:
Algorithms and Reductions for Rewriting Problems. RTA 1998: 166-180 - 1996
- [c25]Narjes Berregeb, Adel Bouhoula, Michaël Rusinowitch:
Automated Verification by Induction with Associative-Commutative Operators. CAV 1996: 220-231 - [c24]Narjes Berregeb, Adel Bouhoula, Michaël Rusinowitch:
SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories. RTA 1996: 428-431 - [c23]Éric Monfroy, Michaël Rusinowitch, René Schott:
Implementing non-linear constraints with cooperative solvers. SAC 1996: 63-72 - 1995
- [c22]Adel Bouhoula, Michaël Rusinowitch:
SPIKE: A System for Automatic Inductive Proofs. AMAST 1995: 576-577 - [c21]Gregory Kucherov, Michaël Rusinowitch:
Matching a Set of Strings with Variable Length Don't Cares. CPM 1995: 230-247 - 1994
- [c20]Gregory Kucherov, Michaël Rusinowitch:
The Complexity of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables. CTRS 1994: 262-275 - [c19]Gregory Kucherov, Michaël Rusinowitch:
On ground reducibility problem for word rewriting systems with variables. SAC 1994: 271-276 - 1993
- [c18]Adel Bouhoula, Michaël Rusinowitch:
Automatic Case Analysis in Proof by Induction. IJCAI 1993: 88-94 - [c17]Paliath Narendran, Michaël Rusinowitch:
The Unifiability Problem in Ground AC Theories. LICS 1993: 364-370 - 1992
- [c16]Adel Bouhoula, Emmanuel Kounalis, Michaël Rusinowitch:
SPIKE, an Automatic Theorem Prover. LPAR 1992: 460-462 - 1991
- [c15]Emmanuel Kounalis, Michaël Rusinowitch:
Studies on the Ground Convergence Property of Conditional Theories. AMAST 1991: 363-376 - [c14]Michaël Rusinowitch, Laurent Vigneron:
Automated deduction with associative commutative operators. FAIR 1991: 185-199 - [c13]Emmanuel Kounalis, Michaël Rusinowitch:
Automatic Proof Methods for Algebraic Specifications. FCT 1991: 307-317 - [c12]Paliath Narendran, Michaël Rusinowitch:
Any Gound Associative-Commutative Theory Has a Finite Canonical System. RTA 1991: 423-434 - 1990
- [c11]Emmanuel Kounalis, Michaël Rusinowitch:
Mechanizing Inductive Reasoning. AAAI 1990: 240-245 - [c10]Emmanuel Kounalis, Michaël Rusinowitch:
A Proof System for Conditional Algebraic Specifications. CTRS 1990: 51-63 - [c9]Béchir el Ayeb, Pierre Marquis, Michaël Rusinowitch:
Deductive/Abductvie Diagnosis: The DA-Principles. ECAI 1990: 47-52 - [c8]Béchir el Ayeb, Pierre Marquis, Michaël Rusinowitch:
A New Diagnosis Approach by Deduction and Abduction. Expert Systems in Engineering 1990: 32-46 - 1988
- [c7]Emmanuel Kounalis, Michaël Rusinowitch:
On Word Problems in Horn Theories. CADE 1988: 527-537 - [c6]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
- [c5]Emmanuel Kounalis, Michaël Rusinowitch:
On Word Problems in Horn Theories. CTRS 1987: 144-160 - [c4]Jieh Hsiang, Michaël Rusinowitch:
On Word Problems in Equational Theories. ICALP 1987: 54-71 - [c3]Jieh Hsiang, Michaël Rusinowitch, Kô Sakai:
Complete Inference Rules for the Cancellation Laws. IJCAI 1987: 990-992 - 1986
- [c2]Jieh Hsiang, Michaël Rusinowitch:
A New Method for Establishing Refutational Completeness in Theorem Proving. CADE 1986: 141-152 - 1985
- [c1]Michaël Rusinowitch:
Path of Subterms Ordering and Recursive Decomposition Ordering Revisited. RTA 1985: 225-240
Parts in Books or Collections
- 2011
- [p1]Michaël Rusinowitch, Mathieu Turuani:
Verifying a bounded number of sessions and its complexity. Formal Models and Techniques for Analyzing Security Protocols 2011: 13-34
Editorship
- 2017
- [e6]Mohamed Mosbah, Michaël Rusinowitch:
SCSS 2017, The 8th International Symposium on Symbolic Computation in Software Science 2017, April 6-9, 2017, Gammarth, Tunisia. EPiC Series in Computing 45, EasyChair 2017 [contents] - 2016
- [e5]Rakesh M. Verma, Michaël Rusinowitch:
Proceedings of the 2016 ACM on International Workshop on Security And Privacy Analytics, IWSPA@CODASPY 2016, New Orleans, LA, USA, March 11, 2016. ACM 2016, ISBN 978-1-4503-4077-9 [contents] - 2008
- [e4]Anca Muscholl, Ramaswamy Ramanujam, Michaël Rusinowitch, Thomas Schwentick, Victor Vianu:
Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04. - 25.04.2008. Dagstuhl Seminar Proceedings 08171, Schloss Dagstuhl - Leibniz-Zentrum für Informatik, Germany 2008 [contents] - 2004
- [e3]David A. Basin, Michaël Rusinowitch:
Automated Reasoning - Second International Joint Conference, IJCAR 2004, Cork, Ireland, July 4-8, 2004, Proceedings. Lecture Notes in Computer Science 3097, Springer 2004, ISBN 3-540-22345-2 [contents] - 1999
- [e2]Paliath Narendran, Michaël Rusinowitch:
Rewriting Techniques and Applications, 10th International Conference, RTA-99, Trento, Italy, July 2-4, 1999, Proceedings. Lecture Notes in Computer Science 1631, Springer 1999, ISBN 3-540-66201-4 [contents] - 1993
- [e1]Michaël Rusinowitch, Jean-Luc Rémy:
Conditional Term Rewriting Systems, Third International Workshop, CTRS-92, Pont-à-Mousson, France, July 8-10, 1992, Proceedings. Lecture Notes in Computer Science 656, Springer 1993, ISBN 3-540-56393-8 [contents]
Informal and Other Publications
- 2016
- [i14]Hiep H. Nguyen, Abdessamad Imine, Michaël Rusinowitch:
Detecting Communities under Differential Privacy. CoRR abs/1607.02060 (2016) - [i13]Hiep H. Nguyen, Abdessamad Imine, Michaël Rusinowitch:
Private Link Exchange over Social Graphs. CoRR abs/1609.01616 (2016) - 2014
- [i12]Hiep H. Nguyen, Abdessamad Imine, Michaël Rusinowitch:
Anonymizing Social Graphs via Uncertainty Semantics. CoRR abs/1408.1209 (2014) - 2013
- [i11]Walid Belkhir, Yannick Chevalier, Michaël Rusinowitch:
Fresh-Variable Automata for Service Composition. CoRR abs/1302.4205 (2013) - [i10]Walid Belkhir, Yannick Chevalier, Michaël Rusinowitch:
Guarded Variable Automata over Infinite Alphabets. CoRR abs/1304.6297 (2013) - [i9]Abdessamad Imine, Michaël Rusinowitch:
Secure Collaboration for Smartphones. ERCIM News 2013(93) (2013) - 2012
- [i8]Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani:
Intruder deducibility constraints with negation. Decidability and application to secured service compositions. CoRR abs/1207.4871 (2012) - [i7]Florent Jacquemard, Michaël Rusinowitch:
Rewrite Closure and CF Hedge Automata. CoRR abs/1212.5108 (2012) - 2011
- [i6]Tigran Avanesov, Yannick Chevalier, Michaël Rusinowitch, Mathieu Turuani:
Satisfiability of General Intruder Constraints with and without a Set Constructor. CoRR abs/1103.0220 (2011) - 2009
- [i5]Florent Jacquemard, Michaël Rusinowitch:
Rewrite based Verification of XML Updates. CoRR abs/0907.5125 (2009) - [i4]Yannick Chevalier, Michaël Rusinowitch:
Compiling and securing cryptographic protocols. CoRR abs/0910.5099 (2009) - 2008
- [i3]Anca Muscholl, Ramaswamy Ramanujam, Michaël Rusinowitch, Thomas Schwentick, Victor Vianu:
08171 Abstracts Collection - Beyond the Finite: New Challenges in Verification and Semistructured Data. Beyond the Finite: New Challenges in Verification and Semistructured Data 2008 - [i2]Anca Muscholl, Ramaswamy Ramanujam, Michaël Rusinowitch, Thomas Schwentick, Victor Vianu:
08171 Summary - Beyond the Finite: New Challenges in Verification and Semistructured Data. Beyond the Finite: New Challenges in Verification and Semistructured Data 2008 - 2007
- [i1]Véronique Cortier, Michaël Rusinowitch, Eugen Zalinescu:
Relating two standard notions of secrecy. CoRR abs/0706.0502 (2007)
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-07 20:32 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
