====== Arthur Milchior ======
==== Current position ====

ATER  at [[http://www.lacl.fr/| LACL, Université Paris-Est Créteil Val de Marne]]. 

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

==== Publication with referees ====
=== Conference ===
  * [[https://hal.inria.fr/hal-01111533|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 
  * [[http://www.tamc2017.unibe.ch/program.html|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. ([[https://arxiv.org/abs/1610.06027|Long version]])
=== Journaux ===
  * {{:users:milchior:spectra.pdf|Spectra and satisfiability for logics with successor and a unary function}}. Accepted by Mathematical Logic Quartertly in 2016 
  * {{:users:milchior:comput.pdf|Undecidability of satisfiability of expansions of FO(<) with a Semilinear Non Regular Predicate over words.}} Accepted by the journal Computability in september 2016 
==== PhD ====
  * {{users:milchior:these.pdf|My PhD manuscript}} : //Logique du premier ordre, relations d'entiers et automates dans une base fixe// and its {{ :users:milchior:soutenance.pdf |slides}}.
==== Talks without publication ====
== International conference ==
  * [[http://www.cant.ulg.ac.be/jm2016/participants.html|16th Mons Theoretical Computer Science Days]] 6th september 2016, {{ :users:milchior:jim.pdf|Automata and FO [R; +, <, 1 ]-definable set of reals}}.
  * [[http://jaf35.campus.ciencias.ulisboa.pt/| Journées sur les Arithmétiques Faibles]] 7th of June 2016,  {{:users:milchior:jaf-milchior.pdf|Undecidability of satisfiability of  expansions of FO[<] over words with a FO[+]-definable set}}
  * [[http://highlights-conference.org/old/2015.php|Higlight 2015]], September 2015, {{:users:milchior:spectra-hl.pdf|Satisfiability and Spectra of some logics}}
  * [[http://highlights-conference.org/old/2014.php|Higlight 2014]], September 2014, {{ :users:milchior:2014.pdf |Automata and FO[R, +, <]}}
  * [[http://highlights-conference.org/old/2013.php|Higlight 2013]], September 2013, {{ :users:milchior:10b-3-milchior.pdf |Automaton and FO[N^r , <, mod]}}.
== Seminars ==
  * [[https://www.irif.univ-paris-diderot.fr/seminaires/automates/index|Séminaire automate de l'IRIF]], 17th of june 2016, {{:users:milchior:seminaire-automate.pdf|Automata and FO[\N,<,\moda]-definable integer relations}}

==== Pre Print ====
  * [[http://arxiv.org/abs/1407.4032|A Note on Higher Order and Variable Order Logic over Finite Models]]
  * [[https://arxiv.org/abs/1703.04834|A Quasi-Linear Time Algorithm Deciding Whether Weak Büchi Automata Reading Vectors of Reals Recognize Saturated Languages]]
  * [[https://arxiv.org/abs/1701.00305|(Quasi-)linear time algorithm to compute LexDFS, LexUP and LexDown orderings]]
  * [[https://arxiv.org/abs/1611.03839|Uniform definition of sets using relations and complement of Presburger Arithmetic]]


====== Teaching ======
=== Lecture ===
  * System and Network (x2) 44 hours of lectures and of labs
=== 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 ======
* {{ :users:milchior:cv.pdf |CV}}

{{page>inc&noheader&nofooter}}