Volgen
Peter Habermehl
Peter Habermehl
Assistant Professor of Computer Science, IRIF, University Paris Cité
Geverifieerd e-mailadres voor irif.fr - Homepage
Titel
Geciteerd door
Geciteerd door
Jaar
Abstract regular model checking
A Bouajjani, P Habermehl, T Vojnar
Computer Aided Verification, 372-386, 2004
2032004
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
1372006
Angluin-Style Learning of NFA.
B Bollig, P Habermehl, C Kern, M Leucker
IJCAI 9, 1004-1009, 2009
1342009
Abstract regular tree model checking of complex dynamic data structures
A Bouajjani, P Habermehl, A Rogalewicz, T Vojnar
International Static Analysis Symposium, 52-70, 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
116*2012
Counting in trees for free
H Seidl, T Schwentick, A Muscholl, P Habermehl
International Colloquium on Automata, Languages, and Programming, 1136-1149, 2004
1132004
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
1011999
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
841995
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
811997
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
712008
Regular model checking using inference of regular languages
P Habermehl, T Vojnar
Electronic Notes in Theoretical Computer Science 138 (3), 21-36, 2005
682005
Abstract regular tree model checking
A Bouajjani, P Habermehl, A Rogalewicz, T Vojnar
Electronic Notes in Theoretical Computer Science 149 (1), 37-48, 2006
672006
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
671997
Rewriting systems with data
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, ...
International Conference on Computer Aided Verification, 146-159, 1999
621999
Constrained properties, semilinear systems, and Petri nets
A Bouajjani, P Habermehl
International Conference on Concurrency Theory, 481-497, 1996
611996
Automatic verification of integer array programs
M Bozga, P Habermehl, R Iosif, F Konečný, T Vojnar
International Conference on Computer Aided Verification, 157-172, 2009
592009
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
572008
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20