Selected publications by Peter Habermehl

1

Peter Habermehl and Tomáš Vojnar (eds.). Proceedings of the 10th International Workshop on Verification of Infinite State Systems (INFINITY'08), Toronto, Canada, August 2008, ENTCS. Elsevier Science Publishers, 2009. To appear. ( BibTeX )

2

Benedikt Bollig, Manuela-Lidia Grindei and Peter Habermehl. Realizability of Concurrent Recursive Programs. In Luca de Alfaro (ed.), FoSSaCS'09, LNCS 5504, pages 410-424. Springer, 2009. ( PDF | BibTeX + Abstract )

3

Benedikt Bollig, Peter Habermehl, Carsten Kern and Martin Leucker. Angluin-Style Learning of NFA. Research Report LSV-08-28, Laboratoire Spécification et Vérification, ENS Cachan, France, October 2008. 30 pages. ( PDF | PS | PS.GZ | BibTeX + Abstract )

4

Mohamed Faouzi Atig, Benedikt Bollig and Peter Habermehl. Emptiness of multi-pushdown automata is 2ETIME-complete. In Masami Ito and Masafumi Toyama (eds.), DLT'08, LNCS 5257, pages 121-133. Springer, 2008. ( PDF | BibTeX + Abstract )

5

Ahmed Bouajjani, Peter Habermehl, Lukáš Holík, Tayssir Touili and Tomáš Vojnar. Antichain-based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. In Oscar H. Ibarra and Bala Ravikumar (eds.), CIAA'08, LNCS 5148, pages 57-67. Springer-Verlag, 2008. ( PDF | BibTeX + Abstract )

6

Ahmed Bouajjani, Peter Habermehl and Tomáš Vojnar. Verification of parametric concurrent systems with prioritised FIFO resource management. Formal Methods in System Design 32(2), pages 129-172, 2008. ( PDF | BibTeX + Abstract )

7

Peter Habermehl, Radu Iosif and Tomáš Vojnar. What else is decidable about arrays? In Roberto Amadio (ed.), FoSSaCS'08, LNCS 4962, pages 474-489. Springer, 2008. ( PDF (long version) | BibTeX + Abstract )

8

Peter Habermehl, Radu Iosif, Adam Rogalewicz and Tomáš Vojnar. Proving Termination of Tree Manipulating Programs. In Kedar Namjoshi and Tomohiro Yoneda (eds.), ATVA'07, LNCS 4762, pages 145-161. Springer, 2007. ( PDF | PS | PS.GZ | BibTeX + Abstract )

9

Ahmed Bouajjani, Peter Habermehl, Yan Jurski and Mihaela Sighireanu. Rewriting Systems with Data - A Framework for Reasoning About Systems with Unbounded Structures over Infinite Data Domains. In Erzsébet Csuhaj-Varjú and Zoltán Ésik (eds.), FCT'07, LNCS 4639, pages 1-22. Springer, 2007. ( PDF | PS | PS.GZ | BibTeX + Abstract )

10

Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro and Tomáš Vojnar. Programs with Lists Are Counter Automata. In Thomas Ball and Robert B. Jones (eds.), CAV'06, LNCS 4144, pages 517-531. Springer, 2006. ( PDF | PDF (long version) | BibTeX + Abstract )

11

Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz and Tomáš Vojnar. Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. In Kwangkeun Yi (ed.), SAS'06, LNCS 4134, pages 52-70. Springer, 2006. ( PS | PS.GZ | BibTeX )

12

Peter Habermehl, Radu Iosif and Tomáš Vojnar. Automata-Based Verification of Programs with Tree Updates. In Holger Hermanns and Jens Palsberg (eds.), TACAS'06, LNCS 3920, pages 350-364. Springer, 2006. ( PS | PS.GZ | BibTeX )

13

Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz and Tomáš Vojnar. Abstract Regular Tree Model Checking. In Jiří Srba and Scott A. Smolka (eds.), INFINITY'05, ENTCS 149(1), pages 37-48. Elsevier Science Publishers, 2006. ( PS | PS.GZ | BibTeX + Abstract )

14

Peter Habermehl and Tomáš Vojnar. Regular Model Checking Using Inference of Regular Languages. In Julian Bradfield and Faron Moller (eds.), INFINITY'04, ENTCS 138(3), pages 21-36. Elsevier Science Publishers, 2005. ( PS | PS.GZ | BibTeX + Abstract )

15

Ahmed Bouajjani, Peter Habermehl, Pierre Moro and Tomáš Vojnar. Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking. In Nicolas Halbwachs and Lenore D. Zuck (eds.), TACAS'05, LNCS 3440, pages 13-29. Springer, 2005. ( PS | PS.GZ | BibTeX )

16

Ahmed Bouajjani, Peter Habermehl and Tomáš Vojnar. Abstract Regular Model Checking. In Rajeev Alur and Doron A. Peled (eds.), CAV'04, LNCS 3114, pages 372-386. Springer, 2004. ( PS | PS.GZ | BibTeX )

17

Helmut Seidl, Thomas Schwentick, Anca Muscholl and Peter Habermehl. Counting in Trees for Free. In Josep Díaz, Juhani Karhumäki, Arto Lepistö and Donald Sannella (eds.), ICALP'04, LNCS 3142, pages 1136-1149. Springer, 2004. ( PS | PS.GZ | BibTeX )

18

Ahmed Bouajjani, Peter Habermehl and Tomáš Vojnar. Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management. In Roberto M. Amadio and Denis Lugiez (eds.), CONCUR'03, LNCS 2761, pages 172-187. Springer, 2003. ( PS | PS.GZ | BibTeX )

19

Ahmed Bouajjani, Peter Habermehl and Richard Mayr. Automatic Verification of Recursive Procedures with One Integer Parameter. Theoretical Computer Science 295(1-3), pages 85-106, 2003. ( PS | PS.GZ | BibTeX )

20

Ahmed Bouajjani, Peter Habermehl and Richard Mayr. Automatic Verification of Recursive Procedures with One Integer Parameter. In Jiří Sgall, Aleš Pultr and Petr Kolman (eds.), MFCS'01, LNCS 2136, pages 198-211. Springer, 2001. ( PS | PS.GZ | BibTeX )

21

Ahmed Bouajjani and Peter Habermehl. Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. Theoretical Computer Science 221(1-2), pages 211-250, 1999. ( PS | PS.GZ | BibTeX )

22

Parosh Aziz Abdulla, Aurore Annichini, Saddek Bensalem, Ahmed Bouajjani, Peter Habermehl and Yassine Lakhnech. Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis. In Nicolas Halbwachs and Doron Peled (eds.), CAV'99, LNCS 1633, pages 146-159. Springer, 1999. ( PS | PS.GZ | BibTeX )

23

Ahmed Bouajjani and Peter Habermehl. Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract). In Pierpaolo Degano, Roberto Gorrieri and Alberto Marchetti-Spaccamela (eds.), ICALP'97, LNCS 1256, pages 560-570. Springer, 1997. ( BibTeX )

24

Peter Habermehl. On the Complexity of the Linear-Time μ-calculus for Petri Nets. In Pierre Azéma and Gianfranco Balbo (eds.), ICATPN'97, LNCS 1248, pages 102-116. Springer, 1997. ( PS | PS.GZ | BibTeX )

25

Ahmed Bouajjani and Peter Habermehl. Constrained Properties, Semilinear Systems, and Petri Nets. In Ugo Montanari and Vladimiro Sassone (eds.), CONCUR'96, LNCS 1119, pages 481-497. Springer, 1996. ( PS | PS.GZ | BibTeX )

26

Ahmed Bouajjani, Rachid Echahed and Peter Habermehl. On the Verification Problem of Nonregular Properties for Nonregular Processes. In LICS'95, pages 123-133. IEEE Computer Society Press, 1995. ( BibTeX )

27

Ahmed Bouajjani, Rachid Echahed and Peter Habermehl. Verifying Infinite State Processes with Sequential and Parallel Composition. In POPL'95, pages 95-106. ACM Press, 1995. ( BibTeX )

Selected publications by Peter Habermehl

2009

2008

2007

2006

2005

2004

2003

2001

1999

1997

1996

1995

About LSV

Search this list