Michaël Rusinowitch

Gisela Rossi

Proceedings of the Advances in Modal Logic 10, 2014

2013

Secure Collaboration for Smartphones.

[BibT_eX]

[DOI]

ERCIM News, 2013

Guarded Variable Automata over Infinite Alphabets

[BibT_eX]

[DOI]

CoRR, 2013

Fresh-Variable Automata for Service Composition

[BibT_eX]

[DOI]

CoRR, 2013

Fresh-Variable Automata: Application to Service Composition.

[BibT_eX]

[DOI]

Proceedings of the 15th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, 2013

Rewrite Closure and CF Hedge Automata.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2013

SVMAX: a system for secure and valid manipulation of XML data.

[BibT_eX]

[DOI]

Houari Mahfoud

Proceedings of the 17th International Database Engineering & Applications Symposium, 2013

2012

Decidability of Equivalence of Symbolic Derivations.

[BibT_eX]

[DOI]

J. Autom. Reason., 2012

Unification Modulo Homomorphic Encryption.

[BibT_eX]

[DOI]

J. Autom. Reason., 2012

Compiling symbolic attacks to protocol implementation tests.

[BibT_eX]

[DOI]

Hatem Ghabri

Ghazi Maatoug

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.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2012

Towards the Orchestration of Secured Services under Non-disclosure Policies.

[BibT_eX]

[DOI]

Proceedings of the Computer Network Security, 2012

Unification Modulo Chaining.

[BibT_eX]

[DOI]

Proceedings of the Language and Automata Theory and Applications, 2012

Unification Modulo Synchronous Distributivity.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2011

Optimistic access control for distributed collaborative editors.

[BibT_eX]

[DOI]

Asma Cherif

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.

[BibT_eX]

[DOI]

Jagdish Prasad Achara

Proceedings of the 10th International Symposium on Parallel and Distributed Computing, 2011

Distributed Orchestration of Web Services under Security Constraints.

[BibT_eX]

[DOI]

Proceedings of the Data Privacy Management and Autonomous Spontaneus Security, 2011

Web Services Verification and Prudent Implementation.

[BibT_eX]

[DOI]

Proceedings of the Data Privacy Management and Autonomous Spontaneus Security, 2011

Verifying a bounded number of sessions and its complexity.

[BibT_eX]

[DOI]

Proceedings of the Formal Models and Techniques for Analyzing Security Protocols, 2011

2010

Symbolic protocol analysis in the union of disjoint intruder theories: Combining decision procedures.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2010

Compiling and securing cryptographic protocols.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2010

Efficient decision tree for protocol analysis in intrusion detection.

[BibT_eX]

[DOI]

Int. J. Secur. Networks, 2010

Combining Satisfiability Procedures for Unions of Theories with a Shared Counting Operator.

[BibT_eX]

[DOI]

Fundam. Informaticae, 2010

Safe and Efficient Strategies for Updating Firewall Policies.

[BibT_eX]

[DOI]

Zeeshan Ahmed

Proceedings of the Trust, 2010

Rewrite-based verification of XML updates.

[BibT_eX]

[DOI]

Proceedings of the 12th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2010

Orchestration under Security Constraints.

[BibT_eX]

[DOI]

Mohammed Anis Mekki

Proceedings of the Formal Methods for Components and Objects - 9th International Symposium, 2010

Satisfiability of general intruder constraints with a set constructor.

[BibT_eX]

[DOI]

Proceedings of the CRiSIS 2010, 2010

Cap unification: application to protocol security modulo homomorphic encryption.

[BibT_eX]

[DOI]

Proceedings of the 5th ACM Symposium on Information, 2010

2009

Satisfiability Procedures for Combination of Theories Sharing Integer Offsets.

[BibT_eX]

[DOI]

Proceedings of the Tools and Algorithms for the Construction and Analysis of Systems, 2009

A Flexible Access Control Model for Distributed Collaborative Editors.

[BibT_eX]

[DOI]

Asma Cherif

Proceedings of the Secure Data Management, 6th VLDB Workshop, 2009

Data Structures with Arithmetic Constraints: A Non-disjoint Combination.

[BibT_eX]

[DOI]

Proceedings of the Frontiers of Combining Systems, 7th International Symposium, 2009

Decidable Analysis for a Class of Cryptographic Group Protocols with Unbounded Lists.

[BibT_eX]

[DOI]

Najah Chridi

Proceedings of the 22nd IEEE Computer Security Foundations Symposium, 2009

Combinable Extensions of Abelian Groups.

[BibT_eX]

[DOI]

Proceedings of the Automated Deduction, 2009

2008

Complexity results for security protocols with Diffie-Hellman exponentiation and commuting public key encryption.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2008

Tree automata with equality constraints modulo equational theories.

[BibT_eX]

[DOI]

Laurent Vigneron

J. Log. Algebraic Methods Program., 2008

Hierarchical combination of intruder theories.

[BibT_eX]

[DOI]

Inf. Comput., 2008

Unification modulo Homomorphic Encryption is Decidable.

[BibT_eX]

[DOI]

Proceedings of the 22nd International Workshop on Unification, 2008

Automatic Composition of Services with Security Policies.

[BibT_eX]

[DOI]

Mohammed Anis Mekki

Proceedings of the 2008 IEEE Congress on Services, Part I, 2008

An inference system for detecting firewall filtering rules anomalies.

[BibT_eX]

[DOI]

Proceedings of the 2008 ACM Symposium on Applied Computing (SAC), 2008

Closure of Hedge-Automata Languages by Hedge Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 19th International Conference, 2008

08171 Summary - Beyond the Finite: New Challenges in Verification and Semistructured Data.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

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

Abusing SIP Authentication.

[BibT_eX]

[DOI]

Proceedings of the Proccedings of the Fourth International Conference on Information Assurance and Security, 2008

2007

Relating two standard notions of secrecy.

[BibT_eX]

[DOI]

Véronique Cortier

Eugen Zalinescu

Log. Methods Comput. Sci., 2007

Intruders with Caps.

[BibT_eX]

[DOI]

Proceedings of the Term Rewriting and Applications, 18th International Conference, 2007

Verifying Cryptographic Protocols with Subterms Constraints.

[BibT_eX]

[DOI]

Denis Lugiez

Proceedings of the Logic for Programming, 2007

Towards an Automatic Analysis of Web Service Security.

[BibT_eX]

[DOI]

Denis Lugiez

Proceedings of the Frontiers of Combining Systems, 6th International Symposium, 2007

Applying a Theorem Prover to the Verification of Optimistic Replication Algorithms.

[BibT_eX]

[DOI]

Proceedings of the Rewriting, 2007

A Traffic Classification Algorithm for Intrusion Detection.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2006

Automated Reasoning for Security Protocol Analysis.

[BibT_eX]

[DOI]

J. Autom. Reason., 2006

Editorial.

[BibT_eX]

[DOI]

J. Autom. Lang. Comb., 2006

2005

An NP decision procedure for protocol insecurity with XOR.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2005

Closure properties and decision problems of dag automata.

[BibT_eX]

[DOI]

Inf. Process. Lett., 2005

A resolution strategy for verifying cryptographic protocols with CBC encryption and blind signatures.

[BibT_eX]

[DOI]

Véronique Cortier

Eugen Zalinescu

Proceedings of the 7th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, 2005

Combining Intruder Theories.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 32nd International Colloquium, 2005

Towards Synchronizing Linear Collaborative Objects with Operational Transformation.

[BibT_eX]

[DOI]

Proceedings of the Formal Techniques for Networked and Distributed Systems, 2005

The AVISPA Tool for the Automated Validation of Internet Security Protocols and Applications.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 17th International Conference, 2005

2004

Éditorial.

[BibT_eX]

[DOI]

Tech. Sci. Informatiques, 2004

2nd International Workshop on Complexity in Automated Deduction (CiAD) - Foreword.

[BibT_eX]

[DOI]

Georg Gottlob

Miki Hermann

Theory Comput. Syst., 2004

Unification Modulo ACUI Plus Distributivity Axioms.

[BibT_eX]

[DOI]

J. Autom. Reason., 2004

Deciding the Security of Protocols with Commuting Public Key Encryption.

[BibT_eX]

[DOI]

Proceedings of the Workshop on Automated Reasoning for Security Protocol Analysis, 2004

On the fly pattern matching for intrusion detection with Snort.

[BibT_eX]

[DOI]

Ann. des Télécommunications, 2004

Protocol Analysis in Intrusion Detection Using Decision Tree.

[BibT_eX]

[DOI]

