Hubert Comon

Publication Activity (10 Years)

Years Active: 1986-2020
Publications (10 Years): 3

Top Venues

CSF

CoRR

CCS

Grenoble Institute of Technology, France (PHD)

Education History

Grenoble Institute of Technology, France

PHD

Publications

Hubert Comon, Charlie Jacomme, Guillaume Scerri
Oracle Simulation: A Technique for Protocol Composition with Long Term Shared Secrets. CCS (2020)
Hubert Comon, Adrien Koutsos
Formal Computational Unlinkability Proofs of RFID Protocols. CoRR (2017)
Hubert Comon, Adrien Koutsos
Formal Computational Unlinkability Proofs of RFID Protocols. CSF (2017)
Hubert Comon, Véronique Cortier
Tree automata with one memory set constraints and cryptographic protocols. Theor. Comput. Sci. 331 (1) (2005)
Hubert Comon, Florent Jacquemard
Ground reducibility is EXPTIME-complete. Inf. Comput. 187 (1) (2003)
Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch
Deciding the confluence of ordered term rewrite systems. ACM Trans. Comput. Log. 4 (1) (2003)
Hubert Comon, Guillem Godoy, Robert Nieuwenhuis
The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. FOCS (2001)
Hubert Comon, Véronique Cortier, John Mitchell
Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols. ICALP (2001)
Hubert Comon, Véronique Cortier
Flatness Is Not a Weakness. CSL (2000)
Hubert Comon, Robert Nieuwenhuis
Induction=I-Axiomatization+First-Order Consistency. Inf. Comput. 159 (1-2) (2000)
Hubert Comon
Sequentiality, Monadic Second-Order Logic and Tree Automata. Inf. Comput. 157 (1-2) (2000)
Hubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud, Claude Kirchner
A Methodological View of Constraint Solving. Constraints An Int. J. 4 (4) (1999)
Hubert Comon, Yan Jurski
Timed Automata and the Theory of Real Numbers. CONCUR (1999)
Hubert Comon, Claude Kirchner
Constraint Solving on Terms. CCL (1999)
Hubert Comon
Completion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules. J. Symb. Comput. 25 (4) (1998)
Hubert Comon
Completion of Rewrite Systems with Membership Constraints. Part II: Constraint Solving. J. Symb. Comput. 25 (4) (1998)
Hubert Comon, Yan Jurski
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic. CAV (1998)
Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch
Decision Problems in Ordered Rewriting. LICS (1998)
Hubert Comon
About Proofs by Consistency (Abstract). RTA (1998)
Hubert Comon, Florent Jacquemard
Ground Reducibility is EXPTIME-Complete. LICS (1997)
Hubert Comon, Ralf Treinen
The First-Order Theory of Lexicographic Path Orderings is Undecidable. Theor. Comput. Sci. 176 (1-2) (1997)
Hubert Comon, Yan Jurski
Higher-Order Matching and Tree Automata. CSL (1997)
Alexandre Boudet, Hubert Comon
Diophantine Equations, Presburger Arithmetic and Finite Automata. CAAP (1996)
Hubert Comon, Robert Nieuwenhuis, Albert Rubio
Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract) LICS (1995)
Hubert Comon
On Unification of Terms with Integer Exponents. Math. Syst. Theory 28 (1) (1995)
Hubert Comon
Linear diophantine equations, Presburger arithmetic and finite automata. UNIF (1995)
Hubert Comon
Sequentiality, Second Order Monadic Logic and Tree Automata LICS (1995)
Hubert Comon, Ralf Treinen
Ordering Constraints on Trees. CAAP (1994)
Hubert Comon, Florent Jacquemard
Ground Reducibility and Automata with Disequality Constraints. STACS (1994)
Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard
Pumping, Cleaning and Symbolic Constraints Solving. ICALP (1994)
Hubert Comon, Catherine Delor
Equational Formulae with Membership Constraints Inf. Comput. 112 (2) (1994)
Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud
Syntacticness, Cycle-Syntacticness, and Shallow Theories Inf. Comput. 111 (1) (1994)
Hubert Comon
Constraints in Term Algebras: An Overview of Constraint Solving Techniques Constraint Programming (1994)
Alexandre Boudet, Hubert Comon
About the Theory of Tree Embedding. TAPSOFT (1993)
Hubert Comon
Complete Axiomatizations of Some Quotient Term Algebras. Theor. Comput. Sci. 118 (2) (1993)
Hubert Comon
Constraints in Term Algebras (Short Survey). AMAST (1993)
Hubert Comon, Maribel Fernández
Negation Elimination in Equational Formulae. MFCS (1992)
Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud
Decidable Problems in Shallow Equational Theories (Extended Abstract) LICS (1992)
Hubert Comon
Completion of Rewrite Systems with Membership Constraints. ICALP (1992)
Hubert Comon, Denis Lugiez, Philippe Schnoebelen
A Rewrite-Based Type Discipline for a Subset of Computer Algebra. J. Symb. Comput. 11 (4) (1991)
Hubert Comon
Complete Axiomatizations of Some Quotient Term Algebras. ICALP (1991)
Hubert Comon
Disunification: A Survey. Computational Logic - Essays in Honor of Alan Robinson (1991)
Hubert Comon
Equational Formulas in Order-Sorted Algebras. ICALP (1990)
Hubert Comon
Solving Symbolic Ordering Constraints. Int. J. Found. Comput. Sci. 1 (4) (1990)
Hubert Comon
Solving Inequations in Term Algebras (Extended Abstract) LICS (1990)
Hubert Comon
Inductive Proofs by Specification Transformation. RTA (1989)
Hubert Comon, Pierre Lescanne
Equational Problems and Disunification. J. Symb. Comput. 7 (3/4) (1989)
Hubert Comon
An Effective Method for Handling Initial Algebras. ALP (1988)
Hubert Comon
Sufficient Completness, Term Rewriting Systems and "Anti-Unification". CADE (1986)
Jacques Calmet, Hubert Comon, Denis Lugiez
Type Inference Using Unification in Computer Algebra. AAECC (1986)

Hubert Comon.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Hubert Comon