Peter Habermehl

Maître de Conférences (Assistant/Associate Professor), HDR, at the University Paris Diderot (Paris 7, Sorbonne Paris Cité, Fédération de Recherche en Mathématiques de Paris centre, Fondation Sciences Mathématiques de Paris)
Member of the Modelling and Verification group at the LIAFA (CNRS)

Mailing address: University Paris Diderot (Paris 7), LIAFA
case 7014, 75205 Paris Cedex 13, FRANCE
Office address: Bâtiment Sophie Germain, Bureau 4017, 8, place FM/13, 75013 Paris, FRANCE
E-mail: Peter.Habermehl_AT_liafa.univ-paris-diderot.fr
Phone: +(33) 1 57 27 92 29
Fax: +(33) 1 57 27 94 09
Web: http://www.liafa.univ-paris-diderot.fr/~haberm/
My Photo some time ago

BARRE

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

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

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

  • B. Bollig, P. Habermehl, M. Leucker, B. Monmege. A Fresh Approach to Learning Register Automata. DLT 2013, Marne-la-Vallée, France. (first version)

  • 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 ha-index: 83 (Compute your ha-index here)

    REDBALL Teaching, Enseignement

    REDBALL Upcoming Events
  • AISS 2014 (PC member)
  • ICALP 2014 (PC member Track B)
  • TASE 2014 (PC member)

  • REDBALL Passed Events
  • 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.

    BARRE

    Weather in Paris:



    Last modified: 11/March/2013