| 2008 |
|---|
| 69 | EE | Hubert Comon-Lundh,
Véronique Cortier:
Computational soundness of observational equivalence.
ACM Conference on Computer and Communications Security 2008: 109-118 |
| 68 | EE | Hubert Comon-Lundh:
About models of security protocols.
FSTTCS 2008 |
| 67 | EE | Hubert Comon-Lundh:
Challenges in the Automated Verification of Security Protocols.
IJCAR 2008: 396-409 |
| 66 | EE | Hubert Comon-Lundh,
Florent Jacquemard,
Nicolas Perrin:
Visibly Tree Automata with Memory and Constraints
CoRR abs/0804.3065: (2008) |
| 2007 |
|---|
| 65 | | Hubert Comon-Lundh,
Claude Kirchner,
Hélène Kirchner:
Rewriting, Computation and Proof, Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday
Springer 2007 |
| 64 | EE | Hubert Comon-Lundh,
Florent Jacquemard,
Nicolas Perrin:
Tree Automata with Memory, Visibility and Structural Constraints.
FoSSaCS 2007: 168-182 |
| 63 | EE | Sergiu Bursuc,
Hubert Comon-Lundh,
Stéphanie Delaune:
Deducibility Constraints, Equational Theory and Electronic Money.
Rewriting, Computation and Proof 2007: 196-212 |
| 62 | EE | Sergiu Bursuc,
Hubert Comon-Lundh,
Stéphanie Delaune:
Associative-Commutative Deducibility Constraints.
STACS 2007: 634-645 |
| 61 | EE | Hubert Comon-Lundh,
Véronique Cortier,
Eugen Zalinescu:
Deciding security properties for cryptographic protocols. Application to key cycles
CoRR abs/0708.3564: (2007) |
| 2006 |
|---|
| 60 | EE | Vincent Bernat,
Hubert Comon-Lundh:
Normal Proofs in Intruder Theories.
ASIAN 2006: 151-166 |
| 2005 |
|---|
| 59 | EE | Hubert Comon-Lundh:
Normal Attacks on Security Protocols.
Abstract State Machines 2005: 70 |
| 58 | EE | Hubert Comon-Lundh,
Stéphanie Delaune:
The Finite Variant Property: How to Get Rid of Some Algebraic Properties.
RTA 2005: 294-307 |
| 57 | EE | Hubert Comon,
Véronique Cortier:
Tree automata with one memory set constraints and cryptographic protocols.
Theor. Comput. Sci. 331(1): 143-214 (2005) |
| 2004 |
|---|
| 56 | EE | Hubert Comon-Lundh:
Intruder Theories (Ongoing Work).
FoSSaCS 2004: 1-4 |
| 55 | EE | Hubert Comon-Lundh,
Véronique Cortier:
Security properties: two agents are sufficient.
Sci. Comput. Program. 50(1-3): 51-71 (2004) |
| 2003 |
|---|
| 54 | EE | Hubert Comon-Lundh,
Véronique Cortier:
Security Properties: Two Agents Are Sufficient.
ESOP 2003: 99-113 |
| 53 | EE | Hubert Comon-Lundh,
Vitaly Shmatikov:
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or.
LICS 2003: 271- |
| 52 | EE | Hubert Comon-Lundh,
Véronique Cortier:
New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols.
RTA 2003: 148-164 |
| 51 | EE | Hubert Comon-Lundh,
Ralf Treinen:
Easy Intruder Deductions.
Verification: Theory and Practice 2003: 225-242 |
| 50 | EE | Hubert Comon,
Paliath Narendran,
Robert Nieuwenhuis,
Michaël Rusinowitch:
Deciding the confluence of ordered term rewrite systems.
ACM Trans. Comput. Log. 4(1): 33-55 (2003) |
| 49 | EE | Hubert Comon,
Florent Jacquemard:
Ground reducibility is EXPTIME-complete.
Inf. Comput. 187(1): 123-153 (2003) |
| 2001 |
|---|
| 48 | | Hubert Comon,
Claude Marché,
Ralf Treinen:
Constraints in Computational Logics: Theory and Applications, International Summer School, CCL'99 Gif-sur-Yvette, France, September 5-8, 1999, Revised Lectures
Springer 2001 |
| 47 | | Gérard Berry,
Hubert Comon,
Alain Finkel:
Computer Aided Verification, 13th International Conference, CAV 2001, Paris, France, July 18-22, 2001, Proceedings
Springer 2001 |
| 46 | | Hubert Comon,
Guillem Godoy,
Robert Nieuwenhuis:
The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time.
FOCS 2001: 298-307 |
| 45 | EE | Hubert Comon,
Véronique Cortier,
John Mitchell:
Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols.
ICALP 2001: 682-693 |
| 44 | | Hubert Comon:
Inductionless Induction.
Handbook of Automated Reasoning 2001: 913-962 |
| 2000 |
|---|
| 43 | EE | Hubert Comon,
Véronique Cortier:
Flatness Is Not a Weakness.
CSL 2000: 262-276 |
| 42 | | Hubert Comon:
Sequentiality, Monadic Second-Order Logic and Tree Automata.
Inf. Comput. 157(1-2): 25-51 (2000) |
| 41 | | Hubert Comon,
Robert Nieuwenhuis:
Induction=I-Axiomatization+First-Order Consistency.
Inf. Comput. 159(1-2): 151-186 (2000) |
| 1999 |
|---|
| 40 | EE | Hubert Comon,
Claude Kirchner:
Constraint Solving on Terms.
CCL 1999: 47-103 |
| 39 | EE | Hubert Comon,
Yan Jurski:
Timed Automata and the Theory of Real Numbers.
CONCUR 1999: 242-257 |
| 38 | | Hubert Comon,
Mehmet Dincbas,
Jean-Pierre Jouannaud,
Claude Kirchner:
A Methodological View of Constraint Solving.
Constraints 4(4): 337-361 (1999) |
| 1998 |
|---|
| 37 | | Hubert Comon,
Yan Jurski:
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic.
CAV 1998: 268-279 |
| 36 | | Hubert Comon,
Paliath Narendran,
Robert Nieuwenhuis,
Michaël Rusinowitch:
Decision Problems in Ordered Rewriting.
LICS 1998: 276-286 |
| 35 | EE | Hubert Comon:
About Proofs by Consistency (Abstract).
RTA 1998: 136-137 |
| 34 | | Hubert Comon:
Completion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules.
J. Symb. Comput. 25(4): 397-419 (1998) |
| 33 | | Hubert Comon:
Completion of Rewrite Systems with Membership Constraints. Part II: Constraint Solving.
J. Symb. Comput. 25(4): 421-453 (1998) |
| 1997 |
|---|
| 32 | | Hubert Comon:
Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings
Springer 1997 |
| 31 | | Hubert Comon,
Yan Jurski:
Higher-Order Matching and Tree Automata.
CSL 1997: 157-176 |
| 30 | EE | Hubert Comon,
Florent Jacquemard:
Ground Reducibility is EXPTIME-Complete.
LICS 1997: 26-34 |
| 29 | EE | Hubert Comon,
Ralf Treinen:
The First-Order Theory of Lexicographic Path Orderings is Undecidable.
Theor. Comput. Sci. 176(1-2): 67-87 (1997) |
| 1996 |
|---|
| 28 | | Alexandre Boudet,
Hubert Comon:
Diophantine Equations, Presburger Arithmetic and Finite Automata.
CAAP 1996: 30-43 |
| 1995 |
|---|
| 27 | | Hubert Comon,
Jean-Pierre Jouannaud:
Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course
Springer 1995 |
| 26 | | Hubert Comon,
Robert Nieuwenhuis,
Albert Rubio:
Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract)
LICS 1995: 375-385 |
| 25 | | Hubert Comon:
Sequentiality, Second Order Monadic Logic and Tree Automata
LICS 1995: 508-517 |
| 24 | | Hubert Comon:
On Unification of Terms with Integer Exponents.
Mathematical Systems Theory 28(1): 67-88 (1995) |
| 1994 |
|---|
| 23 | | Hubert Comon,
Ralf Treinen:
Ordering Constraints on Trees.
CAAP 1994: 1-14 |
| 22 | | Hubert Comon:
Constraints in Term Algebras: An Overview of Constraint Solving Techniques
Constraint Programming 1994: 62-67 |
| 21 | | Anne-Cécile Caron,
Hubert Comon,
Jean-Luc Coquidé,
Max Dauchet,
Florent Jacquemard:
Pumping, Cleaning and Symbolic Constraints Solving.
ICALP 1994: 436-449 |
| 20 | | Hubert Comon,
Florent Jacquemard:
Ground Reducibility and Automata with Disequality Constraints.
STACS 1994: 151-162 |
| 19 | | Hubert Comon,
Marianne Haberstrau,
Jean-Pierre Jouannaud:
Syntacticness, Cycle-Syntacticness, and Shallow Theories
Inf. Comput. 111(1): 154-191 (1994) |
| 18 | | Hubert Comon,
Catherine Delor:
Equational Formulae with Membership Constraints
Inf. Comput. 112(2): 167-216 (1994) |
| 1993 |
|---|
| 17 | | Hubert Comon:
Constraints in Term Algebras (Short Survey).
AMAST 1993: 97-108 |
| 16 | | Alexandre Boudet,
Hubert Comon:
About the Theory of Tree Embedding.
TAPSOFT 1993: 376-390 |
| 15 | | Hubert Comon:
Complete Axiomatizations of Some Quotient Term Algebras.
Theor. Comput. Sci. 118(2): 167-191 (1993) |
| 1992 |
|---|
| 14 | | Hubert Comon:
Completion of Rewrite Systems with Membership Constraints.
ICALP 1992: 392-403 |
| 13 | | Hubert Comon,
Marianne Haberstrau,
Jean-Pierre Jouannaud:
Decidable Problems in Shallow Equational Theories (Extended Abstract)
LICS 1992: 255-265 |
| 12 | | Hubert Comon,
Maribel Fernández:
Negation Elimination in Equational Formulae.
MFCS 1992: 191-199 |
| 1991 |
|---|
| 11 | | Hubert Comon:
Disunification: A Survey.
Computational Logic - Essays in Honor of Alan Robinson 1991: 322-359 |
| 10 | | Hubert Comon:
Complete Axiomatizations of Some Quotient Term Algebras.
ICALP 1991: 469-480 |
| 9 | | Hubert Comon,
Denis Lugiez,
Ph. Schnoebelen:
A Rewrite-Based Type Discipline for a Subset of Computer Algebra.
J. Symb. Comput. 11(4): 349-368 (1991) |
| 1990 |
|---|
| 8 | | Hubert Comon:
Equational Formulas in Order-Sorted Algebras.
ICALP 1990: 674-688 |
| 7 | | Hubert Comon:
Solving Inequations in Term Algebras (Extended Abstract)
LICS 1990: 62-69 |
| 6 | | Hubert Comon:
Solving Symbolic Ordering Constraints.
Int. J. Found. Comput. Sci. 1(4): 387-412 (1990) |
| 1989 |
|---|
| 5 | | Hubert Comon:
Inductive Proofs by Specification Transformation.
RTA 1989: 76-91 |
| 4 | | Hubert Comon,
Pierre Lescanne:
Equational Problems and Disunification.
J. Symb. Comput. 7(3/4): 371-425 (1989) |
| 1988 |
|---|
| 3 | | Hubert Comon:
An Effective Method for Handling Initial Algebras.
ALP 1988: 108-118 |
| 1986 |
|---|
| 2 | | Jacques Calmet,
Hubert Comon,
Denis Lugiez:
Type Inference Using Unification in Computer Algebra.
AAECC 1986: 25-28 |
| 1 | | Hubert Comon:
Sufficient Completness, Term Rewriting Systems and "Anti-Unification".
CADE 1986: 128-140 |
