| Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
| 1 | Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri |
Security proof with dishonest keys.  |
IACR Cryptology ePrint Archive  |
2012 |
DBLP BibTeX RDF |
|
| 1 | Gergei Bana, Hubert Comon-Lundh |
Towards Unconditional Soundness: Computationally Complete Symbolic Attacker. |
IACR Cryptology ePrint Archive |
2012 |
DBLP BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Catherine Meadows |
Special Issue on Security and Rewriting Foreword. |
J. Autom. Reasoning |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Masami Hagiya, Yusuke Kawamoto, Hideki Sakurada |
Computational Soundness of Indistinguishability Properties without Computable Parsing. |
ISPEC |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri |
Security Proof with Dishonest Keys. |
POST |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Gergei Bana, Hubert Comon-Lundh |
Towards Unconditional Soundness: Computationally Complete Symbolic Attacker. |
POST |
2012 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Ralf Küsters, Catherine Meadows |
Security and Rewriting (Dagstuhl Seminar 11332). |
Dagstuhl Reports |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Véronique Cortier |
How to prove security of communication protocols? A discussion on the soundness of formal models w.r.t. computational ones. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune |
Trace equivalence decision: negative tests and non-determinism. |
ACM Conference on Computer and Communications Security |
2011 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu |
Deciding security properties for cryptographic protocols. application to key cycles. |
ACM Trans. Comput. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune |
Automating Security Analysis: Symbolic Equivalence of Constraint Systems. |
IJCAR |
2010 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune |
Deducibility Constraints. |
ASIAN |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergiu Bursuc, Hubert Comon-Lundh |
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions. |
RTA |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Martín Abadi, Bruno Blanchet, Hubert Comon-Lundh |
Models and Proofs of Protocol Security: A Progress Report. |
CAV |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Reynald Affeldt, Hubert Comon-Lundh |
Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables. |
Formal to Practical Security |
2009 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin |
Visibly Tree Automata with Memory and Constraints. |
Logical Methods in Computer Science |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin |
Visibly Tree Automata with Memory and Constraints |
CoRR |
2008 |
DBLP BibTeX RDF |
|
| 1 | Hubert Comon-Lundh |
Challenges in the Automated Verification of Security Protocols. |
IJCAR |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh |
About models of security protocols. |
FSTTCS |
2008 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Véronique Cortier |
Computational soundness of observational equivalence. |
ACM Conference on Computer and Communications Security |
2008 |
DBLP DOI BibTeX RDF |
security, cryptography, protocols, concurrency |
| 1 | Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu |
Deciding security properties for cryptographic protocols. Application to key cycles |
CoRR |
2007 |
DBLP BibTeX RDF |
|
| 1 | Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune |
Associative-Commutative Deducibility Constraints. |
STACS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune |
Deducibility Constraints, Equational Theory and Electronic Money. |
Rewriting, Computation and Proof |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Claude Kirchner, Hélène Kirchner (eds.) |
Rewriting, Computation and Proof, Essays Dedicated to Jean-Pierre Jouannaud on the Occasion of His 60th Birthday |
Rewriting, Computation and Proof |
2007 |
DBLP BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin |
Tree Automata with Memory, Visibility and Structural Constraints. |
FoSSaCS |
2007 |
DBLP DOI BibTeX RDF |
|
| 1 | Vincent Bernat, Hubert Comon-Lundh |
Normal Proofs in Intruder Theories. |
ASIAN |
2006 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Véronique Cortier |
Tree automata with one memory set constraints and cryptographic protocols. |
Theor. Comput. Sci. |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Stéphanie Delaune |
The Finite Variant Property: How to Get Rid of Some Algebraic Properties. |
RTA |
2005 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh |
Normal Attacks on Security Protocols. |
Abstract State Machines |
2005 |
DBLP BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Véronique Cortier |
Security properties: two agents are sufficient. |
Sci. Comput. Program. |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh |
Intruder Theories (Ongoing Work). |
FoSSaCS |
2004 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Florent Jacquemard |
Ground reducibility is EXPTIME-complete. |
Inf. Comput. |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch |
Deciding the confluence of ordered term rewrite systems. |
ACM Trans. Comput. Log. |
2003 |
DBLP DOI BibTeX RDF |
ordered rewriting, path orderings, Rewrite systems, confluence |
| 1 | Hubert Comon-Lundh, Véronique Cortier |
New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols. |
RTA |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Ralf Treinen |
Easy Intruder Deductions. |
Verification: Theory and Practice |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Vitaly Shmatikov |
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or. |
LICS |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon-Lundh, Véronique Cortier |
Security Properties: Two Agents Are Sufficient. |
ESOP |
2003 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
Inductionless Induction. |
Handbook of Automated Reasoning |
2001 |
DBLP BibTeX RDF |
|
| 1 | Hubert Comon, Véronique Cortier, John Mitchell |
Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols. |
ICALP |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Gérard Berry, Hubert Comon, Alain Finkel (eds.) |
Computer Aided Verification, 13th International Conference, CAV 2001, Paris, France, July 18-22, 2001, Proceedings |
CAV |
2001 |
DBLP BibTeX RDF |
|
| 1 | Hubert Comon, Guillem Godoy, Robert Nieuwenhuis |
The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. |
FOCS |
2001 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Claude Marché, Ralf Treinen (eds.) |
Constraints in Computational Logics: Theory and Applications, International Summer School, CCL'99 Gif-sur-Yvette, France, September 5-8, 1999, Revised Lectures |
CCL |
2001 |
DBLP BibTeX RDF |
|
| 1 | Hubert Comon |
Sequentiality, Monadic Second-Order Logic and Tree Automata. |
Inf. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Robert Nieuwenhuis |
Induction=I-Axiomatization+First-Order Consistency. |
Inf. Comput. |
2000 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Véronique Cortier |
Flatness Is Not a Weakness. |
CSL |
2000 |
DBLP DOI BibTeX RDF |
Counter automata, model-checking, verification, temporal logics, logic in computer science |
| 1 | Hubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud, Claude Kirchner |
A Methodological View of Constraint Solving. |
Constraints |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Yan Jurski |
Timed Automata and the Theory of Real Numbers. |
CONCUR |
1999 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Claude Kirchner |
Constraint Solving on Terms. |
CCL |
1999 |
DBLP BibTeX RDF |
|
| 1 | Hubert Comon |
Completion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules. |
J. Symb. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
Completion of Rewrite Systems with Membership Constraints. Part II: Constraint Solving. |
J. Symb. Comput. |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
About Proofs by Consistency (Abstract). |
RTA |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Yan Jurski |
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic. |
CAV |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch |
Decision Problems in Ordered Rewriting. |
LICS |
1998 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Ralf Treinen |
The First-Order Theory of Lexicographic Path Orderings is Undecidable. |
Theor. Comput. Sci. |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon (eds.) |
Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings |
RTA |
1997 |
DBLP BibTeX RDF |
|
| 1 | Hubert Comon, Florent Jacquemard |
Ground Reducibility is EXPTIME-Complete. |
LICS |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Yan Jurski |
Higher-Order Matching and Tree Automata. |
CSL |
1997 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandre Boudet, Hubert Comon |
Diophantine Equations, Presburger Arithmetic and Finite Automata. |
CAAP |
1996 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
On Unification of Terms with Integer Exponents. |
Mathematical Systems Theory |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Robert Nieuwenhuis, Albert Rubio |
Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract) |
LICS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
Sequentiality, Second Order Monadic Logic and Tree Automata |
LICS |
1995 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Jean-Pierre Jouannaud (eds.) |
Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course |
Term Rewriting |
1995 |
DBLP BibTeX RDF |
|
| 1 | Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud |
Syntacticness, Cycle-Syntacticness, and Shallow Theories |
Inf. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Catherine Delor |
Equational Formulae with Membership Constraints |
Inf. Comput. |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
Constraints in Term Algebras: An Overview of Constraint Solving Techniques |
Constraint Programming |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard |
Pumping, Cleaning and Symbolic Constraints Solving. |
ICALP |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Florent Jacquemard |
Ground Reducibility and Automata with Disequality Constraints. |
STACS |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Ralf Treinen |
Ordering Constraints on Trees. |
CAAP |
1994 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
Complete Axiomatizations of Some Quotient Term Algebras. |
Theor. Comput. Sci. |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Alexandre Boudet, Hubert Comon |
About the Theory of Tree Embedding. |
TAPSOFT |
1993 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
Constraints in Term Algebras (Short Survey). |
AMAST |
1993 |
DBLP BibTeX RDF |
|
| 1 | Hubert Comon |
Completion of Rewrite Systems with Membership Constraints. |
ICALP |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Maribel Fernández |
Negation Elimination in Equational Formulae. |
MFCS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud |
Decidable Problems in Shallow Equational Theories (Extended Abstract) |
LICS |
1992 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Denis Lugiez, Ph. Schnoebelen |
A Rewrite-Based Type Discipline for a Subset of Computer Algebra. |
J. Symb. Comput. |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
Complete Axiomatizations of Some Quotient Term Algebras. |
ICALP |
1991 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
Disunification: A Survey. |
Computational Logic - Essays in Honor of Alan Robinson |
1991 |
DBLP BibTeX RDF |
|
| 1 | Hubert Comon |
Solving Symbolic Ordering Constraints. |
Int. J. Found. Comput. Sci. |
1990 |
DBLP BibTeX RDF |
|
| 1 | Hubert Comon |
Equational Formulas in Order-Sorted Algebras. |
ICALP |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
Solving Inequations in Term Algebras (Extended Abstract) |
LICS |
1990 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon, Pierre Lescanne |
Equational Problems and Disunification. |
J. Symb. Comput. |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
Inductive Proofs by Specification Transformation. |
RTA |
1989 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
An Effective Method for Handling Initial Algebras. |
ALP |
1988 |
DBLP DOI BibTeX RDF |
|
| 1 | Hubert Comon |
Sufficient Completness, Term Rewriting Systems and "Anti-Unification". |
CADE |
1986 |
DBLP DOI BibTeX RDF |
|
| 1 | Jacques Calmet, Hubert Comon, Denis Lugiez |
Type Inference Using Unification in Computer Algebra. |
AAECC |
1986 |
DBLP DOI BibTeX RDF |
|
![[Valid RSS]](Pics/valid-rss.png "Validate my RSS feed")