default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDPeter Habermehl
- > Home > Persons > Peter Habermehl
Publications
- 2022
[c40]Ahmed Bouajjani
, Wael-Amine Boutglay, Peter Habermehl:
Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes. CAV (1) 2022: 282-303- [i4]Ahmed Bouajjani, Wael-Amine Boutglay, Peter Habermehl:
Data-driven Numerical Invariant Synthesis with Automatic Generation of Attributes. CoRR abs/2205.14943 (2022) - 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) - 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) - 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) - [c19]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: 57-67 - 2007
- [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 - 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 - 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 - 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 - 1997
- [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
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:
