Michaël Rusinowitch

According to our database1, Michaël Rusinowitch authored at least 172 papers between 1985 and 2019.

Collaborative distances:

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Other 

Links

Homepage:

On csauthors.net:

Bibliography

2019
One-variable context-free hedge automata.
J. Comput. Syst. Sci., 2019

Gender Inference for Facebook Picture Owners.
Proceedings of the Trust, Privacy and Security in Digital Business, 2019

Unification Modulo Lists with Reverse Relation with Certain Word Equations.
Proceedings of the Automated Deduction - CADE 27, 2019

2018
Sensitive Attribute Prediction for Social Networks Users.
Proceedings of the Workshops of the EDBT/ICDT 2018 Joint Conference (EDBT/ICDT 2018), 2018

Online Testing of User Profile Resilience Against Inference Attacks in Social Networks.
Proceedings of the New Trends in Databases and Information Systems, 2018

2017
Satisfiability of general intruder constraints with and without a set constructor.
J. Symb. Comput., 2017

Intruder deducibility constraints with negation. Decidability and application to secured service compositions.
J. Symb. Comput., 2017

Two-Phase Preference Disclosure in Attributed Social Networks.
Proceedings of the Database and Expert Systems Applications, 2017

2016
Network Structure Release under Differential Privacy.
Transactions on Data Privacy, 2016

Detection of firewall configuration errors with updatable tree.
Int. J. Inf. Sec., 2016

Private Link Exchange over Social Graphs.
CoRR, 2016

Detecting Communities under Differential Privacy.
CoRR, 2016

Detecting Communities under Differential Privacy.
Proceedings of the 2016 ACM on Workshop on Privacy in the Electronic Society, 2016

Automated Verification of Electrum Wallet.
Proceedings of the Financial Cryptography and Data Security, 2016

Analyse d'activité et exposition de la vie privée sur les médias sociaux.
Proceedings of the 16ème Journées Francophones Extraction et Gestion des Connaissances, 2016

A Model-Based Testing Approach for Security Protocols.
Proceedings of the 2016 IEEE Intl Conference on Computational Science and Engineering, 2016

Online Link Disclosure Strategies for Social Networks.
Proceedings of the Risks and Security of Internet and Systems, 2016

2015
Model-based mutation testing from security protocols in HLPSL.
Softw. Test., Verif. Reliab., 2015

Parametrized automata simulation and application to service composition.
J. Symb. Comput., 2015

Expressive Equivalence and Succinctness of Parametrized Automata with Respect to Finite Memory Automata.
Proceedings of the Service-Oriented Computing - ICSOC 2015 Workshops, 2015

Anonymizing Social Graphs via Uncertainty Semantics.
Proceedings of the 10th ACM Symposium on Information, 2015

Differentially Private Publication of Social Graphs at Linear Cost.
Proceedings of the 2015 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining, 2015

2014
Practical access control management for distributed collaborative editors.
Pervasive and Mobile Computing, 2014

Anonymizing Social Graphs via Uncertainty Semantics.
CoRR, 2014

Unification modulo a 2-sorted Equational theory for Cipher-Decipher Block Chaining.
Logical Methods in Computer Science, 2014

An EXPTIME Algorithm for Data-Aware Service Simulation Using Parametrized Automata.
Proceedings of the Service-Oriented Computing - ICSOC 2014 Workshops, 2014

A Maximum Variance Approach for Graph Anonymization.
Proceedings of the Foundations and Practice of Security - 7th International Symposium, 2014

Enforcing Privacy in Decentralized Mobile Social Networks.
Proceedings of the 2014 ESSoS Doctoral Symposium co-located with the International Symposium on Engineering Secure Software and Systems (ESSoS 2014), 2014

A Parametrized Propositional Dynamic Logic with Application to Service Synthesis.
Proceedings of the Advances in Modal Logic 10, 2014

2013
Secure Collaboration for Smartphones.
ERCIM News, 2013

Guarded Variable Automata over Infinite Alphabets
CoRR, 2013

Fresh-Variable Automata for Service Composition
CoRR, 2013

Fresh-Variable Automata: Application to Service Composition.
Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

Rewrite Closure and CF Hedge Automata.
Proceedings of the Language and Automata Theory and Applications, 2013

SVMAX: a system for secure and valid manipulation of XML data.
Proceedings of the 17th International Database Engineering & Applications Symposium, 2013

2012
Decidability of Equivalence of Symbolic Derivations.
J. Autom. Reasoning, 2012

Unification Modulo Homomorphic Encryption.
J. Autom. Reasoning, 2012

Rewrite Closure and CF Hedge Automata
CoRR, 2012

Intruder deducibility constraints with negation. Decidability and application to secured service compositions
CoRR, 2012

Compiling symbolic attacks to protocol implementation tests.
Proceedings of the Proceedings Fourth International Symposium on Symbolic Computation in Software Science, 2012

The AVANTSSAR Platform for the Automated Validation of Trust and Security of Service-Oriented Architectures.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Towards the Orchestration of Secured Services under Non-disclosure Policies.
Proceedings of the Computer Network Security, 2012

Unification Modulo Chaining.
Proceedings of the Language and Automata Theory and Applications, 2012

Unification Modulo Synchronous Distributivity.
Proceedings of the Automated Reasoning - 6th International Joint Conference, 2012

2011
String Rewriting and Security Analysis: An Extension of a Result of Book and Otto.
Journal of Automata, Languages and Combinatorics, 2011

Satisfiability of General Intruder Constraints with and without a Set Constructor
CoRR, 2011

Optimistic access control for distributed collaborative editors.
Proceedings of the 2011 ACM Symposium on Applied Computing (SAC), TaiChung, Taiwan, March 21, 2011

DeSCal - Decentralized Shared Calendar for P2P and Ad-Hoc Networks.
Proceedings of the 10th International Symposium on Parallel and Distributed Computing, 2011

Distributed Orchestration of Web Services under Security Constraints.
Proceedings of the Data Privacy Management and Autonomous Spontaneus Security, 2011

Web Services Verification and Prudent Implementation.
Proceedings of the Data Privacy Management and Autonomous Spontaneus Security, 2011

2010
Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures.
Theor. Comput. Sci., 2010

Compiling and securing cryptographic protocols.
Inf. Process. Lett., 2010

Efficient decision tree for protocol analysis in intrusion detection.
IJSN, 2010

Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator.
Fundam. Inform., 2010

Safe and Efficient Strategies for Updating Firewall Policies.
Proceedings of the Trust, 2010

Rewrite-based verification of XML updates.
Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2010

Orchestration under Security Constraints.
Proceedings of the Formal Methods for Components and Objects - 9th International Symposium, 2010

Satisfiability of general intruder constraints with a set constructor.
Proceedings of the CRiSIS 2010, 2010

Cap unification: application to protocol security modulo homomorphic encryption.
Proceedings of the 5th ACM Symposium on Information, 2010

2009
Compiling and securing cryptographic protocols
CoRR, 2009

Rewrite based Verification of XML Updates
CoRR, 2009

Satisfiability Procedures for Combination of Theories Sharing Integer Offsets.
Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2009

A Flexible Access Control Model for Distributed Collaborative Editors.
Proceedings of the Secure Data Management, 6th VLDB Workshop, 2009

Data Structures with Arithmetic Constraints: A Non-disjoint Combination.
Proceedings of the Frontiers of Combining Systems, 7th International Symposium, 2009

Unification Modulo Homomorphic Encryption.
Proceedings of the Frontiers of Combining Systems, 7th International Symposium, 2009

Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists.
Proceedings of the 22nd IEEE Computer Security Foundations Symposium, 2009

Combinable Extensions of Abelian Groups.
Proceedings of the Automated Deduction, 2009

2008
Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption.
ACM Trans. Comput. Log., 2008

Tree automata with equality constraints modulo equational theories.
J. Log. Algebr. Program., 2008

Hierarchical combination of intruder theories.
Inf. Comput., 2008

Automatic Composition of Services with Security Policies.
Proceedings of the 2008 IEEE Congress on Services, Part I, 2008

An inference system for detecting firewall filtering rules anomalies.
Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

Closure of Hedge-Automata Languages by Hedge Rewriting.
Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

08171 Summary - Beyond the Finite: New Challenges in Verification and Semistructured Data.
Proceedings of the Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04., 2008

08171 Abstracts Collection - Beyond the Finite: New Challenges in Verification and Semistructured Data.
Proceedings of the Beyond the Finite: New Challenges in Verification and Semistructured Data, 20.04., 2008

Abusing SIP Authentication.
Proceedings of the Proccedings of the Fourth International Conference on Information Assurance and Security, 2008

2007
Relating two standard notions of secrecy.
Logical Methods in Computer Science, 2007

Relating two standard notions of secrecy
CoRR, 2007

Intruders with Caps.
Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

Verifying Cryptographic Protocols with Subterms Constraints.
Proceedings of the Logic for Programming, 2007

