![](https://dblp.uni-trier.de/img/logo.ua.320x120.png)
![](https://dblp.uni-trier.de/img/dropdown.dark.16x16.png)
![](https://dblp.uni-trier.de/img/peace.dark.16x16.png)
Остановите войну!
for scientists:
![search dblp search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
![search dblp](https://dblp.uni-trier.de/img/search.dark.16x16.png)
default search action
Fabian Emmes
Person information
Refine list
![note](https://dblp.uni-trier.de/img/note-mark.dark.12x12.png)
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2010 – 2019
- 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) - 2016
- [j2]Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl:
Analyzing Runtime and Size Complexity of Integer Programs. ACM Trans. Program. Lang. Syst. 38(4): 13:1-13:50 (2016) - 2014
- [c8]Jürgen Giesl
, Marc Brockschmidt, Fabian Emmes, Florian Frohn
, Carsten Fuhs, Carsten Otto, Martin Plücker, Peter Schneider-Kamp
, Thomas Ströder, Stephanie Swiderski, René Thiemann
:
Proving Termination of Programs Automatically with AProVE. IJCAR 2014: 184-191 - [c7]Marc Brockschmidt, Fabian Emmes, Stephan Falke, Carsten Fuhs, Jürgen Giesl
:
Alternating Runtime and Size Complexity Analysis of Integer Programs. TACAS 2014: 140-155 - 2013
- [j1]Lars Noschinski, Fabian Emmes, Jürgen Giesl
:
Analyzing Innermost Runtime Complexity of Term Rewriting by Dependency Pairs. J. Autom. Reason. 51(1): 27-56 (2013) - 2012
- [c6]Fabian Emmes, Tim Enger, Jürgen Giesl
:
Proving Non-looping Non-termination Automatically. IJCAR 2012: 225-240 - [c5]Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp
, Fabian Emmes, Carsten Fuhs:
Symbolic Evaluation Graphs and Term Rewriting - A General Methodology for Analyzing Logic Programs. LOPSTR 2012: 1 - [c4]Jürgen Giesl, Thomas Ströder, Peter Schneider-Kamp
, Fabian Emmes, Carsten Fuhs:
Symbolic evaluation graphs and term rewriting: a general methodology for analyzing logic programs. PPDP 2012: 1-12 - 2011
- [c3]Lars Noschinski, Fabian Emmes, Jürgen Giesl
:
A Dependency Pair Framework for Innermost Complexity Analysis of Term Rewrite Systems. CADE 2011: 422-438 - [c2]Thomas Ströder, Fabian Emmes, Peter Schneider-Kamp
, Jürgen Giesl
, Carsten Fuhs:
A Linear Operational Semantics for Termination and Complexity Analysis of ISO Prolog. LOPSTR 2011: 237-252
2000 – 2009
- 2008
- [c1]Beatriz Alarcón, Fabian Emmes, Carsten Fuhs, Jürgen Giesl
, Raúl Gutiérrez
, Salvador Lucas
, Peter Schneider-Kamp
, René Thiemann
:
Improving Context-Sensitive Dependency Pairs. LPAR 2008: 636-651
Coauthor Index
![](https://dblp.uni-trier.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-04-24 23:04 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint