| 2009 |
| 26 | EE | Benedikt Bollig,
Manuela-Lidia Grindei,
Peter Habermehl:
Realizability of Concurrent Recursive Programs.
FOSSACS 2009: 410-424 |
| 2008 |
| 25 | EE | Ahmed Bouajjani,
Peter Habermehl,
Lukás Holík,
Tayssir Touili,
Tomás Vojnar:
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata.
CIAA 2008: 57-67 |
| 24 | EE | Mohamed Faouzi Atig,
Benedikt Bollig,
Peter Habermehl:
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete.
Developments in Language Theory 2008: 121-133 |
| 23 | EE | Peter Habermehl,
Radu Iosif,
Tomás Vojnar:
What Else Is Decidable about Integer Arrays?.
FoSSaCS 2008: 474-489 |
| 22 | EE | Peter Habermehl,
Radu Iosif,
Tomás Vojnar:
A Logic of Singly Indexed Arrays.
LPAR 2008: 558-573 |
| 21 | EE | Ahmed Bouajjani,
Peter Habermehl,
Tomás Vojnar:
Verification of parametric concurrent systems with prioritised FIFO resource management.
Formal Methods in System Design 32(2): 129-172 (2008) |
| 2007 |
| 20 | EE | Peter Habermehl,
Radu Iosif,
Adam Rogalewicz,
Tomás Vojnar:
Proving Termination of Tree Manipulating Programs.
ATVA 2007: 145-161 |
| 19 | EE | Ahmed Bouajjani,
Peter Habermehl,
Yan Jurski,
Mihaela Sighireanu:
Rewriting Systems with Data.
FCT 2007: 1-22 |
| 2006 |
| 18 | EE | Ahmed Bouajjani,
Marius Bozga,
Peter Habermehl,
Radu Iosif,
Pierre Moro,
Tomás Vojnar:
Programs with Lists Are Counter Automata.
CAV 2006: 517-531 |
| 17 | EE | Ahmed Bouajjani,
Peter Habermehl,
Adam Rogalewicz,
Tomás Vojnar:
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures.
SAS 2006: 52-70 |
| 16 | EE | Peter Habermehl,
Radu Iosif,
Tomás Vojnar:
Automata-Based Verification of Programs with Tree Updates.
TACAS 2006: 350-364 |
| 15 | EE | Ahmed Bouajjani,
Peter Habermehl,
Adam Rogalewicz,
Tomás Vojnar:
Abstract Regular Tree Model Checking.
Electr. Notes Theor. Comput. Sci. 149(1): 37-48 (2006) |
| 2005 |
| 14 | EE | Ahmed Bouajjani,
Peter Habermehl,
Pierre Moro,
Tomás Vojnar:
Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking.
TACAS 2005: 13-29 |
| 13 | EE | Peter Habermehl,
Tomás Vojnar:
Regular Model Checking Using Inference of Regular Languages.
Electr. Notes Theor. Comput. Sci. 138(3): 21-36 (2005) |
| 2004 |
| 12 | EE | Ahmed Bouajjani,
Peter Habermehl,
Tomás Vojnar:
Abstract Regular Model Checking.
CAV 2004: 372-386 |
| 11 | EE | Helmut Seidl,
Thomas Schwentick,
Anca Muscholl,
Peter Habermehl:
Counting in Trees for Free.
ICALP 2004: 1136-1149 |
| 2003 |
| 10 | EE | Ahmed Bouajjani,
Peter Habermehl,
Tomás Vojnar:
Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management.
CONCUR 2003: 172-187 |
| 9 | EE | Ahmed Bouajjani,
Peter Habermehl,
Richard Mayr:
Automatic verification of recursive procedures with one integer parameter.
Theor. Comput. Sci. 295: 85-106 (2003) |
| 2001 |
| 8 | EE | Ahmed Bouajjani,
Peter Habermehl,
Richard Mayr:
Automatic Verification of Recursive Procedures with One Integer Parameter.
MFCS 2001: 198-211 |
| 1999 |
| 7 | EE | Parosh Aziz Abdulla,
Aurore Annichini,
Saddek Bensalem,
Ahmed Bouajjani,
Peter Habermehl,
Yassine Lakhnech:
Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis.
CAV 1999: 146-159 |
| 6 | EE | Ahmed Bouajjani,
Peter Habermehl:
Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations.
Theor. Comput. Sci. 221(1-2): 211-250 (1999) |
| 1997 |
| 5 | | Ahmed Bouajjani,
Peter Habermehl:
Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract).
ICALP 1997: 560-570 |
| 4 | | Peter Habermehl:
On the Complexity of the Linear-Time mu -calculus for Petri-Nets.
ICATPN 1997: 102-116 |
| 1996 |
| 3 | | Ahmed Bouajjani,
Peter Habermehl:
Constrained Properties, Semilinear Systems, and Petri Nets.
CONCUR 1996: 481-497 |
| 1995 |
| 2 | | Ahmed Bouajjani,
Rachid Echahed,
Peter Habermehl:
On the Verification Problem of Nonregular Properties for Nonregular Processes
LICS 1995: 123-133 |
| 1 | | Ahmed Bouajjani,
Rachid Echahed,
Peter Habermehl:
Verifying Infinite State Processes with Sequential and Parallel Composition.
POPL 1995: 95-106 |