Research

Research themes

I'm currently a postdoctoral researcher in the ERATO MMSD project, lead by Ichiro Hasuo. More precisely, I'm part of the G0 (mathematical integration) group, lead by Shin-ya Katsumata.

I did my PhD at LAMA (LAboratoire de MAthématiques, the mathematics laboratory of Université Savoie Mont Blanc) under the supervision of Tom Hirschowitz.

Interests:

• semantics of programming languages (mostly game semantics),
• logics,
• category theory,
• theoretical computer science at large.

Journal papers

• Sasinee Pruekprasert, Jérémy Dubut, Toru Takisaka, C.E., and Ahmet Cetinkaya. Moment propagation of polynomial systems through Carleman linearization for probabilistic safety analysis, Automatica, vol. 60, 2024
• Ichiro Hasuo, Yuichiro Oyabu, C.E., Kohei Suenaga, Kenta Cho, and Shin-ya Katsumata. Control-Data Separation and Logical Condition Propagation for Efficient Inference on Probabilistic Programs, JLAMP, 2023
• Yuichi Komorida, Shin-ya Kastumata, Nick Hu, Bartek Klin, Samuel Humeau, C.E., and Ichiro Hasuo. Codensity Games for Bisimilarity, New Generation Computing, vol. 40, 403–465, 2022
• Ichiro Hasuo, C.E., James Haydon, Jérémy Dubut, Rose Bohrer, Tsutomu Kobayashi, Sasinee Pruekprasert, Xiao-yi Zhang, Erik André Pallas, Akihisa Yamada, Kohei Suenaga, Fuyuki Ishikawa, Kenji Kamijo, Yoshiyuki Shinya, and Takamasa Suetomi. Goal-Aware RSS for Complex Scenarios via Program Logic, IEEE T-IV, vol.8 (4), 3040–3072, 2023
• C.E. and Tom Hirschowitz. Fibred pseudo double categories for game semantics, TAC, vol. 34, 2019
• C.E., Tom Hirschowitz, and Thomas Seiller. An intensionally fully-abstract sheaf model for π (expanded version), LMCS, vol. 13, 2017

Conference papers

• Serge Lechenne, C.E., and Ichiro Hasuo. A Compositional Approach to Petri Nets, CMCS 2024
• Kazuki Watanabe, C.E., Kazuyuki Asada, and Ichiro Hasuo. Compositional Probabilistic Model Checking with String Diagrams of MDPs, CAV 2023
• C.E., Jérémy Dubut, James Haydon, and Ichiro Hasuo. Formal Verification of Safety Architectures for Automated Driving, IV 2023
• C.E., James Haydon, Jérémy Dubut, Ahmet Cetinkaya, and Sasinee Pruekprasert. Logic for Timed Agent Network Topologies, CDC 2022
• Kazuki Watanabe, C.E., Kazuyuki Asada, and Ichiro Hasuo. A Compositional Approach to Parity Games, MFPS 2021
• Sasinee Pruekprasert, C.E., and Jérémy Dubut. Fast Synthesis for Symbolic Self-triggered Control under Right-recursive LTL Specifications, CDC 2021
• C.E., Akihisa Yamada, Stefan Klikovits, Shin-ya Katsumata, Tsutomu Kobayashi, Ichiro Hasuo, and Fuyuki Ishikawa. Architecture-Guided Test Resource Allocation Via Logic, TAP 2021 (slides)
• Sasinee Pruekprasert, C.E., and Jérémy Dubut. Symbolic Self-triggered Control of Continuous-time Non-deterministic Systems without Stability Assumptions for 2-LTL Specifications, ICARCV 2020
• Sasinee Pruekprasert, Toru Takisaka, C.E., Ahmet Cetinkaya, and Jérémy Dubut. Moment Propagation of Discrete-Time Stochastic Polynomial Systems using Truncated Carleman Linearization, IFAC 2020
• C.E., Tom Hirschowitz, and Alexis Laouar. Template games, simple games, and Day convolution, FSCD 2019
• C.E. and Bartek Klin. History-Dependent Nominal μ-Calculus, LICS 2019 (slides)
• C.E. and Tom Hirschowitz. What's in a game? – A theory of game models, LICS 2018 (slides)
• C.E. and Tom Hirschowitz. Justified sequences in string diagrams: a comparison between two approaches to concurrent game semantics, CALCO 2017 (slides)
• C.E., Tom Hirschowitz, and Thomas Seiller. Fully-abstract concurrent games for π, CALCO 2015

Preprints

• Kazuki Watanabe, C.E., Kazuyuki Asada, and Ichiro Hasuo. Compositional Solution of Mean Payoff Games by String Diagrams, Preprint
• C.E. and Tom Hirschowitz. Game semantics as a singular functor, and definability as geometric realisation, Preprint

Talks and stuff

• Thesis manuscript Categories and String Diagrams for Concurrent Game Semantics (slides)
• Slides, Kazuki Watanabe, C.E., Kazuyuki Asada, and Ichiro Hasuo. Category Theory for Compositional Verification slides of the corresponding talk at CMCS 2024 (marginally improved PPOS version)
• Slides, C.E., Tom Hirschowitz, and Alexis Laouar. Template games, simple games, and Day convolution slides of the corresponding talk at GaLoP 2019
• Slides, C.E. and Tom Hirschowitz. Constructing Fibred Double Categories – Towards New Sheaf Models of Programming Languages GaLoP XI
• Extended Abstract, Akihisa Yamada, C.E., Fuyuki Ishikawa, Nian-ze Lee. Scenario Sampling for Cyber Physical Systems using Combinatorial Testing poster at ICSTW 2019
• Expanded Abstract, C.E. and Tom Hirschowitz. Presheaves for Processes and Unfoldings CALCO Early Ideas 2015 (expanded draft of the corresponding talk by Tom)
• Report, internship done at CWI (Centrum Wiskunde & Informatica, Amsterdam), under the supervision of Marcello Bonsangue, Jan Rutten, and Alexandra Silva. Semirings, Generalized Effect Algebras, and Weighted Language Equivalence
• Report, internship done at LAMA (Chambéry), under the supervision of Tom Hirschowitz. Playgrounds, Factorization Systems, and Graphs
• Master's thesis, internship done at LAMA (Chambéry), under the supervision of Tom Hirschowitz. Towards a Theory of Programming Languages
• Report, internship done at JFLI (Japan French Laboratory for Informatics, Tokyo), under the supervision of David Nowak. On the relationship between parsing and pretty-printing
• Report, internship done at CMLA (Centre des Mathématiques et de Leurs Applications, Cachan), together with Jérémy Dubut, under the supervision of Frédéric Pascal. Le modèle de Cucker-Smale – Émergence et formation de structures et de motifs dans les groupes (troupeaux, bancs, colonies, nuées) in French
• Report, internship done at LORIA (laboratoire LOrrain de Recherche en Informatique et ses Applications, Nancy). Parsing in second order ACGs

Teaching

• 2019-2020 (at Sokendai a.k.a. The Graduate University for Advanced Studies)
  • Guest lecturer for the Formal Methods for Cyber-Physical Systems course, on the theme Hybrid System Falsification and Reinforcement Learning (in charge of the falsification part, for 1.5 lessons of 1.5 hours each)
    • slides of the first lecture
    • slides of the second lecture
    • homework assignment
• 2017-2018 (at Université Savoie Mont Blanc)
  • info101 – algorithmics: lessons, tutorial, and lab sessions, in Python
  • info201 – programming and algorithmics: lessons and lab sessions, in Python
  • info202 – operating systems: tutorial and lab sessions, in bash
  • info301 – object programming: tutorial and lab sessions, in Java
  • info501 – operating systems: tutorial and lab sessions, in C
  • info502 – algorithmics and complex structures (in charge of the course): lessons, tutorial and lab sessions, in C
  • info602 – advanced algorithmics: lab sessions, in C
• 2016-2017 (at Université Savoie Mont Blanc)
  • info101 – algorithmics: tutorial and lab sessions, in Python
  • info202 – operating systems: lab sessions, in bash
  • info203 – web languages: tutorial and lab sessions, in HTML, CSS, PHP, and JavaScript
  • info323 – introduction to object programming: lab sessions, in Java
• 2015-2016 (at Université Savoie Mont Blanc)
  • info113 – introduction to algorithmics and programming: tutorial and lab sessions, in Python
  • info222 – web languages: tutorial and lab sessions, in HTML, CSS, PHP, and JavaScript
  • info321 – imperative programming: lab sessions, in Ada
• 2013-2014 (at Université de Savoie)
  • info626 – advanced algorithmics: lab sessions, in C

Contact

clovis [dot] eberhart [at] gmail [dot] com