| Abstract regular model checking A Bouajjani, P Habermehl, T Vojnar Computer Aided Verification, 372-386, 2004 | 195 | 2004 |
| Programs with lists are counter automata A Bouajjani, M Bozga, P Habermehl, R Iosif, P Moro, T Vojnar Computer Aided Verification, 517-531, 2006 | 132 | 2006 |
| Abstract regular tree model checking of complex dynamic data structures A Bouajjani, P Habermehl, A Rogalewicz, T Vojnar Static Analysis, 52-70, 2006 | 131 | 2006 |
| 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 | 112* | 2012 |
| Angluin-Style Learning of NFA. B Bollig, P Habermehl, C Kern, M Leucker IJCAI 9, 1004-1009, 2009 | 111 | 2009 |
| Counting in trees for free H Seidl, T Schwentick, A Muscholl, P Habermehl Automata, Languages and Programming, 1136-1149, 2004 | 111 | 2004 |
| Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations A Bouajjani, P Habermehl Theoretical Computer Science 221 (1), 211-250, 1999 | 99 | 1999 |
| 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, 13-29, 2005 | 86 | 2005 |
| On the verification problem of nonregular properties for nonregular processes A Bouajjani, R Echahed, P Habermehl Logic in Computer Science, 1995. LICS'95. Proceedings., Tenth Annual IEEE …, 1995 | 77 | 1995 |
| Emptiness of multi-pushdown automata is 2ETIME-complete M Atig, B Bollig, P Habermehl Developments in Language Theory, 121-133, 2008 | 74 | 2008 |
| Symbolic reachability analysis of FIFO-channel systems with nonregular sets of configurations A Bouajjani, P Habermehl Automata, Languages and Programming, 560-570, 1997 | 74 | 1997 |
| What else is decidable about integer arrays? P Habermehl, R Iosif, T Vojnar Foundations of Software Science and Computational Structures, 474-489, 2008 | 69 | 2008 |
| Regular model checking using inference of regular languages P Habermehl, T Vojnar Electronic Notes in Theoretical Computer Science 138 (3), 21-36, 2005 | 69 | 2005 |
| Abstract regular tree model checking A Bouajjani, P Habermehl, A Rogalewicz, T Vojnar Electronic Notes in Theoretical Computer Science 149 (1), 37-48, 2006 | 68 | 2006 |
| Rewriting systems with data A Bouajjani, P Habermehl, Y Jurski, M Sighireanu Fundamentals of Computation Theory, 1-22, 2007 | 65 | 2007 |
| On the complexity of the linear-time μ-calculus for Petri Nets P Habermehl Application and Theory of Petri Nets 1997, 102-116, 1997 | 64 | 1997 |
| Verification of infinite-state systems by combining abstraction and reachability analysis PA Abdulla, A Annichini, S Bensalem, A Bouajjani, P Habermehl, ... Computer Aided Verification, 146-159, 1999 | 61 | 1999 |
| Automatic Verification of Integer Array Programs. M Bozga, P Habermehl, R Iosif, F Konecný, T Vojnar CAV 9, 157-172, 2009 | 58 | 2009 |
| Antichain-based universality and inclusion testing over nondeterministic finite tree automata A Bouajjani, P Habermehl, L Holík, T Touili, T Vojnar Implementation and Applications of Automata, 57-67, 2008 | 58 | 2008 |
| Constrained properties, semilinear systems, and Petri nets A Bouajjani, P Habermehl CONCUR'96: Concurrency Theory, 481-497, 1996 | 56 | 1996 |
Ahmed BouajjaniProfessor Computer Science, University of ParisVerified email at irif.fr
