~ Francesco Parolini


I am a PhD Candidate in Computer Science at the Sorbonne University (Paris) under the supervision of Professor Antoine Miné, within the ERC MOPSA project. Previously, I obtained a BSc and an MSc in Computer Science at University of Padua (Italy). For my Master's Thesis I worked on the language inclusion problem for ω-regular languages.

My research interests include security and automated formal methods, in particular by abstract interpretation.


  • I am a member of the CAV 2022 Artifact Evaluation Committee.


  • Inclusion Testing of Büchi Automata Based on Well-Quasiorders. Kyveli Doveri, Pierre Ganty, Francesco Parolini, Francesco Ranzato. In CONCUR, 2021. PDF BibTeX Artifact
  • Simulation-based Inclusion Checking Algorithms for ω-Languages. Master's Thesis, 2020. PDF Slides


  • bait: (Büchi Automata Inclusion Tester) a ω-regular language inclusion checker. It relies on abstract interpretation theory, while being sound and complete.
  • pilisp: a garbage collected interpreter written in C for a dialect of Lisp inspired to Common Lisp. The main feature is that it supports homoiconicity (as Lisp 1.5). It also has a bytecode compiler and bytecode interpreter which make the interpreter faster than CLISP.


Email francesco.parolini@lip6.fr
Github github.com/parof
Phone +33 1 44 27 88 16
Team APR
Location Campus Pierre et Marie Curie, Sorbonne Université
Boîte courrier 169 Couloir 25-26, Étage 3, Bureau 303
4 place Jussieu
75252 PARIS CEDEX 05


  • I am a member of the CAV 2022 Artifact Evaluation Committee.
  • I am a member of the SAS 2021 Artifact Evaluation Committee.

Return ⊤