ATER at LACL, Université Paris-Est Créteil Val de Marne.

• First order logic over integers
• Weak arithmetic (below addition)
• Logic over words
• First order logic over reals
• Deterministic automata accepting numbers
• High-order logic

• 3D Hardware Canaries, with Sébastien Briais and Stéphane Caron, Jean{-}Michel Cioranesco, Jean{-}Luc Danger, Sylvain Guilley, Jacques-Henri Jourdan, David Naccache and Thibault Porteboeuf, in Cryptographic Hardware and Embedded Systems, 2012
• Büchi Automata Recognizing Sets of Reals Definable in First-Order Logic with Addition and Order, Arthur Milchior, Theory and Applications of Models of Computation, 20 April 2017, Springer LNCS. (Long version)

• Spectra and satisfiability for logics with successor and a unary function. Accepted by Mathematical Logic Quartertly in 2016
• Undecidability of satisfiability of expansions of FO(<) with a Semilinear Non Regular Predicate over words. Accepted by the journal Computability in september 2016

• My PhD manuscript : Logique du premier ordre, relations d'entiers et automates dans une base fixe and its slides.

• 16th Mons Theoretical Computer Science Days 6th september 2016, Automata and FO [R; +, <, 1 ]-definable set of reals.
• Journées sur les Arithmétiques Faibles 7th of June 2016, Undecidability of satisfiability of expansions of FO[<] over words with a FO[+]-definable set
• Higlight 2015, September 2015, Satisfiability and Spectra of some logics
• Higlight 2014, September 2014, Automata and FO[R, +, <]
• Higlight 2013, September 2013, Automaton and FO[N^r , <, mod].

• Séminaire automate de l'IRIF, 17th of june 2016, Automata and FO[\N,<,\moda]-definable integer relations

• A Note on Higher Order and Variable Order Logic over Finite Models
• A Quasi-Linear Time Algorithm Deciding Whether Weak Büchi Automata Reading Vectors of Reals Recognize Saturated Languages
• (Quasi-)linear time algorithm to compute LexDFS, LexUP and LexDown orderings
• Uniform definition of sets using relations and complement of Presburger Arithmetic

• System and Network (x2) 44 hours of lectures and of labs

Each class is composed of approximately 20 students

• Languages and Automata (x2) 36 hours of theoretical exercices
• Languages and Automata 24 hours of exercice, 24 hours on computes,
• Functional programing (oCaml) 36 hours on computer
• Internet and tools (html, mysql, php) (x2) 48 hours on computers
• Object oriented programing (Java) 24 hours on computer
• Data structure (Java) 36 hours on computer
• Introduction to computation (Ada) 64 hours of theory and computer exercice.

* CV