default search action
Peter Habermehl
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [c41]Peter Habermehl
, Vojtech Havlena
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CAV (1) 2024: 42-67 - [i6]Peter Habermehl, Michal Hecko, Vojtech Havlena, Lukás Holík, Ondrej Lengál:
Algebraic Reasoning Meets Automata in Solving Linear Integer Arithmetic. CoRR abs/2403.18995 (2024) - 2023
- [j13]Peter Habermehl, Dietrich Kuske:
On Presburger arithmetic extended with non-unary counting quantifiers. Log. Methods Comput. Sci. 19(3) (2023) - 2022
- [c40]Ahmed Bouajjani
Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes. CAV (1) 2022: 282-303 - [i5]Peter Habermehl, Dietrich Kuske:
On Presburger arithmetic extended with non-unary counting quantifiers. CoRR abs/2204.03903 (2022) - [i4]Ahmed Bouajjani, Wael-Amine Boutglay, Peter Habermehl:
Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes. CoRR abs/2205.14943 (2022)
2010 – 2019
- 2019
- [d1]Ondrej Lengál
Forester Virtual Machine. Zenodo, 2019 - 2018
- [j12]Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl:
Realizability of concurrent recursive programs. Formal Methods Syst. Des. 53(3): 339-362 (2018) - [c39]Steven de Oliveira, Virgile Prevosto
Left-Eigenvectors Are Certificates of the Orbit Problem. RP 2018: 30-44 - [i3]Steven de Oliveira, Virgile Prevosto, Peter Habermehl, Saddek Bensalem:
Left-eigenvectors are certificates of the Orbit Problem. CoRR abs/1803.09511 (2018) - 2017
- [j11]Constantin Enea, Peter Habermehl, Omar Inverso
On the path-width of integer linear programming. Inf. Comput. 253: 257-271 (2017) - [j10]Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl:
Emptiness of Ordered Multi-Pushdown Automata is 2ETIME-Complete. Int. J. Found. Comput. Sci. 28(8): 945-976 (2017) - [c38]Normann Decker, Peter Habermehl, Martin Leucker
Model-Checking Counting Temporal Logics on Flat Structures. CONCUR 2017: 29:1-29:17 - [i2]Normann Decker, Peter Habermehl, Martin Leucker, Arnaud Sangnier, Daniel Thoma:
Model-checking Counting Temporal Logics on Flat Structures. CoRR abs/1706.08608 (2017) - 2016
- [c37]Antoine Durand-Gasselin, Peter Habermehl:
Regular Transformations of Data Words Through Origin Information. FoSSaCS 2016: 285-300 - 2015
- [c36]Peter Habermehl, Dietrich Kuske:
On Presburger Arithmetic Extended with Modulo Counting Quantifiers. FoSSaCS 2015: 375-389 - 2014
- [j9]Benedikt Bollig, Peter Habermehl, Martin Leucker
A Robust Class of Data Languages and an Application to Learning. Log. Methods Comput. Sci. 10(4) (2014) - [c35]Normann Decker, Peter Habermehl, Martin Leucker
Learning Transparent Data Automata. Petri Nets 2014: 130-149 - [c34]Normann Decker, Peter Habermehl, Martin Leucker
Ordered Navigation on Multi-attributed Data Words. CONCUR 2014: 497-511 - [c33]Constantin Enea, Peter Habermehl, Omar Inverso
On the Path-Width of Integer Linear Programming. GandALF 2014: 74-87 - [i1]Normann Decker, Peter Habermehl, Martin Leucker, Daniel Thoma:
Ordered Navigation on Multi-attributed Data Words. CoRR abs/1404.6064 (2014) - 2013
- [c32]Benedikt Bollig, Peter Habermehl, Martin Leucker
A Fresh Approach to Learning Register Automata. Developments in Language Theory 2013: 118-130 - 2012
- [j8]Peter Habermehl, Lukás Holík
Forest automata for verification of heap manipulation. Formal Methods Syst. Des. 41(1): 83-106 (2012) - [j7]Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
Abstract regular (tree) model checking. Int. J. Softw. Tools Technol. Transf. 14(2): 167-191 (2012) - [c31]Antoine Durand-Gasselin, Peter Habermehl:
Ehrenfeucht-Fraïssé goes elementarily automatic for structures of bounded degree. STACS 2012: 242-253 - 2011
- [j6]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): 158-192 (2011) - [j5]Mohamed Faouzi Atig, Peter Habermehl:
On Yen's Path Logic for Petri Nets. Int. J. Found. Comput. Sci. 22(4): 783-799 (2011) - [c30]Peter Habermehl, Lukás Holík
Forest Automata for Verification of Heap Manipulation. CAV 2011: 424-440 - 2010
- [j4]Peter Habermehl, Radu Iosif, Tomás Vojnar
Automata-based verification of programs with tree updates. Acta Informatica 47(1): 1-31 (2010) - [c29]Antoine Durand-Gasselin, Peter Habermehl:
On the Use of Non-deterministic Automata for Presburger Arithmetic. CONCUR 2010: 373-387 - [c28]Peter Habermehl, Roland Meyer, Harro Wimmel:
The Downward-Closure of Petri Net Languages. ICALP (2) 2010: 466-477
2000 – 2009
- 2009
- [c27]Marius Bozga, Peter Habermehl, Radu Iosif, Filip Konecný, Tomás Vojnar
Automatic Verification of Integer Array Programs. CAV 2009: 157-172 - [c26]Benedikt Bollig, Manuela-Lidia Grindei, Peter Habermehl:
Realizability of Concurrent Recursive Programs. FoSSaCS 2009: 410-424 - [c25]Benedikt Bollig, Peter Habermehl, Carsten Kern, Martin Leucker:
Angluin-Style Learning of NFA. IJCAI 2009: 1004-1009 - [c24]Mohamed Faouzi Atig, Peter Habermehl:
On Yen's Path Logic for Petri Nets. RP 2009: 51-63 - [c23]Peter Habermehl, Tomás Vojnar
Preface. INFINITY 2009: 1-3 - [e1]Peter Habermehl, Tomás Vojnar:
Joint Proceedings of the 8th, 9th, and 10th International Workshops on Verification of Infinite-State Systems, INFINITY 2006 / 2007 / 2008, Bonn, Germany, August 26, 2006 / Lisbon, Portugal, September 8, 2007 / Toronto, Canada, August 23, 2008. Electronic Notes in Theoretical Computer Science 239, Elsevier 2009 [contents] - 2008
- [j3]Ahmed Bouajjani, Peter Habermehl, Tomás Vojnar
Verification of parametric concurrent systems with prioritised FIFO resource management. Formal Methods Syst. Des. 32(2): 129-172 (2008) - [c22]Mohamed Faouzi Atig, Benedikt Bollig, Peter Habermehl:
Emptiness of Multi-pushdown Automata Is 2ETIME-Complete. Developments in Language Theory 2008: 121-133 - [c21]Peter Habermehl, Radu Iosif, Tomás Vojnar
What Else Is Decidable about Integer Arrays?. FoSSaCS 2008: 474-489 - [c20]Peter Habermehl, Radu Iosif, Tomás Vojnar
A Logic of Singly Indexed Arrays. LPAR 2008: 558-573 - [c19]Ahmed Bouajjani, Peter Habermehl, Lukás Holík
Antichain-Based Universality and Inclusion Testing over Nondeterministic Finite Tree Automata. CIAA 2008: 57-67 - 2007
- [c18]Peter Habermehl, Radu Iosif, Adam Rogalewicz, Tomás Vojnar:
Proving Termination of Tree Manipulating Programs. ATVA 2007: 145-161 - [c17]Ahmed Bouajjani, Peter Habermehl, Yan Jurski, Mihaela Sighireanu:
Rewriting Systems with Data. FCT 2007: 1-22 - 2006
- [c16]Ahmed Bouajjani, Marius Bozga, Peter Habermehl, Radu Iosif, Pierre Moro, Tomás Vojnar:
Programs with Lists Are Counter Automata. CAV 2006: 517-531 - [c15]Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar:
Abstract Regular Tree Model Checking of Complex Dynamic Data Structures. SAS 2006: 52-70 - [c14]Peter Habermehl, Radu Iosif, Tomás Vojnar
Automata-Based Verification of Programs with Tree Updates. TACAS 2006: 350-364 - 2005
- [c13]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 - [c12]Ahmed Bouajjani, Peter Habermehl, Adam Rogalewicz, Tomás Vojnar
Abstract Regular Tree Model Checking. INFINITY 2005: 37-48 - 2004
- [c11]Ahmed Bouajjani, Peter Habermehl, Tomás Vojnar:
Abstract Regular Model Checking. CAV 2004: 372-386 - [c10]Helmut Seidl, Thomas Schwentick, Anca Muscholl, Peter Habermehl:
Counting in Trees for Free. ICALP 2004: 1136-1149 - [c9]Peter Habermehl, Tomás Vojnar
Regular Model Checking Using Inference of Regular Languages. INFINITY 2004: 21-36 - 2003
- [j2]Ahmed Bouajjani, Peter Habermehl, Richard Mayr:
Automatic verification of recursive procedures with one integer parameter. Theor. Comput. Sci. 295: 85-106 (2003) - [c8]Ahmed Bouajjani, Peter Habermehl, Tomás Vojnar:
Verification of Parametric Concurrent Systems with Prioritized FIFO Resource Management. CONCUR 2003: 172-187 - 2001
- [c7]Ahmed Bouajjani, Peter Habermehl, Richard Mayr:
Automatic Verification of Recursive Procedures with One Integer Parameter. MFCS 2001: 198-211
1990 – 1999
- 1999
- [j1]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) - [c6]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 - 1998
- [b1]Peter Habermehl:
Sur la vérification de systèmes infinis. (On the verification of infinite-state systems). Joseph Fourier University, Grenoble, France, 1998 - 1997
- [c5]Peter Habermehl:
On the Complexity of the Linear-Time mu -calculus for Petri-Nets. ICATPN 1997: 102-116 - [c4]Ahmed Bouajjani, Peter Habermehl:
Symbolic Reachability Analysis of FIFO Channel Systems with Nonregular Sets of Configurations (Extended Abstract). ICALP 1997: 560-570 - 1996
- [c3]Ahmed Bouajjani, Peter Habermehl:
Constrained Properties, Semilinear Systems, and Petri Nets. CONCUR 1996: 481-497 - 1995
- [c2]Ahmed Bouajjani, Rachid Echahed, Peter Habermehl:
On the Verification Problem of Nonregular Properties for Nonregular Processes. LICS 1995: 123-133 - [c1]Ahmed Bouajjani, Rachid Echahed, Peter Habermehl:
Verifying Infinite State Processes with Sequential and Parallel Composition. POPL 1995: 95-106
Coauthor Index
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from ,
, and
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and
to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from .
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-09-09 00:12 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by: