Hubert Comon-Lundh

According to our database, Hubert Comon-Lundh authored at least 85 papers between 1986 and 2020.

Collaborative distances:

• Dijkstra number of three.
• Erdős number of three.

2020

Oracle Simulation: A Technique for Protocol Composition with Long Term Shared Secrets.

Hubert Comon, Charlie Jacomme, Guillaume Scerri

Proceedings of the CCS '20: 2020 ACM SIGSAC Conference on Computer and Communications Security, 2020

2017

A procedure for deciding symbolic equivalence between sets of constraint systems.

Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune

Inf. Comput., 2017

Formal Computational Unlinkability Proofs of RFID Protocols.

Hubert Comon, Adrien Koutsos

Proceedings of the 30th IEEE Computer Security Foundations Symposium, 2017

2014

Deducibility constraints and blind signatures.

Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune

Inf. Comput., 2014

A Computationally Complete Symbolic Attacker for Equivalence Properties.

Gergei Bana, Hubert Comon-Lundh

Proceedings of the 2014 ACM SIGSAC Conference on Computer and Communications Security, 2014

2013

LICS: Logic in Computer Security - Some Attacker's Models and Related Decision Problems.

Hubert Comon-Lundh

Proceedings of the 28th Annual ACM/IEEE Symposium on Logic in Computer Science, 2013

Tractable Inference Systems: An Extension with a Deducibility Predicate.

Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri

Proceedings of the Automated Deduction - CADE-24, 2013

2012

Formal Security Proofs.

Hubert Comon-Lundh, Stéphanie Delaune

Proceedings of the Software Safety and Security - Tools for Analysis and Verification, 2012

Special Issue on Security and Rewriting Foreword.

Hubert Comon-Lundh, Catherine Meadows

J. Autom. Reason., 2012

Security proof with dishonest keys.

Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri

IACR Cryptol. ePrint Arch., 2012

Towards Unconditional Soundness: Computationally Complete Symbolic Attacker.

Gergei Bana, Hubert Comon-Lundh

IACR Cryptol. ePrint Arch., 2012

Computational Soundness of Indistinguishability Properties without Computable Parsing.

Hubert Comon-Lundh, Masami Hagiya, Yusuke Kawamoto, Hideki Sakurada

Proceedings of the Information Security Practice and Experience, 2012

2011

Security and Rewriting (Dagstuhl Seminar 11332).

Hubert Comon-Lundh, Ralf Küsters, Catherine Meadows

Dagstuhl Reports, 2011

How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones.

Hubert Comon-Lundh, Véronique Cortier

Proceedings of the 28th International Symposium on Theoretical Aspects of Computer Science, 2011

Trace equivalence decision: negative tests and non-determinism.

Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune

Proceedings of the 18th ACM Conference on Computer and Communications Security, 2011

Constraint solving techniques and enriching the model with equational theories.

Hubert Comon-Lundh, Stéphanie Delaune, Jonathan K. Millen

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

2010

Deciding security properties for cryptographic protocols. application to key cycles.

Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu

ACM Trans. Comput. Log., 2010

Automating Security Analysis: Symbolic Equivalence of Constraint Systems.

Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune

Proceedings of the Automated Reasoning, 5th International Joint Conference, 2010

2009

Computational and Symbolic Anonymity in an Unbounded Network.

Hubert Comon-Lundh, Yusuke Kawamoto, Hideki Sakurada

JSIAM Lett., 2009

Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions.

Sergiu Bursuc, Hubert Comon-Lundh

Proceedings of the Rewriting Techniques and Applications, 20th International Conference, 2009

Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables.

Reynald Affeldt, Hubert Comon-Lundh

Proceedings of the Formal to Practical Security, 2009

Models and Proofs of Protocol Security: A Progress Report.

Martín Abadi, Bruno Blanchet, Hubert Comon-Lundh

Proceedings of the Computer Aided Verification, 21st International Conference, 2009

Deducibility Constraints.

Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune

Proceedings of the Advances in Computer Science, 2009

2008

Visibly Tree Automata with Memory and Constraints.

Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin

Log. Methods Comput. Sci., 2008

About models of security protocols.

Hubert Comon-Lundh

Proceedings of the IARCS Annual Conference on Foundations of Software Technology and Theoretical Computer Science, 2008

Computational soundness of observational equivalence.

Hubert Comon-Lundh, Véronique Cortier

Proceedings of the 2008 ACM Conference on Computer and Communications Security, 2008

Challenges in the Automated Verification of Security Protocols.

Hubert Comon-Lundh

Proceedings of the Automated Reasoning, 4th International Joint Conference, 2008

2007

Associative-Commutative Deducibility Constraints.

Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune

Proceedings of the STACS 2007, 2007

Tree Automata with Memory, Visibility and Structural Constraints.

Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin

Proceedings of the Foundations of Software Science and Computational Structures, 2007

Deducibility Constraints, Equational Theory and Electronic Money.

Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune

Proceedings of the Rewriting, 2007

2006

Normal Proofs in Intruder Theories.

Vincent Bernat, Hubert Comon-Lundh

Proceedings of the Advances in Computer Science, 2006

2005

Tree automata with one memory set constraints and cryptographic protocols.

Hubert Comon, Véronique Cortier

Theor. Comput. Sci., 2005

The Finite Variant Property: How to Get Rid of Some Algebraic Properties.

Hubert Comon-Lundh, Stéphanie Delaune

Proceedings of the Term Rewriting and Applications, 16th International Conference, 2005

Normal Attacks on Security Protocols.

Hubert Comon-Lundh

Proceedings of the 12th International Workshop on Abstract State Machines, 2005

2004

Security properties: two agents are sufficient.

Hubert Comon-Lundh, Véronique Cortier

Sci. Comput. Program., 2004

Intruder Theories (Ongoing Work).

Hubert Comon-Lundh

Proceedings of the Foundations of Software Science and Computation Structures, 2004

2003

Deciding the confluence of ordered term rewrite systems.

Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch

ACM Trans. Comput. Log., 2003

Ground reducibility is EXPTIME-complete.

Hubert Comon, Florent Jacquemard

Inf. Comput., 2003

New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols.

Hubert Comon-Lundh, Véronique Cortier

Proceedings of the Rewriting Techniques and Applications, 14th International Conference, 2003

Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or.

Hubert Comon-Lundh, Vitaly Shmatikov

Proceedings of the 18th IEEE Symposium on Logic in Computer Science (LICS 2003), 2003

Easy Intruder Deductions.

Hubert Comon-Lundh, Ralf Treinen

Proceedings of the Verification: Theory and Practice, 2003

2001

Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols.

Hubert Comon, Véronique Cortier, John Mitchell

Proceedings of the Automata, Languages and Programming, 28th International Colloquium, 2001

The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time.

Hubert Comon, Guillem Godoy, Robert Nieuwenhuis

Proceedings of the 42nd Annual Symposium on Foundations of Computer Science, 2001

Inductionless Induction.

Hubert Comon

Proceedings of the Handbook of Automated Reasoning (in 2 volumes), 2001

2000

Induction=I-Axiomatization+First-Order Consistency.

Hubert Comon, Robert Nieuwenhuis

Inf. Comput., 2000

Sequentiality, Monadic Second-Order Logic and Tree Automata.

Hubert Comon

Inf. Comput., 2000

Flatness Is Not a Weakness.

Hubert Comon, Véronique Cortier

Proceedings of the Computer Science Logic, 2000

1999

A Methodological View of Constraint Solving.

Hubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud, Claude Kirchner

Constraints An Int. J., 1999

Timed Automata and the Theory of Real Numbers.

Hubert Comon, Yan Jurski

Proceedings of the CONCUR '99: Concurrency Theory, 1999

Constraint Solving on Terms.

Hubert Comon, Claude Kirchner

Proceedings of the Constraints in Computational Logics: Theory and Applications, 1999

1998

Completion of Rewrite Systems with Membership Constraints. Part II: Constraint Solving.

Hubert Comon

J. Symb. Comput., 1998

Completion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules.

Hubert Comon

J. Symb. Comput., 1998

About Proofs by Consistency (Abstract).

Hubert Comon

Proceedings of the Rewriting Techniques and Applications, 9th International Conference, 1998

Decision Problems in Ordered Rewriting.

Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch

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

Multiple Counters Automata, Safety Analysis and Presburger Arithmetic.

Hubert Comon, Yan Jurski

Proceedings of the Computer Aided Verification, 10th International Conference, 1998

1997

The First-Order Theory of Lexicographic Path Orderings is Undecidable.

Hubert Comon, Ralf Treinen

Theor. Comput. Sci., 1997

Higher-Order Matching and Tree Automata.

Hubert Comon, Yan Jurski

Proceedings of the Computer Science Logic, 11th International Workshop, 1997

1996

Diophantine Equations, Presburger Arithmetic and Finite Automata.

Alexandre Boudet, Hubert Comon

Proceedings of the Trees in Algebra and Programming, 1996

1995

On Unification of Terms with Integer Exponents.

Hubert Comon

Math. Syst. Theory, 1995

Linear diophantine equations, Presburger arithmetic and finite automata.

Hubert Comon

Proceedings of the 9th International Workshop on Unification, 1995

Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract)

Hubert Comon, Robert Nieuwenhuis, Albert Rubio

Proceedings of the Proceedings, 1995

Sequentiality, Second Order Monadic Logic and Tree Automata

Hubert Comon

Proceedings of the Proceedings, 1995

1994

Equational Formulae with Membership Constraints

Hubert Comon, Catherine Delor

Inf. Comput., August, 1994

Syntacticness, Cycle-Syntacticness, and Shallow Theories

Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud

Inf. Comput., May, 1994

Constraints in Term Algebras: An Overview of Constraint Solving Techniques

Hubert Comon

Proceedings of the Constraint Programming: Basics and Trends, Châtillon Spring School, 1994

Ground Reducibility and Automata with Disequality Constraints.

Hubert Comon, Florent Jacquemard

Proceedings of the STACS 94, 1994

Pumping, Cleaning and Symbolic Constraints Solving.

Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard

Proceedings of the Automata, Languages and Programming, 21st International Colloquium, 1994

Ordering Constraints on Trees.

Hubert Comon, Ralf Treinen

Proceedings of the Trees in Algebra and Programming, 1994

1993

Complete Axiomatizations of Some Quotient Term Algebras.

Hubert Comon

Theor. Comput. Sci., 1993

About the Theory of Tree Embedding.

Alexandre Boudet, Hubert Comon

Proceedings of the TAPSOFT'93: Theory and Practice of Software Development, 1993

Constraints in Term Algebras (Short Survey).

Hubert Comon

Proceedings of the Algebraic Methodology and Software Technology (AMAST '93), 1993

1992

Negation Elimination in Equational Formulae.

Hubert Comon, Maribel Fernández

Proceedings of the Mathematical Foundations of Computer Science 1992, 1992

Decidable Problems in Shallow Equational Theories (Extended Abstract)

Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud

Proceedings of the Seventh Annual Symposium on Logic in Computer Science (LICS '92), 1992

Completion of Rewrite Systems with Membership Constraints.

Hubert Comon

Proceedings of the Automata, Languages and Programming, 19th International Colloquium, 1992

1991

A Rewrite-Based Type Discipline for a Subset of Computer Algebra.

Hubert Comon, Denis Lugiez, Philippe Schnoebelen

J. Symb. Comput., 1991

Disunification: A Survey.

Hubert Comon

Proceedings of the Computational Logic - Essays in Honor of Alan Robinson, 1991

1990

Solving Symbolic Ordering Constraints.

Hubert Comon

Int. J. Found. Comput. Sci., 1990

Solving Inequations in Term Algebras (Extended Abstract)

Hubert Comon

Proceedings of the Fifth Annual Symposium on Logic in Computer Science (LICS '90), 1990

Equational Formulas in Order-Sorted Algebras.

Hubert Comon

Proceedings of the Automata, Languages and Programming, 17th International Colloquium, 1990

1989

Equational Problems and Disunification.

Hubert Comon, Pierre Lescanne

J. Symb. Comput., 1989

Inductive Proofs by Specification Transformation.

Hubert Comon

Proceedings of the Rewriting Techniques and Applications, 3rd International Conference, 1989

1988

Unification et disunification : théorie et applications. (Unification and disunification in free algebras and in initial algebras : theory and applications).

Hubert Comon

PhD thesis, 1988

An Effective Method for Handling Initial Algebras.

Hubert Comon

Proceedings of the Algebraic and Logic Programming, 1988

1986

Sufficient Completness, Term Rewriting Systems and "Anti-Unification".

Hubert Comon

Proceedings of the 8th International Conference on Automated Deduction, Oxford, England, July 27, 1986

Type Inference Using Unification in Computer Algebra.

Jacques Calmet, Hubert Comon, Denis Lugiez

Proceedings of the Applied Algebra, 1986