Hubert Comon - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 51 from 51

2020

Oracle Simulation: A Technique for Protocol Composition with Long Term Shared SecretsHubert Comon, Charlie Jacomme, Guillaume Scerri. ccs 2020: 1427-1444 [doi]

2017

Formal Computational Unlinkability Proofs of RFID ProtocolsHubert Comon, Adrien Koutsos. csfw 2017: 100-114 [doi]

2005

Tree automata with one memory set constraints and cryptographic protocolsHubert Comon, Véronique Cortier. TCS, 331(1):143-214, 2005. [doi]

2003

Ground reducibility is EXPTIME-completeHubert Comon, Florent Jacquemard. iandc, 187(1):123-153, 2003. [doi]

Deciding the confluence of ordered term rewrite systemsHubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch. tocl, 4(1):33-55, 2003. [doi]

2001

Inductionless InductionHubert Comon. In John Alan Robinson, Andrei Voronkov, editors, Handbook of Automated Reasoning (in 2 volumes). pages 913-962, Elsevier and MIT Press, 2001.

Tree Automata with One Memory, Set Constraints, and Ping-Pong ProtocolsHubert Comon, Véronique Cortier, John Mitchell. icalp 2001: 682-693 [doi]

The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial TimeHubert Comon, Guillem Godoy, Robert Nieuwenhuis. focs 2001: 298-307

2000

Sequentiality, Monadic Second-Order Logic and Tree AutomataHubert Comon. iandc, 157(1-2):25-51, 2000.

Flatness Is Not a WeaknessHubert Comon, Véronique Cortier. csl 2000: 262-276 [doi]

Induction=I-Axiomatization+First-Order ConsistencyHubert Comon, Robert Nieuwenhuis. iandc, 159(1-2):151-186, 2000.

1999

Timed Automata and the Theory of Real NumbersHubert Comon, Yan Jurski. concur 1999: 242-257 [doi]

Constraint Solving on TermsHubert Comon, Claude Kirchner. iccl 2001: 47-103 [doi]

A Methodological View of Constraint SolvingHubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud, Claude Kirchner. constraints, 4(4):337-361, 1999.

1998

1997

The First-Order Theory of Lexicographic Path Orderings is UndecidableHubert Comon, Ralf Treinen. TCS, 176(1-2):67-87, 1997. [doi]

Higher-Order Matching and Tree AutomataHubert Comon, Yan Jurski. csl 1998: 157-176

Ground Reducibility is EXPTIME-CompleteHubert Comon, Florent Jacquemard. lics 1997: 26-34 [doi]

1996

Diophantine Equations, Presburger Arithmetic and Finite AutomataAlexandre Boudet, Hubert Comon. caap 1996: 30-43

1995

On Unification of Terms with Integer ExponentsHubert Comon. mst, 28(1):67-88, 1995.

Sequentiality, Second Order Monadic Logic and Tree AutomataHubert Comon. lics 1995: 508-517

Linear diophantine equations, Presburger arithmetic and finite automataHubert Comon. UNIF 1995: 13

Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract)Hubert Comon, Robert Nieuwenhuis, Albert Rubio. lics 1995: 375-385

1994

Pumping, Cleaning and Symbolic Constraints SolvingAnne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard. icalp 1994: 436-449

Ordering Constraints on TreesHubert Comon, Ralf Treinen. caap 1994: 1-14

Equational Formulae with Membership ConstraintsHubert Comon, Catherine Delor. iandc, 112(2):167-216, August 1994.

Ground Reducibility and Automata with Disequality ConstraintsHubert Comon, Florent Jacquemard. STACS 1994: 151-162

Constraints in Term Algebras: An Overview of Constraint Solving TechniquesHubert Comon. Constraint Programming: Basics and Trends, Châtillon Spring School, Châtillon-sur-Seine, France, May 16 - 20, 1994, Selected Papers 1995: 62-67

Syntacticness, Cycle-Syntacticness, and Shallow TheoriesHubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud. iandc, 111(1):154-191, May 1994.

1993

About the Theory of Tree EmbeddingAlexandre Boudet, Hubert Comon. tapsoft 1993: 376-390

Complete Axiomatizations of Some Quotient Term AlgebrasHubert Comon. TCS, 118(2):167-191, 1993.

Constraints in Term Algebras (Short Survey)Hubert Comon. amast 1994: 97-108

1992

Completion of Rewrite Systems with Membership ConstraintsHubert Comon. icalp 1992: 392-403

Decidable Problems in Shallow Equational Theories (Extended Abstract)Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud. lics 1992: 255-265

Negation Elimination in Equational FormulaeHubert Comon, Maribel Fernández. mfcs 1992: 191-199

1991

A Rewrite-Based Type Discipline for a Subset of Computer AlgebraHubert Comon, Denis Lugiez, Ph. Schnoebelen. JSC, 11(4):349-368, 1991.

Disunification: A SurveyHubert Comon. BIRTHDAY 1991: 322-359

Complete Axiomatizations of Some Quotient Term AlgebrasHubert Comon. icalp 1991: 469-480

1990

Equational Formulas in Order-Sorted AlgebrasHubert Comon. icalp 1990: 674-688

Solving Symbolic Ordering ConstraintsHubert Comon. ijfcs, 1(4):387-412, 1990.

Solving Inequations in Term Algebras (Extended Abstract)Hubert Comon. lics 1990: 62-69

1989

Inductive Proofs by Specification TransformationHubert Comon. RTA 1989: 76-91

Equational Problems and DisunificationHubert Comon, Pierre Lescanne. JSC, 7(3/4):371-425, 1989.

1988

An Effective Method for Handling Initial AlgebrasHubert Comon. icalp 1988: 108-118

Unification et disunification : théorie et applications. (Unification and disunification in free algebras and in initial algebras : theory and applications)Hubert Comon. PhD thesis, Grenoble Institute of Technology, France, 1988. [doi]

1986

Type Inference Using Unification in Computer AlgebraJacques Calmet, Hubert Comon, Denis Lugiez. AAECC 1988: 25-28

Sufficient Completness, Term Rewriting Systems and Anti-Unification Hubert Comon. cade 1986: 128-140

Sign in or sign up to see more results.

runs on WebDSL