Hubert Comon-Lundh
Hubert Comon-Lundh
Computer Science professor, ENS Cachan
Adresse e-mail validée de lsv.ens-cachan.fr
Titre
Citée par
Citée par
Année
Tree automata techniques and applications
H Comon
http://www. grappa. univ-lille3. fr/tata, 1997
15201997
Tree automata techniques and applications (2007)
H Comon, M Dauchet, R Gilleron, F Jacquemard, D Lugiez, S Tison, ...
3772007
Equational problems anddisunification
H Comon, P Lescanne
Journal of Symbolic Computation 7 (3-4), 371-425, 1989
2911989
Multiple counters automata, safety analysis and Presburger arithmetic
H Comon, Y Jurski
International Conference on Computer Aided Verification, 268-279, 1998
2641998
Intruder deductions, constraint solving and insecurity decision in presence of exclusive or
H Comon-Lundh, V Shmatikov
18th Annual IEEE Symposium of Logic in Computer Science, 2003. Proceedings …, 2003
2402003
Disuni cation: a survey
H Comon
Computational Logic. Essays in honor of Alan Robinson, 322-359, 1991
1951991
The finite variant property: How to get rid of some algebraic properties
H Comon-Lundh, S Delaune
International Conference on Rewriting Techniques and Applications, 294-307, 2005
1812005
Diophantine equations, Presburger arithmetic and finite automata
A Boudet, H Comon
Colloquium on Trees in Algebra and Programming, 30-43, 1996
1501996
New decidability results for fragments of first-order logic and application to cryptographic protocols
H Comon-Lundh, V Cortier
International Conference on Rewriting Techniques and Applications, 148-164, 2003
1252003
Computational soundness of observational equivalence
H Comon-Lundh, V Cortier
Proceedings of the 15th ACM conference on Computer and communications …, 2008
1182008
Inductionless induction
H Comon
1121994
Unification et disunification: Théorie et applications
H Comon
Institut National Polytechnique de Grenoble-INPG, 1988
1121988
Timed automata and the theory of real numbers
H Comon, Y Jurski
International Conference on Concurrency Theory, 242-257, 1999
1101999
Is it possible to decide whether a cryptographic protocol is secure or not?
H Comon, V Shmatikov
Journal of Telecommunications and Information Technology, 5-15, 2002
1092002
Tree automata with one memory set constraints and cryptographic protocols
H Comon, V Cortier
Theoretical Computer Science 331 (1), 143-214, 2005
1032005
Solving symbolic ordering constraints
H Comon
International Journal of Foundations of Computer Science 1 (04), 387-411, 1990
1001990
Equational formulas with membership constraints
H Comon, C Delor
Information and Computation 112 (2), 167-216, 1994
961994
Trace equivalence decision: Negative tests and non-determinism
V Cheval, H Comon-Lundh, S Delaune
Proceedings of the 18th ACM conference on Computer and communications …, 2011
852011
Models and proofs of protocol security: A progress report
M Abadi, B Blanchet, H Comon-Lundh
International Conference on Computer Aided Verification, 35-49, 2009
812009
Security properties: two agents are sufficient
H Comon-Lundh, V Cortier
European Symposium On Programming, 99-113, 2003
792003
Le système ne peut pas réaliser cette opération maintenant. Veuillez réessayer plus tard.
Articles 1–20