 |
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)
|
