Peter Habermehl

ORCID

Publication Activity (10 Years)

Years Active: 1995-2024
Publications (10 Years): 14

Top Venues

Joseph Fourier University, Grenoble, France (PHD)

Education History

Joseph Fourier University, Grenoble, France

PHD

Publications

Peter Habermehl, Vojtech Havlena, Michal Hecko, Lukás Holík, Ondrej Lengál
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CAV (1) (2024)
Peter Habermehl, Michal Hecko, Vojtech Havlena, Lukás Holík, Ondrej Lengál
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CoRR (2024)
Peter Habermehl, Dietrich Kuske
On Presburger arithmetic extended with non-unary counting quantifiers. Log. Methods Comput. Sci. 19 (3) (2023)
Peter Habermehl, Dietrich Kuske
On Presburger arithmetic extended with non-unary counting quantifiers. CoRR (2022)
Ahmed Bouajjani, Wael-Amine Boutglay, Peter Habermehl
Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes. CoRR (2022)
Ahmed Bouajjani, Wael-Amine Boutglay, Peter Habermehl
Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes. CAV (1) (2022)
Steven de Oliveira, Virgile Prevosto, Peter Habermehl, Saddek Bensalem
Left-Eigenvectors Are Certificates of the Orbit Problem. RP (2018)
Steven de Oliveira, Virgile Prevosto, Peter Habermehl, Saddek Bensalem
Left-eigenvectors are certificates of the Orbit Problem. CoRR (2018)
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl
Realizability of concurrent recursive programs. Formal Methods Syst. Des. 53 (3) (2018)
Normann Decker, Peter Habermehl, Martin Leucker, Arnaud Sangnier, Daniel Thoma
Model-checking Counting Temporal Logics on Flat Structures. CoRR (2017)
Normann Decker, Peter Habermehl, Martin Leucker, Arnaud Sangnier, Daniel Thoma
Model-Checking Counting Temporal Logics on Flat Structures. CONCUR (2017)
Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl
Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete. Int. J. Found. Comput. Sci. 28 (8) (2017)
Constantin Enea, Peter Habermehl, Omar Inverso, Gennaro Parlato
On the path-width of integer linear programming. Inf. Comput. 253 (2017)
Antoine Durand-Gasselin, Peter Habermehl
Regular Transformations of Data Words Through Origin Information. FoSSaCS (2016)
Peter Habermehl, Dietrich Kuske
On Presburger Arithmetic Extended with Modulo Counting Quantifiers. FoSSaCS (2015)
Normann Decker, Peter Habermehl, Martin Leucker, Daniel Thoma
Learning Transparent Data Automata. Petri Nets (2014)
Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege
A Robust Class of Data Languages and an Application to Learning. Log. Methods Comput. Sci. 10 (4) (2014)
Normann Decker, Peter Habermehl, Martin Leucker, Daniel Thoma
Ordered Navigation on Multi-attributed Data Words. CoRR (2014)
Constantin Enea, Peter Habermehl, Omar Inverso, Gennaro Parlato
On the Path-Width of Integer Linear Programming. GandALF (2014)
Normann Decker, Peter Habermehl, Martin Leucker, Daniel Thoma
Ordered Navigation on Multi-attributed Data Words. CONCUR (2014)
Benedikt Bollig, Peter Habermehl, Martin Leucker, Benjamin Monmege
A Fresh Approach to Learning Register Automata. Developments in Language Theory (2013)
Antoine Durand-Gasselin, Peter Habermehl
Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree. STACS (2012)
Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
Abstract regular (tree) model checking. Int. J. Softw. Tools Technol. Transf. 14 (2) (2012)
Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Forest automata for verification of heap manipulation. Formal Methods Syst. Des. 41 (1) (2012)
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar
Programs with lists are counter automata. Formal Methods Syst. Des. 38 (2) (2011)
Peter Habermehl, Lukás Holík, Adam Rogalewicz, Jirí Simácek, Tomás Vojnar
Forest Automata for Verification of Heap Manipulation. CAV (2011)
Mohamed Faouzi Atig, Peter Habermehl
On Yen's Path Logic for Petri Nets. Int. J. Found. Comput. Sci. 22 (4) (2011)
Antoine Durand-Gasselin, Peter Habermehl
On the Use of Non-deterministic Automata for Presburger Arithmetic. CONCUR (2010)
Peter Habermehl, Radu Iosif, Tomás Vojnar
Automata-based verification of programs with tree updates. Acta Informatica 47 (1) (2010)
Peter Habermehl, Roland Meyer, Harro Wimmel
The Downward-Closure of Petri Net Languages. ICALP (2) (2010)
Peter Habermehl, Tomás Vojnar
Preface. INFINITY (2009)
Benedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker
Angluin-Style Learning of NFA. IJCAI (2009)
Marius Bozga, Peter Habermehl, Radu Iosif, Filip Konecný, Tomás Vojnar
Automatic Verification of Integer Array Programs. CAV (2009)
Mohamed Faouzi Atig, Peter Habermehl
On Yen's Path Logic for Petri Nets. RP (2009)
Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl
Realizability of Concurrent Recursive Programs. FoSSaCS (2009)
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)
Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. Developments in Language Theory (2008)
Ahmed Bouajjani, Peter Habermehl, Tomás Vojnar
Verification of parametric concurrent systems with prioritised FIFO resource management. Formal Methods Syst. Des. 32 (2) (2008)
Peter Habermehl, Radu Iosif, Tomás Vojnar
A Logic of Singly Indexed Arrays. LPAR (2008)
Peter Habermehl, Radu Iosif, Tomás Vojnar
What Else Is Decidable about Integer Arrays?. FoSSaCS (2008)
Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu
Rewriting Systems with Data. FCT (2007)
Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tomás Vojnar
Proving Termination of Tree Manipulating Programs. ATVA (2007)
Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar
Programs with Lists Are Counter Automata. CAV (2006)
Peter Habermehl, Radu Iosif, Tomás Vojnar
Automata-Based Verification of Programs with Tree Updates. TACAS (2006)
Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. SAS (2006)
Ahmed Bouajjani, Peter Habermehl, Pierre Moro, Tomás Vojnar
Verifying Programs with Dynamic 1-Selector-Linked Structures in Regular Model Checking. TACAS (2005)
Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
Abstract Regular Tree Model Checking. INFINITY (2005)
Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl
Counting in Trees for Free. ICALP (2004)
Ahmed Bouajjani, Peter Habermehl, Tomás Vojnar
Abstract Regular Model Checking. CAV (2004)
Peter Habermehl, Tomás Vojnar
Regular Model Checking Using Inference of Regular Languages. INFINITY (2004)
Ahmed Bouajjani, Peter Habermehl, Richard Mayr
Automatic verification of recursive procedures with one integer parameter. Theor. Comput. Sci. 295 (2003)
Ahmed Bouajjani, Peter Habermehl, Tomás Vojnar
Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management. CONCUR (2003)
Ahmed Bouajjani, Peter Habermehl, Richard Mayr
Automatic Verification of Recursive Procedures with One Integer Parameter. MFCS (2001)
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)
Ahmed Bouajjani, Peter Habermehl
Symbolic Reachability Analysis of FIFO-Channel Systems with Nonregular Sets of Configurations. Theor. Comput. Sci. 221 (1-2) (1999)
Peter Habermehl
On the Complexity of the Linear-Time mu -calculus for Petri-Nets. ICATPN (1997)
Ahmed Bouajjani, Peter Habermehl
Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract). ICALP (1997)
Ahmed Bouajjani, Peter Habermehl
Constrained Properties, Semilinear Systems, and Petri Nets. CONCUR (1996)
Ahmed Bouajjani, Rachid Echahed, Peter Habermehl
Verifying Infinite State Processes with Sequential and Parallel Composition. POPL (1995)
Ahmed Bouajjani, Rachid Echahed, Peter Habermehl
On the Verification Problem of Nonregular Properties for Nonregular Processes LICS (1995)

Peter Habermehl.css-eqlu8i{font-size:small;padding-left:4px;}

Publication Activity (10 Years)

Top Topics

Top Venues

Peter Habermehl