- Protocol security and algebraic properties: decision results for a bounded number of sessions
- The nite variant property: How to get rid of some algebraic properties. ?
- New decidability results for fragments of rst-order logic and application to cryptographic protocols
- Deducibility constraints # Sergiu Bursuc 1 , Hubert ComonLundh 1,2 , and Stephanie Delaune 1
- H. Comon and R. Nieuwenhuis Induction =
- Tree automata with one memory, set constraints and cryptographic protocols
- Computational Soundness of Observational Equivalence Hubert Comon-Lundh
- Equational Formulae with Membership Constraints \Lambda Hubert Comon y and Catherine Delor
- Logical Methods in Computer Science Vol. 4 (2:8) 2008, pp. 136
- The finite variant property: How to get rid of some algebraic properties. #
- H. Comon-Lundh and V. Shmatikov Constraint solving, exclusive or and the decision
- Sergiu Bursuc, Hubert ComonLundh and Stephanie Delaune
- Ground Reducibility is EXPTIMEcomplete Hubert Comon
- Ground Reducibility is EXPTIME-complete Hubert Comon1 and Florent Jacquemard2
- AssociativeCommutative Deducibility Constraints #
- Counter automata, fixpoints and additive theories \Lambda Hubert Comon and Yan Jurski
- ComonLundh LSV, Motivation(s)
- R'esolution de Contraintes dans des Alg`ebres de Termes Rapport d'Habilitation
- Multiple counters automata, safety analysis and Presburger arithmetic
- Constraints, , 1--26 (1997) fl 1997 Kluwer Academic Publishers, Boston. Manufactured in The Netherlands.
- Challenges in the Automated Verification of Security Protocols
- Les termes en logique et en programmation Version pr'eliminaire
- SOLVING SYMBOLIC ORDERING CONSTRAINTS \Lambda HUBERT COMON y
- The Confluence of Ground Term Rewrite Systems is Decidable in Polynomial Time \Lambda
- Security properties: two agents are sucient Hubert Comon-Lundh and V eronique Cortier ??
- Ground Reducibility is EXPTIMEcomplete Hubert Comon 1 and Florent Jacquemard 2
- S. Bursuc and H. Comon-Lundh Protocols, insecurity decision and
- R'esolution de contraintes symboliques A. Boudet et H. Comon
- H. Comon-Lundh and V. Cortier New decidability results
- The FirstOrder Theory of Lexicographic Path Orderings is Undecidable
- Security properties: two agents are sucient Hubert Comon-Lundh and V eronique Cortier ??
- Inductionless Induction Lecture Notes
- J. Symbolic Computation (1997) 11, 1--000 Completion of Rewrite Systems with Membership
- Orderings, ACTheories and Symbolic Constraint Solving (Extended Abstract) \Lambda
- Is it possible to decide whether a cryptographic protocol is secure or not ?
- On Unification of Terms with Integer Exponents Hubert Comon
- CALCULABILITE ET COMPLEXITE cours M2 du certificat C3 de la Maitrise
- RAPPORT TECHNIQUE PROUV Sufficient conditions on properties for an automated verification
- Easy Intruder Deductions Hubert Comon-Lundh and Ralf Treinen
- J. Symbolic Computation (1997) 11, 1--000 Completion of Rewrite Systems with Membership
- About the Theory of Tree Embedding Alexandre Boudet and Hubert Comon
- Disunification: a Survey Hubert COMON \Lambda
- Ordering Constraints on Trees Hubert Comon 1? and Ralf Treinen 2??
- Complete Axiomatizations of some Quotient Term Algebras \Lambda Hubert Comon y
- Deducibility constraints Sergiu Bursuc1
- Equational Problems and Disunification Hubert COMON and Pierre LESCANNE
- Sequentiality, Second Order Monadic Logic and Tree Automata CNRS and LRI
- Flatness is not a Weakness Hubert Comon and V'eronique Cortier
- A decision procedure for proving observational equivalence (Work in progress)
- Constraint solving techniques and enriching the model with equational
- Inductionless Induction Hubert Comon
- How to prove security of communication A discussion on the soundness of formal models
- Timed automata and the theory of real numbers Hubert Comon Yan Jurski
- Deducibility constraints, equational theory and electronic money #
- Tree automata with one memory, set constraints and ping-pong protocols ?
- Decision Problems in Ordered Rewriting H. Comon P. Narendran \Lambda R. Nieuwenhuis M. Rusinowitch
- Higherorder matching and tree automata Hubert Comon and Yan Jurski
- Syntacticness, CycleSyntacticness and Shallow Theories Hubert Comon, Marianne Haberstrau and JeanPierre Jouannaud \Lambday
- Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or
- Verification of Security Protocols with a Bounded Number of Sessions based on
- The finite variant property: How to get rid of some algebraic properties.
- Tree automata with one memory, set constraints and cryptographic protocols
- http://www.lsv.ens-cachan.fr/Publis/ In Proc. 12th European Symposium on Programming (ESOP'2003), Warsaw, Poland, Apr. 2003.
- Sequentiality, Monadic SecondOrder Logic and Tree Automata
- Constraints in Term Algebras (Short Survey)
- Automating security analysis: symbolic equivalence of constraint systems
- Deciding security properties for cryptographic protocols. Application to key cycles
- Sergiu Bursuc, Hubert Comon-Lundh and Stephanie Delaune
- Foundations of Software Technology and Theoretical Computer Science (Bangalore) 2008. Editors: R. Hariharan, M. Mukund, V. Vinay; pp 352-356
- Normal proofs in intruder theories Vincent Bernat and Hubert Comon-Lundh
- Tree Automata with Memory, Visibility and Structural Constraints
- Hubert Comon-Lundh Florent Jacquemard
- Associative-Commutative Deducibility Constraints
- Is it possible to decide whether a cryptographic protocol is secure or not?
- Complete Axiomatizations of some Quotient Term Algebras Hubert Comon*
- Inductive proofs by specification transformations Hubert COMON*
- Trace Equivalence Decision: Negative Tests and Non-determinism
