Search the dblp DataBase
Peter Habermehl :
[Publications ]
[Author Rank by year ]
[Co-authors ]
[Prefers ]
[Cites ]
[Cited by ]
Publications of Author
Peter Habermehl On the Complexity of the Linear-Time mu -calculus for Petri-Nets. [Citation Graph (0, 0)][DBLP ] ICATPN, 1997, pp:102-116 [Conf ] Parosh Aziz Abdulla , Aurore Annichini , Saddek Bensalem , Ahmed Bouajjani , Peter Habermehl , Yassine Lakhnech Verification of Infinite-State Systems by Combining Abstraction and Reachability Analysis. [Citation Graph (0, 0)][DBLP ] CAV, 1999, pp:146-159 [Conf ] Ahmed Bouajjani , Marius Bozga , Peter Habermehl , Radu Iosif , Pierre Moro , Tomás Vojnar Programs with Lists Are Counter Automata. [Citation Graph (0, 0)][DBLP ] CAV, 2006, pp:517-531 [Conf ] Ahmed Bouajjani , Peter Habermehl , Tomás Vojnar Abstract Regular Model Checking. [Citation Graph (0, 0)][DBLP ] CAV, 2004, pp:372-386 [Conf ] Ahmed Bouajjani , Peter Habermehl Constrained Properties, Semilinear Systems, and Petri Nets. [Citation Graph (0, 0)][DBLP ] CONCUR, 1996, pp:481-497 [Conf ] Ahmed Bouajjani , Peter Habermehl , Tomás Vojnar Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management. [Citation Graph (0, 0)][DBLP ] CONCUR, 2003, pp:172-187 [Conf ] Ahmed Bouajjani , Peter Habermehl Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract). [Citation Graph (0, 0)][DBLP ] ICALP, 1997, pp:560-570 [Conf ] Helmut Seidl , Thomas Schwentick , Anca Muscholl , Peter Habermehl Counting in Trees for Free. [Citation Graph (0, 0)][DBLP ] ICALP, 2004, pp:1136-1149 [Conf ] Ahmed Bouajjani , Rachid Echahed , Peter Habermehl On the Verification Problem of Nonregular Properties for Nonregular Processes [Citation Graph (0, 0)][DBLP ] LICS, 1995, pp:123-133 [Conf ] Ahmed Bouajjani , Peter Habermehl , Richard Mayr Automatic Verification of Recursive Procedures with One Integer Parameter. [Citation Graph (0, 0)][DBLP ] MFCS, 2001, pp:198-211 [Conf ] Ahmed Bouajjani , Rachid Echahed , Peter Habermehl Verifying Infinite State Processes with Sequential and Parallel Composition. [Citation Graph (0, 0)][DBLP ] POPL, 1995, pp:95-106 [Conf ] Ahmed Bouajjani , Peter Habermehl , Adam Rogalewicz , Tomás Vojnar Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. [Citation Graph (0, 0)][DBLP ] SAS, 2006, pp:52-70 [Conf ] Ahmed Bouajjani , Peter Habermehl , Pierre Moro , Tomás Vojnar Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking. [Citation Graph (0, 0)][DBLP ] TACAS, 2005, pp:13-29 [Conf ] Peter Habermehl , Radu Iosif , Tomás Vojnar Automata-Based Verification of Programs with Tree Updates. [Citation Graph (0, 0)][DBLP ] TACAS, 2006, pp:350-364 [Conf ] Ahmed Bouajjani , Peter Habermehl , Adam Rogalewicz , Tomás Vojnar Abstract Regular Tree Model Checking. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2006, v:149, n:1, pp:37-48 [Journal ] Peter Habermehl , Tomás Vojnar Regular Model Checking Using Inference of Regular Languages. [Citation Graph (0, 0)][DBLP ] Electr. Notes Theor. Comput. Sci., 2005, v:138, n:3, pp:21-36 [Journal ] Ahmed Bouajjani , Peter Habermehl Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 1999, v:221, n:1-2, pp:211-250 [Journal ] Ahmed Bouajjani , Peter Habermehl , Richard Mayr Automatic verification of recursive procedures with one integer parameter. [Citation Graph (0, 0)][DBLP ] Theor. Comput. Sci., 2003, v:1, n:, pp:85-106 [Journal ] Peter Habermehl , Radu Iosif , Adam Rogalewicz , Tomás Vojnar Proving Termination of Tree Manipulating Programs. [Citation Graph (0, 0)][DBLP ] ATVA, 2007, pp:145-161 [Conf ] Ahmed Bouajjani , Peter Habermehl , Yan Jurski , Mihaela Sighireanu Rewriting Systems with Data. [Citation Graph (0, 0)][DBLP ] FCT, 2007, pp:1-22 [Conf ] Automatic Verification of Integer Array Programs. [Citation Graph (, )][DBLP ] On the Use of Non-deterministic Automata for Presburger Arithmetic. [Citation Graph (, )][DBLP ] Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. [Citation Graph (, )][DBLP ] What Else Is Decidable about Integer Arrays?. [Citation Graph (, )][DBLP ] Realizability of Concurrent Recursive Programs. [Citation Graph (, )][DBLP ] The Downward-Closure of Petri Net Languages. [Citation Graph (, )][DBLP ] Angluin-Style Learning of NFA. [Citation Graph (, )][DBLP ] A Logic of Singly Indexed Arrays. [Citation Graph (, )][DBLP ] Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. [Citation Graph (, )][DBLP ] On Yen's Path Logic for Petri Nets. [Citation Graph (, )][DBLP ] Automata-based verification of programs with tree updates. [Citation Graph (, )][DBLP ] Preface. [Citation Graph (, )][DBLP ] Search in 0.002secs, Finished in 0.003secs