Peter Habermehl

Maître de Conférences (Assistant/Associate Professor), HDR, at the University Paris Cité (anciennement Établissement public expérimental – Décret N°2019-209 du 20 mars 2019, Université de Paris, Université Paris Diderot, Université Paris 7), Fondation Sciences Mathématique de Paris, Member of the Pôle Automates, structures et vérification and head of the Modelling and Verification group and member of the Automata and application group at IRIF (CNRS), formerly LIAFA

Mailing address: Université Paris Cité, IRIF
Bâtiment Sophie Germain, Case 7014
8 Place Aurélie Nemours
75205 Paris Cedex 13, FRANCE
Office address: Bâtiment Sophie Germain, Bureau 3022, 8, place Aurélie Nemours, 75013 Paris, FRANCE
E-mail: (replace _AT_ by the appropriate symbol) For private matters of which only you, me and Google should know about:
Phone: +(33) 1 57 27 92 58
My Photo some time ago


REDBALL NEW: I'm proud to have fr-number 3 (Compute your fr-number here)
REDBALL Upcoming Events
  • CAV 2024
  • ICCPS 2024 (PC member)
  • REDBALL Recent Events
  • RP 2023 (PC member)
  • RP 2022 (PC member)
  • FLOC 2022
  • SynCoP 2022
  • TMPA 2021 (PC member)
  • SynCoP 2019 (invited speaker)
  • LATA 2019 (PC member)
  • TMPA 2019 (PC member)
  • MOVEP 2018 Summer School (co-chair)
  • LATA 2018 (PC member)

  • REDBALL Research
  • Running projects: CyPhAI
  • Terminated projects (among others): ANR PACS (main investigator LIAFA), ANR VECOLIB ANR Veridyc (main investigator LIAFA), ANR RNTL AVERILES (main investigator), Advance Project (European)

  • REDBALL Here is a preliminary version of my Habilitation thesis (in french)

    REDBALL ha-index: 83 (Compute your ha-index here)

    REDBALL Publications (Other lists on the web: List at DBLP, List at Arnetminer, my profile on Google Scholar
    Most recent (might be outdated) paper and maybe some highlights:

  • P. Habermehl, V. Havlena, M. Hečko, L. Holík and O.Lengal. Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. Accepted at CAV 2024. (arXiv version)

  • P. Habermehl, D. Kuske. On Presburger arithmetic extended with non-unary counting quantifiers. Log. Methods Comput. Sci. 19(3) (2023) (Full text)

  • A. Bouajjani, W. Boutglay, P. Habermehl. Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes. CAV 2022. (arXiv version)

  • A. Durand-Gasselin, P. Habermehl. Regular transformations of data words through origin information. FOSSACS 2016. (PDF)

  • P. Habermehl, D. Kuske. On Presburger arithmetic extended with modulo counting quantifiers. FOSSACS 2015. (PDF)

  • B. Bollig, P. Habermehl, M. Leucker, B. Monmege. A Robust Class of Data Languages and an Application to Learning. Logical Methods in Computer Science, Volume 10, Issue 4, Dec. 2014. (Link)

  • A. Durand-Gasselin, P. Habermehl. Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree. STACS 2012, Paris. (short version, preliminary long version)

  • A. Bouajjani, P. Habermehl, A. Rogalewicz, and T. Vojnar. Abstract regular (tree) model checking. International Journal on Software Tools for Technology Transfer (STTT), Volume 14, Number 2, 167-191, 2012 (Link)

  • P. Habermehl, L. Holik, J. Simacek, A. Rogalewicz, and T. Vojnar. Forest Automata for Verification of Heap Manipulation. Proc. of 23rd International Conference on Computer Aided Verification---CAV'11, Cliff Lodge, Snowbird, Utah, USA. (Link), journal version in Formal Methods in System Design 2012 (Link)

  • A. Bouajjani, M. Bozga, P. Habermehl, R. Iosif, P. Moro, T. Vojnar. Programs with Lists are Counter Automata, Formal Methods in System Design, 2011, 38(2), pages 158-192, 2011. (Link)

  • P. Habermehl, R. Meyer, and H. Wimmel. The downward-closure of Petri net languages. In Proc. of the 37th International Colloquium on Automata, Languages and Programming, ICALP 2010, LNCS 6199. Springer-Verlag, 2010. (PDF)

  • P. Habermehl, R. Iosif, and T. Vojnar. Automata-based Verification of Programs with Tree Updates In Acta Informatica, Volume 47, Number 1, pages 1-31, Springer-Verlag, 2010. Link

  • Benedikt Bollig, Peter Habermehl, Carsten Kern and Martin Leucker. Angluin-Style Learning of NFA. Proceedings of IJCAI 2009 (PDF). Full version as Research Report LSV-08-28, Laboratoire Specification et Verification, ENS Cachan, France, October 2008. (PDF)

  • REDBALL Teaching, Enseignement

    REDBALL Passed Events
  • SynCop + PV 2017 (co-chair) associated with ETAPS
  • TMPA 2017 (PC member)
  • TASE 2015 (PC member)
  • FoSSaCS 2015
  • SynCoP 2015 (PC member)
  • Petri Nets 2014
  • AISS 2014 (PC member)
  • ICALP 2014 (PC member Track B)
  • TASE 2014 (PC member)
  • Infinity 2013 (PC member)
  • DLT 2013
  • INFINITY 2012 (invited speaker)
  • CP meets CAV (invited)
  • MEMICS 2012 (PC member)
  • STACS 2012
  • MEMICS 2011 (PC member)
  • INFINITY 2011 (PC member)
  • TIME 2011 (PC member)
  • CAV 2011
  • TACAS 2011 (PC member)
  • Workshop on Automata and logic for data manipulating programs Dec. 2010 (Invited speaker)
  • INFINITY 2010 (PC member)
  • MEMICS 2010 (PC member)
  • ICALP 2010
  • MEMICS 2009 (PC member, invited speaker)
  • RP 2009
  • IJCAI 2009
  • CAV 2009
  • ETAPS 2009
  • FSTTCS 2009 (PC member)
  • INFINITY 2008 (co-chair)

  • REDBALL Congratulations for having arrived at the end. As a bonus here is my personal ranking of Parisian universities.
    REDBALL Sorry, I'm neither on Facebook nor on Twitter.


    Weather in Paris:

    Last modified: 27/March/2024