 |
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:
A. Durand-Gasselin, P. Habermehl.
Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree.
To appear in STACS 2012, Paris. (preliminary long version)
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)
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)
A. Durand-Gasselin, P. Habermehl.
On the use of non-deterministic automata for Presburger
Arithmetic.
In Proc. of the 21st International Conference on Concurrency Theory , LNCS 6269. Springer-Verlag, 2010.
(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)
Ahmed Bouajjani, Peter Habermehl and
Tomas Vojnar. Verification of parametric
concurrent systems with prioritised FIFO resource management.
Formal Methods in System Design 32(2), pages 129-172, 2008. Link
|
