![](https://dblp.dagstuhl.de/img/logo.ua.320x120.png)
![](https://dblp.dagstuhl.de/img/dropdown.dark.16x16.png)
![](https://dblp.dagstuhl.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
![search dblp](https://dblp.dagstuhl.de/img/search.dark.16x16.png)
default search action
Jera Hensel
Person information
Refine list
![note](https://dblp.dagstuhl.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2023
- [b1]Jera Hensel:
Automated termination analysis of C programs. RWTH Aachen University, Germany, 2023 - [c8]Jera Hensel
, Jürgen Giesl
:
Proving Termination of C Programs with Lists. CADE 2023: 266-285 - [i3]Frank Emrich, Jera Hensel, Jürgen Giesl:
AProVE: Modular Termination Analysis of Memory-Manipulating C Programs. CoRR abs/2302.02382 (2023) - [i2]Jera Hensel, Jürgen Giesl:
Proving Termination of C Programs with Lists. CoRR abs/2305.12159 (2023) - [i1]Jera Hensel, Jürgen Giesl:
Automated Termination Proofs for C Programs with Lists (Short WST Version). CoRR abs/2307.11024 (2023) - 2022
- [c7]Jera Hensel
, Constantin Mensendiek
, Jürgen Giesl
:
AProVE: Non-Termination Witnesses for C Programs - (Competition Contribution). TACAS (2) 2022: 403-407
2010 – 2019
- 2018
- [j4]Jera Hensel, Jürgen Giesl
, Florian Frohn
, Thomas Ströder:
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution. J. Log. Algebraic Methods Program. 97: 105-130 (2018) - 2017
- [j3]Jürgen Giesl
, Cornelius Aschermann, Marc Brockschmidt, Fabian Emmes, Florian Frohn
, Carsten Fuhs, Jera Hensel, Carsten Otto, Martin Plücker, Peter Schneider-Kamp
, Thomas Ströder, Stephanie Swiderski, René Thiemann
:
Analyzing Program Termination and Complexity Automatically with AProVE. J. Autom. Reason. 58(1): 3-31 (2017) - [j2]Thomas Ströder, Jürgen Giesl
, Marc Brockschmidt, Florian Frohn
, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp
, Cornelius Aschermann:
Automatically Proving Termination and Memory Safety for Programs with Pointer Arithmetic. J. Autom. Reason. 58(1): 33-65 (2017) - [j1]Florian Frohn
, Jürgen Giesl
, Jera Hensel, Cornelius Aschermann, Thomas Ströder:
Lower Bounds for Runtime Complexity of Term Rewriting. J. Autom. Reason. 59(1): 121-163 (2017) - [c6]Jera Hensel, Frank Emrich, Florian Frohn
, Thomas Ströder, Jürgen Giesl
:
AProVE: Proving and Disproving Termination of Memory-Manipulating C Programs - (Competition Contribution). TACAS (2) 2017: 350-354 - 2016
- [c5]Florian Frohn
, Matthias Naaf, Jera Hensel, Marc Brockschmidt, Jürgen Giesl
:
Lower Runtime Bounds for Integer Programs. IJCAR 2016: 550-567 - [c4]Jera Hensel, Jürgen Giesl
, Florian Frohn
, Thomas Ströder:
Proving Termination of Programs with Bitvector Arithmetic by Symbolic Execution. SEFM 2016: 234-252 - 2015
- [c3]Florian Frohn
, Jürgen Giesl
, Jera Hensel, Cornelius Aschermann, Thomas Ströder:
Inferring Lower Bounds for Runtime Complexity. RTA 2015: 334-349 - [c2]Thomas Ströder, Cornelius Aschermann, Florian Frohn
, Jera Hensel, Jürgen Giesl
:
AProVE: Termination and Memory Safety of C Programs - (Competition Contribution). TACAS 2015: 417-419 - 2014
- [c1]Thomas Ströder, Jürgen Giesl
, Marc Brockschmidt, Florian Frohn
, Carsten Fuhs, Jera Hensel, Peter Schneider-Kamp
:
Proving Termination and Memory Safety for Programs with Pointer Arithmetic. IJCAR 2014: 208-223
Coauthor Index
![](https://dblp.dagstuhl.de/img/cog.dark.24x24.png)
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-07-11 19:29 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint