Seguir
Hubert Comon-Lundh
Hubert Comon-Lundh
Computer Science professor, ENS Cachan
Dirección de correo verificada de lsv.ens-cachan.fr
Título
Citado por
Citado por
Año
Tree automata techniques and applications
H Comon, M Dauchet, R Gilleron, F Jacquemard, D Lugiez, C Löding, ...
16772008
Tree automata techniques and applications (2007)
H Comon, M Dauchet, R Gilleron, F Jacquemard, D Lugiez, S Tison, ...
4312007
Equational problems anddisunification
H Comon, P Lescanne
Journal of Symbolic Computation 7 (3-4), 371-425, 1989
3251989
Multiple counters automata, safety analysis and Presburger arithmetic
H Comon, Y Jurski
Computer Aided Verification: 10th International Conference, CAV'98 Vancouver …, 1998
2911998
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
2532003
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
2242005
Disuni cation: a survey
H Comon
Computational Logic. MIT Press, Cambridge, MA, 1991
2131991
Diophantine equations, Presburger arithmetic and finite automata
A Boudet, H Comon
Trees in Algebra and Programming—CAAP'96: 21st International Colloquium …, 1996
1631996
Computational soundness of observational equivalence
H Comon-Lundh, V Cortier
Proceedings of the 15th ACM conference on Computer and communications …, 2008
1302008
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
1272003
Inductionless induction
H Comon
Handbook of Automated Reasoning, 913-962, 2001
1232001
Timed automata and the theory of real numbers
H Comon, Y Jurski
International Conference on Concurrency Theory, 242-257, 1999
1161999
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
1132002
Completion of rewrite systems with membership constraints Part I: Deduction rules
H Comon
Journal of Symbolic Computation 25 (4), 397-419, 1998
113*1998
Equational formulas with membership constraints
H Comon, C Delor
Information and Computation 112 (2), 167-216, 1994
1101994
Unification et disunification: Théorie et applications
H Comon
Institut National Polytechnique de Grenoble-INPG, 1988
1091988
Tree automata with one memory set constraints and cryptographic protocols
H Comon, V Cortier
Theoretical Computer Science 331 (1), 143-214, 2005
1062005
Models and proofs of protocol security: A progress report
M Abadi, B Blanchet, H Comon-Lundh
Computer Aided Verification: 21st International Conference, CAV 2009 …, 2009
1022009
Solving symbolic ordering constraints
H Comon
International Journal of Foundations of Computer Science 1 (04), 387-411, 1990
1021990
Security properties: two agents are sufficient
H Comon-Lundh, V Cortier
European Symposium On Programming, 99-113, 2003
962003
El sistema no puede realizar la operación en estos momentos. Inténtalo de nuevo más tarde.
Artículos 1–20