The SCEAS System
| |||||||

## Search the dblp DataBase
Hubert Comon-Lundh:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
## Publications of Author- Hubert Comon-Lundh, Ralf Treinen
**Easy Intruder Deductions.**[Citation Graph (0, 0)][DBLP] Verification: Theory and Practice, 2003, pp:225-242 [Conf] - Hubert Comon-Lundh, Véronique Cortier
**Security Properties: Two Agents Are Sufficient.**[Citation Graph (0, 0)][DBLP] ESOP, 2003, pp:99-113 [Conf] - Hubert Comon-Lundh
**Intruder Theories (Ongoing Work).**[Citation Graph (0, 0)][DBLP] FoSSaCS, 2004, pp:1-4 [Conf] - Hubert Comon-Lundh, Vitaly Shmatikov
**Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or.**[Citation Graph (0, 0)][DBLP] LICS, 2003, pp:271-0 [Conf] - Hubert Comon-Lundh, Véronique Cortier
**New Decidability Results for Fragments of First-Order Logic and Application to Cryptographic Protocols.**[Citation Graph (0, 0)][DBLP] RTA, 2003, pp:148-164 [Conf] - Hubert Comon-Lundh, Stéphanie Delaune
**The Finite Variant Property: How to Get Rid of Some Algebraic Properties.**[Citation Graph (0, 0)][DBLP] RTA, 2005, pp:294-307 [Conf] - Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune
**Associative-Commutative Deducibility Constraints.**[Citation Graph (0, 0)][DBLP] STACS, 2007, pp:634-645 [Conf] - Hubert Comon-Lundh, Véronique Cortier
**Security properties: two agents are sufficient.**[Citation Graph (0, 0)][DBLP] Sci. Comput. Program., 2004, v:50, n:1-3, pp:51-71 [Journal] - Hubert Comon-Lundh
**Normal Attacks on Security Protocols.**[Citation Graph (0, 0)][DBLP] Abstract State Machines, 2005, pp:70- [Conf] - Sergiu Bursuc, Hubert Comon-Lundh, Stéphanie Delaune
**Deducibility Constraints, Equational Theory and Electronic Money.**[Citation Graph (0, 0)][DBLP] Rewriting, Computation and Proof, 2007, pp:196-212 [Conf] - Hubert Comon-Lundh, Florent Jacquemard, Nicolas Perrin
**Tree Automata with Memory, Visibility and Structural Constraints.**[Citation Graph (0, 0)][DBLP] FoSSaCS, 2007, pp:168-182 [Conf] - Hubert Comon-Lundh, Véronique Cortier, Eugen Zalinescu
**Deciding security properties for cryptographic protocols. Application to key cycles**[Citation Graph (0, 0)][DBLP] CoRR, 2007, v:0, n:, pp:- [Journal] **Normal Proofs in Intruder Theories.**[Citation Graph (, )][DBLP]**Deducibility Constraints.**[Citation Graph (, )][DBLP]**Challenges in the Automated Verification of Security Protocols.**[Citation Graph (, )][DBLP]**Automating Security Analysis: Symbolic Equivalence of Constraint Systems.**[Citation Graph (, )][DBLP]**Models and Proofs of Protocol Security: A Progress Report.**[Citation Graph (, )][DBLP]**Computational soundness of observational equivalence.**[Citation Graph (, )][DBLP]**About models of security protocols.**[Citation Graph (, )][DBLP]**Protocol Security and Algebraic Properties: Decision Results for a Bounded Number of Sessions.**[Citation Graph (, )][DBLP]**Verification of Security Protocols with a Bounded Number of Sessions Based on Resolution for Rigid Variables.**[Citation Graph (, )][DBLP]**Visibly Tree Automata with Memory and Constraints**[Citation Graph (, )][DBLP]
Search in 0.002secs, Finished in 0.003secs | |||||||

| |||||||

| |||||||

System created by asidirop@csd.auth.gr [http://users.auth.gr/~asidirop/] © 2002 for Data Engineering Laboratory, Department of Informatics, Aristotle University © 2002 |