• Teaching
• Software Engineering
• Functional programming
• Object Oriented Programming, UML, Design patterns
• Formal Methods (B and Why frameworks, PVS proof assistant)
• First order logic, rewriting and proof by induction in proof assistants
• Introduction to cryptographic Protocols and their verification. (If you are french speaking, you can find here Teaching material and even a video (!!) of a shortened version of this course)

• Research Themes
• Verification
• Term Rewriting
• Tree Automata
• Reachability analysis over Term Rewriting Systems. New! have a look to my Habilitation document on this subject
• Cryptographic Protocol Verification
• Tools and projects
• : a tree automata library  (in OCaml)  for achieving reachability analysis over Term Rewriting Systems
• : a Security Protocol ANimator for AVISPA
• Copster: COmpiling Program Semantics into TErm Rewriting
  
• ACI SATIN : Security Analysis for Trusted Infrastructures and Network protocols
• Projet ANR RAVAJ : Rewriting and Approximations for Verification of Java Applets

• Publications

Last Modified: 30/11/06