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
2052004
Angluin-Style Learning of NFA.
B Bollig, P Habermehl, C Kern, M Leucker
IJCAI 9, 1004-1009, 2009
1422009
Programs with lists are counter automata
A Bouajjani, M Bozga, P Habermehl, R Iosif, P Moro, T Vojnar
Computer Aided Verification: 18th International Conference, CAV 2006 …, 2006
1352006
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
1282006
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
118*2012
Counting in trees for free
H Seidl, T Schwentick, A Muscholl, P Habermehl
Automata, Languages and Programming: 31st International Colloquium, ICALP …, 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
Tools and Algorithms for the Construction and Analysis of Systems: 11th …, 2005
842005
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
821995
Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations
A Bouajjani, P Habermehl
ICALP 1256, 560-570, 1997
801997
Emptiness of multi-pushdown automata is 2ETIME-complete
MF Atig, B Bollig, P Habermehl
Developments in Language Theory: 12th International Conference, DLT 2008 …, 2008
772008
What else is decidable about integer arrays?
P Habermehl, R Iosif, T Vojnar
Foundations of Software Science and Computational Structures: 11th …, 2008
732008
On the complexity of the linear-time μ-calculus for Petri nets
P Habermehl
Application and Theory of Petri Nets 1997: 18th International Conference …, 1997
721997
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
692012
Abstract regular tree model checking
A Bouajjani, P Habermehl, A Rogalewicz, T Vojnar
Electronic Notes in Theoretical Computer Science 149 (1), 37-48, 2006
692006
Regular model checking using inference of regular languages
P Habermehl, T Vojnar
Electronic Notes in Theoretical Computer Science 138 (3), 21-36, 2005
672005
Rewriting systems with data
A Bouajjani, P Habermehl, Y Jurski, M Sighireanu
FCT 7, 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
Constrained properties, semilinear systems, and Petri nets
A Bouajjani, P Habermehl
Concur 96, 481-497, 1996
631996
Automatic verification of integer array programs
M Bozga, P Habermehl, R Iosif, F Konečný, T Vojnar
Computer Aided Verification: 21st International Conference, CAV 2009 …, 2009
622009
Het systeem kan de bewerking nu niet uitvoeren. Probeer het later opnieuw.
Artikelen 1–20