Follow
Peter Habermehl
Peter Habermehl
Assistant Professor of Computer Science, IRIF, University Paris Cité
Verified email at irif.fr - Homepage
Title
Cited by
Cited by
Year
Abstract regular model checking
A Bouajjani, P Habermehl, T Vojnar
Computer Aided Verification, 372-386, 2004
2062004
Angluin-Style Learning of NFA.
B Bollig, P Habermehl, C Kern, M Leucker
IJCAI 9, 1004-1009, 2009
1512009
Programs with lists are counter automata
A Bouajjani, M Bozga, P Habermehl, R Iosif, P Moro, T Vojnar
International Conference on Computer Aided Verification, 517-531, 2006
1382006
Abstract regular tree model checking of complex dynamic data structures
A Bouajjani, P Habermehl, A Rogalewicz, T Vojnar
Static Analysis: 13th International Symposium, SAS 2006, Seoul, Korea …, 2006
1322006
Abstract regular (tree) model checking
A Bouajjani, P Habermehl, A Rogalewicz, T Vojnar
International journal on software tools for technology transfer 14 (2), 167-191, 2012
123*2012
Counting in trees for free
H Seidl, T Schwentick, A Muscholl, P Habermehl
Automata, Languages and Programming: 31st International Colloquium, ICALP …, 2004
1152004
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
A Bouajjani, P Habermehl
Theoretical Computer Science 221 (1-2), 211-250, 1999
981999
Verifying programs with dynamic 1-selector-linked structures in regular model checking
A Bouajjani, P Habermehl, P Moro, T Vojnar
International Conference on Tools and Algorithms for the Construction and …, 2005
862005
On the verification problem of nonregular properties for nonregular processes
A Bouajjani, R Echahed, P Habermehl
Proceedings of Tenth Annual IEEE Symposium on Logic in Computer Science, 123-133, 1995
811995
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
A Bouajjani, P Habermehl
International Colloquium on Automata, Languages, and Programming, 560-570, 1997
801997
Emptiness of multi-pushdown automata is 2ETIME-complete
MF Atig, B Bollig, P Habermehl
International Conference on Developments in Language Theory, 121-133, 2008
772008
What else is decidable about integer arrays?
P Habermehl, R Iosif, T Vojnar
International Conference on Foundations of Software Science and …, 2008
742008
Forest automata for verification of heap manipulation
P Habermehl, L Holík, A Rogalewicz, J Šimáček, T Vojnar
Formal Methods in System Design 41 (1), 83-106, 2012
722012
On the complexity of the linear-time μ-calculus for Petri nets
P Habermehl
International Conference on Application and Theory of Petri Nets, 102-116, 1997
711997
Abstract regular tree model checking
A Bouajjani, P Habermehl, A Rogalewicz, T Vojnar
Electronic Notes in Theoretical Computer Science 149 (1), 37-48, 2006
702006
Regular model checking using inference of regular languages
P Habermehl, T Vojnar
Electronic Notes in Theoretical Computer Science 138 (3), 21-36, 2005
682005
Antichain-based universality and inclusion testing over nondeterministic finite tree automata
A Bouajjani, P Habermehl, L Holík, T Touili, T Vojnar
International Conference on Implementation and Application of Automata, 57-67, 2008
662008
Constrained properties, semilinear systems, and Petri nets
A Bouajjani, P Habermehl
International Conference on Concurrency Theory, 481-497, 1996
651996
Rewriting Systems with Data: A Framework for Reasoning about Systems with Unbounded Structures over Infinite Data Domains
A Bouajjani, P Habermehl, Y Jurski, M Sighireanu
International Symposium on Fundamentals of Computation Theory, 1-22, 2007
642007
Verification of infinite-state systems by combining abstraction and reachability analysis
PA Abdulla, A Annichini, S Bensalem, A Bouajjani, P Habermehl, ...
Computer Aided Verification: 11th International Conference, CAV’99 Trento …, 1999
631999
The system can't perform the operation now. Try again later.
Articles 1–20