Academic Homepage *

Vincent Hugot

vincent.hugot@insa-cvl.fr

Contents

1  General Information

I am an Associate Professor of Computer Science in the SDS team of the LIFO, teaching at the INSA CVL in Bourges.

My research interests fall mainly within the perimeter of “formal verification”, and include various aspects of automata and transducers theory, term rewriting, formal logic, and their applications.

I currently supervise the CIFRE Ph.D. thesis of Adrien Jousse on the cybersecurity of automotive networks. The industrial partner of this thesis is the automotive supplier Valeo, where Benjamin Venelle supervises. It is directed by Christian Toinard.

1.1  Past Affiliations and Activities

1.1.1  Inria Links, Lille, 2013–2017

I have been a member of the Inria team Links (formerly Mostrare), under the direction of Joachim Niehren, from October 2013 to August 2017, successively as a post-doctoral fellow, research engineer, and Temporary Research and Teaching Attaché (ATER), teaching at Lille 1. I worked within the ANR CoLiS.

1.1.2  University of Franche-Comté, VESONTIO, 2011–2013

I received my Ph.D. in Computer Science in 2013 from the University of Franche-Comté, working in the VESONTIO team of the DISC/LIFC department of the CNRS research institute FEMTO-ST (UMR 6174); I was also a member of the Inria/CASSIS team, and my Ph.D. was financed by the Inria and the Direction Générale de l’Armement (DGA).

Thesis title: Tree Automata, Approximations, and Constraints for VerificationTree (Not Quite) Regular Model-Checking. Supervised by: Prs. Kouchnarenko and Héam. The manuscript can be downloaded below.

1.2  Publications and Talks

This section is intended to keep track of my papers and given talks. PDF versions of the papers and the related slides are provided for download whenever possible.

To extract bibliographic entries for BibTEX and similar software, see also DBLP and SmartHal.

1.2.1  Current Drafts (Works in progress / submission / revisions)

  1. oMAC : Open Model for Automotive Cybersecurity
    co-authors: A. Jousse, C. Toinard, B. Venelle
    Conference paper   —  2019
  2. Positively Approximating LTL Properties over Rewrite Rules
    co-authors: P.C. Héam, O. Kouchnarenko
    Journal version; work on topic currently on hiatus.   —  

1.2.2  Latest Peer-Reviewed Papers (Accepted & Soon to be Published)

1.2.3  Published (Peer-Reviewed) Papers

  1. Logics for Unordered Trees with Data Constraints
    co-authors: A. Boiret, J. Niehren, R. Treinen
    Elsevier — International Journal Journal of Computer and System Sciences   —  January 2019
  2. Equivalence of Symbolic Tree Transducers
    co-authors: A. Boiret, J. Niehren
    Springer LNCS – International Conference DLT’17   —  August 2017
  3. Automata for Unordered Trees
    co-authors: A. Boiret, J. Niehren, R. Treinen
    Elsevier — International Journal Information & Computation   —  April 2017
  4. The Emptiness Problem for Tree Automata with at Least One Disequality Constraint is NP-hard
    co-authors: P.C. Héam, O. Kouchnarenko
    Elsevier — International Journal Information Processing Letters.   —  February 2017
  5. Logics for Unordered Trees with Data Constraints on Siblings
    co-authors: A. Boiret, J. Niehren, R. Treinen
    Springer LNCS – International Conference LATA’15   —  March 2015
  6. Deterministic Automata for Unordered Trees
    co-authors: A. Boiret, J. Niehren, R. Treinen
    EPTCS – International Symposium GandALF’14   —  July 2014
  7. Loops and Overloops for Tree Walking Automata (Extended Version)
    co-authors: P.C. Héam, O. Kouchnarenko
    Elsevier – International Journal TCS   —  December 2011 – March 2012
    Additional webpage and slides.
  8. From Linear Temporal Logic Properties to Rewrite Propositions
    co-authors: P.C. Héam, O. Kouchnarenko
    Springer LNCS – International Conference IJCAR’12 (Long Paper)   —  Jan 2012
    Corresponding slides.
  9. On Positive TAGED with a Bounded Number of Constraints
    co-authors: P.C. Héam, O. Kouchnarenko
    Springer LNCS – International Conference CIAA’12 (Short Paper)   —  March 2012
    Corresponding slides.
  10. Loops and Overloops for Tree Walking Automata
    co-authors: P.C. Héam, O. Kouchnarenko
    Springer LNCS – International Conference CIAA’11 (Long Paper)   —  March 2011
    Additional webpage and slides.
  11. SAT Solvers for Queries over Tree Automata with Constraints
    co-authors: P.C. Héam, O. Kouchnarenko
    IEEE – International Workshop CSTVA’10   —  January – April 2010
    Corresponding slides.

1.2.4  Thesis, Research Reports, and Such

  1. Tree Automata, Approximations, and Constraints for Verification — Tree (Not Quite) Regular Model-Checking
    co-authors: supervisors: P.C. Héam, O. Kouchnarenko
    Ph.D. Thesis   —  Sept 27, 2013
    Corresponding slides.
  2. Random Generation of Positive TAGEDs wrt. the Emptiness Problem
    co-authors: P.C. Héam, O. Kouchnarenko
    INRIA Research Report   —  November 2010
    Corresponding slides.
  3. Algorithms for Tree Automata with Constraints
    co-authors: supervisors: P.C. Héam, O. Kouchnarenko
    M.Sc. Thesis   —  July 2010
    Corresponding slides.

2  Miscellaneous Odds and Ends

I have written a number of small programs in my spare time while I was a student. Here are a couple which may still be of some interest.


*
This page was last updated on July 7, 2019.

This document was translated from LATEX by HEVEA.