Proceedings of the International Conference on Information Technology: Coding and Computing (ITCC'04), 2004

A Decidable Analysis of Security Protocols.

[BibT_eX]

[DOI]

Proceedings of the Exploring New Frontiers of Theoretical Informatics, 2004

Deductive Verification of Distributed Groupware Systems.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 2004

2003

Deciding the confluence of ordered term rewrite systems.

[BibT_eX]

[DOI]

ACM Trans. Comput. Log., 2003

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

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2003

Mechanical Verification of an Ideal Incremental ABR Conformance Algorithm.

[BibT_eX]

[DOI]

Sorin Stratulat

Francis Klay

J. Autom. Reason., 2003

A rewriting approach to satisfiability procedures.

[BibT_eX]

[DOI]

Alessandro Armando

Silvio Ranise

Inf. Comput., 2003

Automated analysis of security protocols.

[BibT_eX]

[DOI]

Proceedings of the 12th International Workshop on Functional and Constraint Logic Programming, 2003

ACID-Unification Is NEXPTIME-Decidable.

[BibT_eX]

[DOI]

Proceedings of the Mathematical Foundations of Computer Science 2003, 2003

Deciding the Security of Protocols with Diffie-Hellman Exponentiation and Products in Exponents.

[BibT_eX]

[DOI]

Proceedings of the FST TCS 2003: Foundations of Software Technology and Theoretical Computer Science, 2003

Computing Meta-transitions for Linear Transition Systems with Polynomials.

[BibT_eX]

[DOI]

Julien Musset

Proceedings of the FME 2003: Formal Methods, 2003

Proving Correctness of Transformation Functions in Real-Time Groupware.

[BibT_eX]

[DOI]

Proceedings of the Eighth European Conference on Computer Supported Cooperative Work, 2003

Extending the Dolev-Yao Intruder for Analyzing an Unbounded Number of Sessions.

[BibT_eX]

[DOI]

Proceedings of the Computer Science Logic, 17th International Workshop, 2003

Unification Modulo ACU I Plus Homomorphisms/Distributivity.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 2002

Incorporating Decision Procedures in Implicit Induction.

[BibT_eX]

[DOI]

Alessandro Armando

Sorin Stratulat

J. Symb. Comput., 2002

Guest Editorial.

[BibT_eX]

[DOI]

Inf. Comput., 2002

The AVISS Security Protocol Analysis Tool.

[BibT_eX]

[DOI]

Proceedings of the Computer Aided Verification, 14th International Conference, 2002

2001

Algorithms and Reductions for Rewriting Problems.

[BibT_eX]

[DOI]

Rakesh M. Verma

Denis Lugiez

Fundam. Informaticae, 2001

The practice of cryptographic protocol verification.

[BibT_eX]

[DOI]

Proceedings of the Logical Aspects of Cryptographic Protocol Verification, 2001

Rewriting for Deduction and Verification.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 12th International Conference, 2001

Uniform Derivation of Decision Procedures by Superposition.

[BibT_eX]

[DOI]

Alessandro Armando

Silvio Ranise

Proceedings of the Computer Science Logic, 15th International Workshop, 2001

Protocol Insecurity with Finite Number of Sessions is NP-Complete.

[BibT_eX]

[DOI]

Proceedings of the 14th IEEE Computer Security Foundations Workshop (CSFW-14 2001), 2001

2000

Compiling and Verifying Security Protocols.

[BibT_eX]

[DOI]

Laurent Vigneron

Proceedings of the Logic for Programming and Automated Reasoning, 2000

The Theory of Total Unary RPO Is Decidable.

[BibT_eX]

[DOI]

Proceedings of the Computational Logic, 2000

Mechanical Verification of an Ideal Incremental ABR Conformance.

[BibT_eX]

[DOI]

Sorin Stratulat

Francis Klay

Proceedings of the Computer Aided Verification, 12th International Conference, 2000

1999

Patterns in Words versus Patterns in Trees: A Brief Survey and New Results.

[BibT_eX]

[DOI]

Proceedings of the Perspectives of System Informatics, 1999

1998

Decision Problems in Ordered Rewriting.

[BibT_eX]

[DOI]

Proceedings of the Thirteenth Annual IEEE Symposium on Logic in Computer Science, 1998

Observational Proofs with Critical Contexts.

[BibT_eX]

[DOI]

Narjes Berregeb

Proceedings of the Fundamental Approaches to Software Engineering, 1998

RPO Constraint Solving Is in NP.

[BibT_eX]

[DOI]

Rakesh M. Verma

Proceedings of the Computer Science Logic, 12th International Workshop, 1998

1997

Matching a Set of Strings with Variable Length don't Cares.

[BibT_eX]

[DOI]

Theor. Comput. Sci., 1997

1996

Any Ground Associative-Commutative Theory Has a Finite Canonical System.

[BibT_eX]

[DOI]

J. Autom. Reason., 1996

Implementing non-linear constraints with cooperative solvers.

[BibT_eX]

[DOI]

Éric Monfroy

René Schott

Proceedings of the 1996 ACM Symposium on Applied Computing, 1996

SPIKE-AC: A System for Proofs by Induction in Associative-Commutative Theories.

[BibT_eX]

[DOI]

Narjes Berregeb

Proceedings of the Rewriting Techniques and Applications, 7th International Conference, 1996

Automated Verification by Induction with Associative-Commutative Operators.

[BibT_eX]

[DOI]

Narjes Berregeb

Proceedings of the Computer Aided Verification, 8th International Conference, 1996

1995

Automated Mathematical Induction.

[BibT_eX]

[DOI]

J. Log. Comput., 1995

Implicit Induction in Conditional Theories.

[BibT_eX]

[DOI]

J. Autom. Reason., 1995

Undecidability of Ground Reducibility for Word Rewriting Systems with Variables.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1995

Reasoning with Conditional Axioms.

[BibT_eX]

[DOI]

Ann. Math. Artif. Intell., 1995

Automated deduction with associative-commutative operators.

[BibT_eX]

[DOI]

Laurent Vigneron

Appl. Algebra Eng. Commun. Comput., 1995

SPIKE: A System for Automatic Inductive Proofs.

[BibT_eX]

[DOI]

Proceedings of the Algebraic Methodology and Software Technology, 1995

1994

On ground reducibility problem for word rewriting systems with variables.

[BibT_eX]

[DOI]

Proceedings of the 1994 ACM Symposium on Applied Computing, 1994

The Complexity of Testing Ground Reducibility for Linear Word Rewriting Systems with Variables.

[BibT_eX]

[DOI]

Proceedings of the Conditional and Typed Rewriting Systems, 4th International Workshop, 1994

1993

Preferring diagnoses by abduction.

[BibT_eX]

[DOI]

Béchir el Ayeb

Pierre Marquis

IEEE Trans. Syst. Man Cybern., 1993

A Logical Framework for Concept Learning with Background Knowledge.

[BibT_eX]

[DOI]

Int. J. Artif. Intell. Tools, 1993

The Unifiability Problem in Ground AC Theories

[BibT_eX]

[DOI]

Proceedings of the Eighth Annual Symposium on Logic in Computer Science (LICS '93), 1993

Automatic Case Analysis in Proof by Induction.

[BibT_eX]

[DOI]

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.

[BibT_eX]

[DOI]

J. Log. Program., 1992

SPIKE, an Automatic Theorem Prover.

[BibT_eX]

[DOI]

Proceedings of the Logic Programming and Automated Reasoning, 1992

1991

Theorem-Proving with Resolution and Superposition.

[BibT_eX]

[DOI]

J. Symb. Comput., 1991

On Word Problems in Horn Theories.

[BibT_eX]

[DOI]

J. Symb. Comput., 1991

Proving Refutational Completeness of Theorem-Proving Strategies: The Transfinite Semantic Tree Method.

[BibT_eX]

[DOI]

J. ACM, 1991

Any Gound Associative-Commutative Theory Has a Finite Canonical System.

[BibT_eX]

[DOI]

Proceedings of the Rewriting Techniques and Applications, 4th International Conference, 1991

Automatic Proof Methods for Algebraic Specifications.

[BibT_eX]

[DOI]

Proceedings of the Fundamentals of Computation Theory, 8th International Symposium, 1991

Studies on the Ground Convergence Property of Conditional Theories.

[BibT_eX]

Proceedings of the Algebraic Methodology and Software Technology (AMAST '91), 1991

1990

Mechanizing inductive reasoning.

[BibT_eX]

Bull. EATCS, 1990

A New Diagnosis Approach by Deduction and Abduction.

[BibT_eX]

[DOI]

Béchir el Ayeb

Pierre Marquis

Proceedings of the Expert Systems in Engineering, 1990

Deductive/Abductvie Diagnosis: The DA-Principles.

[BibT_eX]

Béchir el Ayeb

Pierre Marquis

Proceedings of the 9th European Conference on Artificial Intelligence, 1990

A Proof System for Conditional Algebraic Specifications.

[BibT_eX]

[DOI]

Proceedings of the Conditional and Typed Rewriting Systems, 1990

1988

Theorem-Proving with Resolution and Superposition: An Extension of the Knuth and Bendic Procedure to a Complete Set of Inference Rules.

[BibT_eX]

Proceedings of the International Conference on Fifth Generation Computer Systems, 1988

1987

Path of Subterms Ordering and Recursive Decomposition Ordering Revisited.

[BibT_eX]

[DOI]

J. Symb. Comput., 1987

On Termination of the Direct Sum of Term-Rewriting Systems.

[BibT_eX]

[DOI]

Inf. Process. Lett., 1987

Complete Inference Rules for the Cancellation Laws.

[BibT_eX]

[DOI]

Kô Sakai

Proceedings of the 10th International Joint Conference on Artificial Intelligence. Milan, 1987

On Word Problems in Equational Theories.

[BibT_eX]

[DOI]

Proceedings of the Automata, Languages and Programming, 14th International Colloquium, 1987

1986

A New Method for Establishing Refutational Completeness in Theorem Proving.

[BibT_eX]

[DOI]