dblp.uni-trier.dewww.dagstuhl.dewww.uni-trier.de

Peter Habermehl Coauthor index pubzone.org

List of publications from the DBLP Bibliography Server - FAQ
Ask others: ACM DL/Guide - CiteSeerX - CSB - MetaPress - Google - Bing - Yahoo

DBLP keys2012
38Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntoine Durand-Gasselin, Peter Habermehl: Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree. STACS 2012: 242-253
37Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar: Abstract regular (tree) model checking. STTT 14(2): 167-191 (2012)
2011
36Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar: Forest Automata for Verification of Heap Manipulation. CAV 2011: 424-440
35Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar: Programs with lists are counter automata. Formal Methods in System Design 38(2): 158-192 (2011)
34Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMohamed Faouzi Atig, Peter Habermehl: On Yen's Path Logic for Petri Nets. Int. J. Found. Comput. Sci. 22(4): 783-799 (2011)
2010
33Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAntoine Durand-Gasselin, Peter Habermehl: On the Use of Non-deterministic Automata for Presburger Arithmetic. CONCUR 2010: 373-387
32Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Habermehl, Roland Meyer, Harro Wimmel: The Downward-Closure of Petri Net Languages. ICALP (2) 2010: 466-477
31Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Habermehl, Radu Iosif, Tomás Vojnar: Automata-based verification of programs with tree updates. Acta Inf. 47(1): 1-31 (2010)
2009
30Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMarius Bozga, Peter Habermehl, Radu Iosif, Filip Konecný, Tomás Vojnar: Automatic Verification of Integer Array Programs. CAV 2009: 157-172
29Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl: Realizability of Concurrent Recursive Programs. FOSSACS 2009: 410-424
28Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLBenedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker: Angluin-Style Learning of NFA. IJCAI 2009: 1004-1009
27Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMohamed Faouzi Atig, Peter Habermehl: On Yen's Path Logic for Petri Nets. RP 2009: 51-63
26Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Habermehl, Tomás Vojnar: Preface. Electr. Notes Theor. Comput. Sci. 239: 1-3 (2009)
2008
25Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed 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
24Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLMohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl: Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. Developments in Language Theory 2008: 121-133
23Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Habermehl, Radu Iosif, Tomás Vojnar: What Else Is Decidable about Integer Arrays?. FoSSaCS 2008: 474-489
22Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Habermehl, Radu Iosif, Tomás Vojnar: A Logic of Singly Indexed Arrays. LPAR 2008: 558-573
21Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed 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
20Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Habermehl, Radu Iosif, Adam Rogalewicz, Tomás Vojnar: Proving Termination of Tree Manipulating Programs. ATVA 2007: 145-161
19Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu: Rewriting Systems with Data. FCT 2007: 1-22
2006
18Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar: Programs with Lists Are Counter Automata. CAV 2006: 517-531
17Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar: Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. SAS 2006: 52-70
16Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Habermehl, Radu Iosif, Tomás Vojnar: Automata-Based Verification of Programs with Tree Updates. TACAS 2006: 350-364
15Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar: Abstract Regular Tree Model Checking. Electr. Notes Theor. Comput. Sci. 149(1): 37-48 (2006)
2005
14Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Peter Habermehl, Pierre Moro, Tomás Vojnar: Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking. TACAS 2005: 13-29
13Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Habermehl, Tomás Vojnar: Regular Model Checking Using Inference of Regular Languages. Electr. Notes Theor. Comput. Sci. 138(3): 21-36 (2005)
2004
12Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Peter Habermehl, Tomás Vojnar: Abstract Regular Model Checking. CAV 2004: 372-386
11Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLHelmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl: Counting in Trees for Free. ICALP 2004: 1136-1149
2003
10Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Peter Habermehl, Tomás Vojnar: Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management. CONCUR 2003: 172-187
9Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Peter Habermehl, Richard Mayr: Automatic verification of recursive procedures with one integer parameter. Theor. Comput. Sci. 295: 85-106 (2003)
2001
8Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Peter Habermehl, Richard Mayr: Automatic Verification of Recursive Procedures with One Integer Parameter. MFCS 2001: 198-211
1999
7Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLParosh 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
6Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed 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
5Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Peter Habermehl: Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract). ICALP 1997: 560-570
4Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLPeter Habermehl: On the Complexity of the Linear-Time mu -calculus for Petri-Nets. ICATPN 1997: 102-116
1996
3Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Peter Habermehl: Constrained Properties, Semilinear Systems, and Petri Nets. CONCUR 1996: 481-497
1995
2Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Rachid Echahed, Peter Habermehl: On the Verification Problem of Nonregular Properties for Nonregular Processes LICS 1995: 123-133
1Electronic Edition pubzone.org CiteSeerX Google scholar BibTeX bibliographical record in XMLAhmed Bouajjani, Rachid Echahed, Peter Habermehl: Verifying Infinite State Processes with Sequential and Parallel Composition. POPL 1995: 95-106

Coauthor Index

1Parosh Aziz Abdulla [7]
2Aurore Annichini [7]
3Mohamed Faouzi Atig [24] [27] [34]
4Saddek Bensalem [7]
5Benedikt Bollig [24] [28] [29]
6Ahmed Bouajjani [1] [2] [3] [5] [6] [7] [8] [9] [10] [12] [14] [15] [17] [18] [19] [21] [25] [35] [37]
7Marius Bozga [18] [30] [35]
8Antoine Durand-Gasselin [33] [38]
9Rachid Echahed [1] [2]
10Manuela-Lidia Grindei [29]
11Lukás Holík [25] [36]
12Radu Iosif [16] [18] [20] [22] [23] [30] [31] [35]
13Yan Jurski [19]
14Carsten Kern [28]
15Filip Konecný [30]
16Yassine Lakhnech [7]
17Martin Leucker [28]
18Richard Mayr [8] [9]
19Roland Meyer [32]
20Pierre Moro [14] [18] [35]
21Anca Muscholl [11]
22Adam Rogalewicz [15] [17] [20] [36] [37]
23Thomas Schwentick [11]
24Helmut Seidl [11]
25Mihaela Sighireanu [19]
26Jirí Simácek [36]
27Tayssir Touili [25]
28Tomás Vojnar [10] [12] [13] [14] [15] [16] [17] [18] [20] [21] [22] [23] [25] [26] [30] [31] [35] [36] [37]
29Harro Wimmel [32]

Colors in the list of coauthors

Last update Wed May 30 22:34:44 2012 CET by the DBLP TeamThis material is Open Data Data released under the ODC-BY 1.0 license — See also our legal information page