Towards an Automatic Analysis of Web Service Security.
Proceedings of the Frontiers of Combining Systems, 6th International Symposium, 2007

Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms.
Proceedings of the Rewriting, 2007

A Traffic Classification Algorithm for Intrusion Detection.
Proceedings of the 21st International Conference on Advanced Information Networking and Applications (AINA 2007), 2007

2006
Formal design and verification of operational transformation algorithms for copies convergence.
Theor. Comput. Sci., 2006

Automated Reasoning for Security Protocol Analysis.
J. Autom. Reasoning, 2006

Editorial.
Journal of Automata, Languages and Combinatorics, 2006

Hierarchical Combination of Intruder Theories.
Proceedings of the Term Rewriting and Applications, 17th International Conference, 2006

Relating Two Standard Notions of Secrecy.
Proceedings of the Computer Science Logic, 20th International Workshop, 2006

Tree Automata with Equality Constraints Modulo Equational Theories.
Proceedings of the Automated Reasoning, Third International Joint Conference, 2006

2005
An NP decision procedure for protocol insecurity with XOR.
Theor. Comput. Sci., 2005

Closure properties and decision problems of dag automata.
Inf. Process. Lett., 2005

Deciding the Security of Protocols with Commuting Public Key Encryption.
Electr. Notes Theor. Comput. Sci., 2005

A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures.
Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2005

Combining Intruder Theories.
Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Towards Synchronizing Linear Collaborative Objects with Operational Transformation.
Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications.
Proceedings of the Computer Aided Verification, 17th International Conference, 2005

2004
Éditorial.
Technique et Science Informatiques, 2004

2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword.
Theory Comput. Syst., 2004

Unification Modulo ACUI Plus Distributivity Axioms.
J. Autom. Reasoning, 2004

On the fly pattern matching for intrusion detection with Snort.
Annales des Télécommunications, 2004

Protocol Analysis in Intrusion Detection Using Decision Tree.
Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04), 2004

A Decidable Analysis of Security Protocols.
Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Deductive Verification of Distributed Groupware Systems.
Proceedings of the Algebraic Methodology and Software Technology, 2004

2003
Deciding the confluence of ordered term rewrite systems.
ACM Trans. Comput. Log., 2003

Protocol insecurity with a finite number of sessions, composed keys is NP-complete.
Theor. Comput. Sci., 2003

Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm.
J. Autom. Reasoning, 2003

A rewriting approach to satisfiability procedures.
Inf. Comput., 2003

Automated analysis of security protocols.
Electr. Notes Theor. Comput. Sci., 2003

ACID-Unification Is NEXPTIME-Decidable.
Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

An NP Decision Procedure for Protocol Insecurity with XOR.
Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents.
Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Computing Meta-transitions for Linear Transition Systems with Polynomials.
Proceedings of the FME 2003: Formal Methods, 2003

Proving Correctness of Transformation Functions in Real-Time Groupware.
Proceedings of the Eighth European Conference on Computer Supported Cooperative Work, 2003

Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions.
Proceedings of the Computer Science Logic, 17th International Workshop, 2003

Unification Modulo ACU I Plus Homomorphisms/Distributivity.
Proceedings of the Automated Deduction - CADE-19, 19th International Conference on Automated Deduction Miami Beach, FL, USA, July 28, 2003

2002
Observational proofs by rewriting.
Theor. Comput. Sci., 2002

Incorporating Decision Procedures in Implicit Induction.
J. Symb. Comput., 2002

Guest Editorial.
Inf. Comput., 2002

The AVISS Security Protocol Analysis Tool.
Proceedings of the Computer Aided Verification, 14th International Conference, 2002

2001
Algorithms and Reductions for Rewriting Problems.
Fundam. Inform., 2001

The practice of cryptographic protocol verification.
Electr. Notes Theor. Comput. Sci., 2001

Rewriting for Deduction and Verification.
Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

Uniform Derivation of Decision Procedures by Superposition.
Proceedings of the Computer Science Logic, 15th International Workshop, 2001

Protocol Insecurity with Finite Number of Sessions is NP-Complete.
Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 2001

2000
Compiling and Verifying Security Protocols.
Proceedings of the Logic for Programming and Automated Reasoning, 2000

The Theory of Total Unary RPO Is Decidable.
Proceedings of the Computational Logic, 2000

Mechanical Verification of an Ideal Incremental ABR Conformance.
Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999
Patterns in Words versus Patterns in Trees: A Brief Survey and New Results.
Proceedings of the Perspectives of System Informatics, 1999

1998
Algorithms and Reductions for Rewriting Problems.
Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

Decision Problems in Ordered Rewriting.
Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

Observational Proofs with Critical Contexts.
Proceedings of the Fundamental Approaches to Software Engineering, 1998

RPO Constraint Solving Is in NP.
Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1997
Matching a Set of Strings with Variable Length don't Cares.
Theor. Comput. Sci., 1997

1996
Any Ground Associative-Commutative Theory Has a Finite Canonical System.
J. Autom. Reasoning, 1996

Implementing non-linear constraints with cooperative solvers.
Proceedings of the 1996 ACM Symposium on Applied Computing, 1996

SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories.
Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

Automated Verification by Induction with Associative-Commutative Operators.
Proceedings of the Computer Aided Verification, 8th International Conference, 1996

1995
Automated Mathematical Induction.
J. Log. Comput., 1995

Implicit Induction in Conditional Theories.
J. Autom. Reasoning, 1995

Undecidability of Ground Reducibility for Word Rewriting Systems with Variables.
Inf. Process. Lett., 1995

Reasoning with Conditional Axioms.
Ann. Math. Artif. Intell., 1995

Automated deduction with associative-commutative operators.
Appl. Algebra Eng. Commun. Comput., 1995

Matching a Set of Strings with Variable Length Don't Cares.
Proceedings of the Combinatorial Pattern Matching, 6th Annual Symposium, 1995

SPIKE: A System for Automatic Inductive Proofs.
Proceedings of the Algebraic Methodology and Software Technology, 1995

1994
On ground reducibility problem for word rewriting systems with variables.
Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

The Complexitiy of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables.
Proceedings of the Conditional and Typed Rewriting Systems, 4th International Workshop, 1994

1993
Preferring diagnoses by abduction.
IEEE Trans. Systems, Man, and Cybernetics, 1993

A Logical Framework for Concept Learning with Background Knowledge.
International Journal on Artificial Intelligence Tools, 1993

The Unifiability Problem in Ground AC Theories
Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

Automatic Case Analysis in Proof by Induction.
Proceedings of the 13th International Joint Conference on Artificial Intelligence. Chambéry, France, August 28, 1993

1992
The Term Rewriting Approach to Automated Theorem Proving.
J. Log. Program., 1992

SPIKE, an Automatic Theorem Prover.
Proceedings of the Logic Programming and Automated Reasoning, 1992

1991
Theorem-Proving with Resolution and Superposition.
J. Symb. Comput., 1991

On Word Problems in Horn Theories.
J. Symb. Comput., 1991

Proving Refutational Completeness of Theorem-Proving Strategies: The Transfinite Semantic Tree Method.
J. ACM, 1991

Any Gound Associative-Commutative Theory Has a Finite Canonical System.
Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

Automatic Proof Methods for Algebraic Specifications.
Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

Automated deduction with associative commutative operators.
Proceedings of the Fundamentals of Artificial Intelligence Research, 1991

Studies on the Ground Convergence Property of Conditional Theories.
Proceedings of the Algebraic Methodology and Software Technology (AMAST '91), 1991

1990
Mechanizing inductive reasoning.
Bulletin of the EATCS, 1990

A New Diagnosis Approach by Deduction and Abduction.
Proceedings of the Expert Systems in Engineering, 1990

Deductive/Abductvie Diagnosis: The DA-Principles.
Proceedings of the 9th European Conference on Artificial Intelligence, 1990

A Proof System for Conditional Algebraic Specifications.
Proceedings of the Conditional and Typed Rewriting Systems, 1990

Mechanizing Inductive Reasoning.
Proceedings of the 8th National Conference on Artificial Intelligence. Boston, Massachusetts, USA, July 29, 1990

1988
Theorem-Proving with Resolution and Superposition: An Extension of the Knuth and Bendic Procedure to a Complete Set of Inference Rules.
Proceedings of the International Conference on Fifth Generation Computer Systems, 1988

On Word Problems in Horn Theories.
Proceedings of the 9th International Conference on Automated Deduction, 1988

1987
Path of Subterms Ordering and Recursive Decomposition Ordering Revisited.
J. Symb. Comput., 1987

On Termination of the Direct Sum of Term-Rewriting Systems.
Inf. Process. Lett., 1987

Complete Inference Rules for the Cancellation Laws.
Proceedings of the 10th International Joint Conference on Artificial Intelligence. Milan, 1987

On Word Problems in Equational Theories.
Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986
A New Method for Establishing Refutational Completeness in Theorem Proving.
Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

1985
Path of Subterms Ordering and Recursive Decomposition Ordering Revisited.
Proceedings of the Rewriting Techniques and Applications, First International Conference, 1985


  Loading...