default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDHubert Comon-Lundh
Hubert Comon
Person information
- affiliation: ENS Cachan, Paris, France
SPARQL queries 
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2020
[c60]Hubert Comon, Charlie Jacomme, Guillaume Scerri:
Oracle Simulation: A Technique for Protocol Composition with Long Term Shared Secrets. CCS 2020: 1427-1444
2010 – 2019
- 2017
- [j23]Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune:
A procedure for deciding symbolic equivalence between sets of constraint systems. Inf. Comput. 255: 94-125 (2017) - [c59]Hubert Comon, Adrien Koutsos:
Formal Computational Unlinkability Proofs of RFID Protocols. CSF 2017: 100-114 - [i6]Hubert Comon, Adrien Koutsos:
Formal Computational Unlinkability Proofs of RFID Protocols. CoRR abs/1705.02296 (2017) - 2014
- [j22]Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune:
Deducibility constraints and blind signatures. Inf. Comput. 238: 106-127 (2014) - [c58]Gergei Bana, Hubert Comon-Lundh:
A Computationally Complete Symbolic Attacker for Equivalence Properties. CCS 2014: 609-620 - 2013
- [c57]Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri:
Tractable Inference Systems: An Extension with a Deducibility Predicate. CADE 2013: 91-108 - [c56]Hubert Comon-Lundh:
LICS: Logic in Computer Security - Some Attacker's Models and Related Decision Problems. LICS 2013: 1 - 2012
- [j21]Hubert Comon-Lundh, Catherine Meadows:
Special Issue on Security and Rewriting Foreword. J. Autom. Reason. 48(2): 133-134 (2012) - [c55]Hubert Comon-Lundh, Masami Hagiya, Yusuke Kawamoto
, Hideki Sakurada:
Computational Soundness of Indistinguishability Properties without Computable Parsing. ISPEC 2012: 63-79 - [c54]Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri:
Security Proof with Dishonest Keys. POST 2012: 149-168 - [c53]Gergei Bana, Hubert Comon-Lundh:
Towards Unconditional Soundness: Computationally Complete Symbolic Attacker. POST 2012: 189-208 - [p3]Hubert Comon-Lundh, Stéphanie Delaune:
Formal Security Proofs. Software Safety and Security 2012: 26-63 - [i5]Hubert Comon-Lundh, Véronique Cortier, Guillaume Scerri:
Security proof with dishonest keys. IACR Cryptol. ePrint Arch. 2012: 8 (2012) - [i4]Gergei Bana, Hubert Comon-Lundh:
Towards Unconditional Soundness: Computationally Complete Symbolic Attacker. IACR Cryptol. ePrint Arch. 2012: 19 (2012) - 2011
- [c52]Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune:
Trace equivalence decision: negative tests and non-determinism. CCS 2011: 321-330 - [c51]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: 29-44 - [p2]Hubert Comon-Lundh, Stéphanie Delaune, Jonathan K. Millen:
Constraint solving techniques and enriching the model with equational theories. Formal Models and Techniques for Analyzing Security Protocols 2011: 35-61 - [i3]Hubert Comon-Lundh, Ralf Küsters, Catherine Meadows:
Security and Rewriting (Dagstuhl Seminar 11332). Dagstuhl Reports 1(8): 53-66 (2011) - 2010
- [j20]Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu:
Deciding security properties for cryptographic protocols. application to key cycles. ACM Trans. Comput. Log. 11(2): 9:1-9:42 (2010) - [c50]Vincent Cheval, Hubert Comon-Lundh, Stéphanie Delaune:
Automating Security Analysis: Symbolic Equivalence of Constraint Systems. IJCAR 2010: 412-426
2000 – 2009
- 2009
- [j19]Hubert Comon-Lundh, Yusuke Kawamoto, Hideki Sakurada:
Computational and Symbolic Anonymity in an Unbounded Network. JSIAM Lett. 1: 28-31 (2009) - [c49]Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune:
Deducibility Constraints. ASIAN 2009: 24-38 - [c48]Martín Abadi, Bruno Blanchet, Hubert Comon-Lundh:
Models and Proofs of Protocol Security: A Progress Report. CAV 2009: 35-49 - [c47]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: 1-20 - [c46]Sergiu Bursuc, Hubert Comon-Lundh:
Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions. RTA 2009: 133-147 - 2008
- [j18]Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin:
Visibly Tree Automata with Memory and Constraints. Log. Methods Comput. Sci. 4(2) (2008) - [c45]Hubert Comon-Lundh:
Challenges in the Automated Verification of Security Protocols. IJCAR 2008: 396-409 - [c44]Hubert Comon-Lundh, Véronique Cortier:
Computational soundness of observational equivalence. CCS 2008: 109-118 - [c43]Hubert Comon-Lundh:
About models of security protocols. FSTTCS 2008: 352-356 - [i2]Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin:
Visibly Tree Automata with Memory and Constraints. CoRR abs/0804.3065 (2008) - 2007
- [c42]Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune:
Deducibility Constraints, Equational Theory and Electronic Money. Rewriting, Computation and Proof 2007: 196-212 - [c41]Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin:
Tree Automata with Memory, Visibility and Structural Constraints. FoSSaCS 2007: 168-182 - [c40]Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune:
Associative-Commutative Deducibility Constraints. STACS 2007: 634-645 - [e5]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. Lecture Notes in Computer Science 4600, Springer 2007, ISBN 978-3-540-73146-7 [contents] - [i1]Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu:
Deciding security properties for cryptographic protocols. Application to key cycles. CoRR abs/0708.3564 (2007) - 2006
- [c39]Vincent Bernat, Hubert Comon-Lundh:
Normal Proofs in Intruder Theories. ASIAN 2006: 151-166 - 2005
- [j17]Hubert Comon, Véronique Cortier:
Tree automata with one memory set constraints and cryptographic protocols. Theor. Comput. Sci. 331(1): 143-214 (2005) - [c38]Hubert Comon-Lundh:
Normal Attacks on Security Protocols. Abstract State Machines 2005: 70 - [c37]Hubert Comon-Lundh, Stéphanie Delaune:
The Finite Variant Property: How to Get Rid of Some Algebraic Properties. RTA 2005: 294-307 - 2004
- [j16]Hubert Comon-Lundh, Véronique Cortier:
Security properties: two agents are sufficient. Sci. Comput. Program. 50(1-3): 51-71 (2004) - [c36]Hubert Comon-Lundh:
Intruder Theories (Ongoing Work). FoSSaCS 2004: 1-4 - 2003
- [j15]Hubert Comon, Florent Jacquemard:
Ground reducibility is EXPTIME-complete. Inf. Comput. 187(1): 123-153 (2003) - [j14]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) - [c35]Hubert Comon-Lundh, Ralf Treinen:
Easy Intruder Deductions. Verification: Theory and Practice 2003: 225-242 - [c34]Hubert Comon-Lundh, Véronique Cortier:
Security Properties: Two Agents Are Sufficient. ESOP 2003: 99-113 - [c33]Hubert Comon-Lundh, Vitaly Shmatikov:
Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or. LICS 2003: 271- - [c32]Hubert Comon-Lundh, Véronique Cortier:
New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols. RTA 2003: 148-164 - 2001
- [c31]Hubert Comon, Guillem Godoy, Robert Nieuwenhuis:
The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time. FOCS 2001: 298-307 - [c30]Hubert Comon, Véronique Cortier, John Mitchell:
Tree Automata with One Memory, Set Constraints, and Ping-Pong Protocols. ICALP 2001: 682-693 - [p1]Hubert Comon:
Inductionless Induction. Handbook of Automated Reasoning 2001: 913-962 - [e4]Gérard Berry, Hubert Comon, Alain Finkel:
Computer Aided Verification, 13th International Conference, CAV 2001, Paris, France, July 18-22, 2001, Proceedings. Lecture Notes in Computer Science 2102, Springer 2001, ISBN 3-540-42345-1 [contents] - [e3]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. Lecture Notes in Computer Science 2002, Springer 2001, ISBN 3-540-41950-0 [contents] - 2000
- [j13]Hubert Comon:
Sequentiality, Monadic Second-Order Logic and Tree Automata. Inf. Comput. 157(1-2): 25-51 (2000) - [j12]Hubert Comon, Robert Nieuwenhuis:
Induction=I-Axiomatization+First-Order Consistency. Inf. Comput. 159(1-2): 151-186 (2000) - [c29]Hubert Comon, Véronique Cortier:
Flatness Is Not a Weakness. CSL 2000: 262-276
1990 – 1999
- 1999
- [j11]Hubert Comon, Mehmet Dincbas, Jean-Pierre Jouannaud, Claude Kirchner:
A Methodological View of Constraint Solving. Constraints An Int. J. 4(4): 337-361 (1999) - [c28]Hubert Comon, Claude Kirchner:
Constraint Solving on Terms. CCL 1999: 47-103 - [c27]Hubert Comon, Yan Jurski:
Timed Automata and the Theory of Real Numbers. CONCUR 1999: 242-257 - 1998
- [j10]Hubert Comon:
Completion of Rewrite Systems with Membership Constraints. Part I: Deduction Rules. J. Symb. Comput. 25(4): 397-419 (1998) - [j9]Hubert Comon:
Completion of Rewrite Systems with Membership Constraints. Part II: Constraint Solving. J. Symb. Comput. 25(4): 421-453 (1998) - [c26]Hubert Comon, Yan Jurski:
Multiple Counters Automata, Safety Analysis and Presburger Arithmetic. CAV 1998: 268-279 - [c25]Hubert Comon, Paliath Narendran, Robert Nieuwenhuis, Michaël Rusinowitch:
Decision Problems in Ordered Rewriting. LICS 1998: 276-286 - [c24]Hubert Comon:
About Proofs by Consistency (Abstract). RTA 1998: 136-137 - 1997
- [j8]Hubert Comon, Ralf Treinen:
The First-Order Theory of Lexicographic Path Orderings is Undecidable. Theor. Comput. Sci. 176(1-2): 67-87 (1997) - [c23]Hubert Comon, Yan Jurski:
Higher-Order Matching and Tree Automata. CSL 1997: 157-176 - [c22]Hubert Comon, Florent Jacquemard:
Ground Reducibility is EXPTIME-Complete. LICS 1997: 26-34 - [e2]Hubert Comon:
Rewriting Techniques and Applications, 8th International Conference, RTA-97, Sitges, Spain, June 2-5, 1997, Proceedings. Lecture Notes in Computer Science 1232, Springer 1997, ISBN 3-540-62950-5 [contents] - 1996
- [c21]Alexandre Boudet, Hubert Comon:
Diophantine Equations, Presburger Arithmetic and Finite Automata. CAAP 1996: 30-43 - 1995
- [j7]Hubert Comon:
On Unification of Terms with Integer Exponents. Math. Syst. Theory 28(1): 67-88 (1995) - [c20]Hubert Comon, Robert Nieuwenhuis, Albert Rubio:
Orderings, AC-Theories and Symbolic Constraint Solving (Extended Abstract). LICS 1995: 375-385 - [c19]Hubert Comon:
Sequentiality, Second Order Monadic Logic and Tree Automata. LICS 1995: 508-517 - [c18]Hubert Comon:
Linear diophantine equations, Presburger arithmetic and finite automata. UNIF 1995: 13 - [e1]Hubert Comon, Jean-Pierre Jouannaud:
Term Rewriting, French Spring School of Theoretical Computer Science, Font Romeux, France, May 17-21, 1993, Advanced Course. Lecture Notes in Computer Science 909, Springer 1995, ISBN 3-540-59340-3 [contents] - 1994
- [j6]Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud:
Syntacticness, Cycle-Syntacticness, and Shallow Theories. Inf. Comput. 111(1): 154-191 (1994) - [j5]Hubert Comon, Catherine Delor:
Equational Formulae with Membership Constraints. Inf. Comput. 112(2): 167-216 (1994) - [c17]Hubert Comon, Ralf Treinen:
Ordering Constraints on Trees. CAAP 1994: 1-14 - [c16]Anne-Cécile Caron, Hubert Comon, Jean-Luc Coquidé, Max Dauchet, Florent Jacquemard:
Pumping, Cleaning and Symbolic Constraints Solving. ICALP 1994: 436-449 - [c15]Hubert Comon, Florent Jacquemard:
Ground Reducibility and Automata with Disequality Constraints. STACS 1994: 151-162 - [c14]Hubert Comon:
Constraints in Term Algebras: An Overview of Constraint Solving Techniques. Constraint Programming 1994: 62-67 - 1993
- [j4]Hubert Comon:
Complete Axiomatizations of Some Quotient Term Algebras. Theor. Comput. Sci. 118(2): 167-191 (1993) - [c13]Hubert Comon:
Constraints in Term Algebras (Short Survey). AMAST 1993: 97-108 - [c12]Alexandre Boudet, Hubert Comon:
About the Theory of Tree Embedding. TAPSOFT 1993: 376-390 - 1992
- [c11]Hubert Comon:
Completion of Rewrite Systems with Membership Constraints. ICALP 1992: 392-403 - [c10]Hubert Comon, Marianne Haberstrau, Jean-Pierre Jouannaud:
Decidable Problems in Shallow Equational Theories (Extended Abstract). LICS 1992: 255-265 - [c9]Hubert Comon, Maribel Fernández:
Negation Elimination in Equational Formulae. MFCS 1992: 191-199 - 1991
- [j3]Hubert Comon, Denis Lugiez, Philippe Schnoebelen:
A Rewrite-Based Type Discipline for a Subset of Computer Algebra. J. Symb. Comput. 11(4): 349-368 (1991) - [c8]Hubert Comon:
Disunification: A Survey. Computational Logic - Essays in Honor of Alan Robinson 1991: 322-359 - [c7]Hubert Comon:
Complete Axiomatizations of Some Quotient Term Algebras. ICALP 1991: 469-480 - 1990
- [j2]Hubert Comon:
Solving Symbolic Ordering Constraints. Int. J. Found. Comput. Sci. 1(4): 387-412 (1990) - [c6]Hubert Comon:
Equational Formulas in Order-Sorted Algebras. ICALP 1990: 674-688 - [c5]Hubert Comon:
Solving Inequations in Term Algebras (Extended Abstract). LICS 1990: 62-69
1980 – 1989
- 1989
- [j1]Hubert Comon, Pierre Lescanne:
Equational Problems and Disunification. J. Symb. Comput. 7(3/4): 371-425 (1989) - [c4]Hubert Comon:
Inductive Proofs by Specification Transformation. RTA 1989: 76-91 - 1988
- [b1]Hubert Comon:
Unification et disunification : théorie et applications. (Unification and disunification in free algebras and in initial algebras : theory and applications). Grenoble Institute of Technology, France, 1988 - [c3]Hubert Comon:
An Effective Method for Handling Initial Algebras. ALP 1988: 108-118 - 1986
- [c2]Jacques Calmet, Hubert Comon, Denis Lugiez:
Type Inference Using Unification in Computer Algebra. AAECC 1986: 25-28 - [c1]Hubert Comon:
Sufficient Completness, Term Rewriting Systems and "Anti-Unification". CADE 1986: 128-140
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-04-24 23:21 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
