List of research outcomes
This list is not complete and representing at the moment only items from zbMATH Open and arXiv. We are working on additional sources - please check back here soon!
| Publication | Date of Publication | Type |
|---|---|---|
| Analyzing program termination and complexity automatically with \textsf{AProVE} Journal of Automated Reasoning | 2017-07-10 | Paper |
| Analyzing innermost runtime complexity of term rewriting by dependency pairs Journal of Automated Reasoning | 2015-06-23 | Paper |
| Proving termination of programs automatically with AProVE Automated Reasoning | 2014-09-26 | Paper |
| A linear operational semantics for termination and complexity analysis of ISO prolog Logic-Based Program Synthesis and Transformation | 2013-03-13 | Paper |
| Proving Non-looping Non-termination Automatically Automated Reasoning | 2012-09-05 | Paper |
| A dependency pair framework for innermost complexity analysis of term rewrite systems Lecture Notes in Computer Science | 2011-07-29 | Paper |
| Improving Context-Sensitive Dependency Pairs Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Research outcomes over time
This page was built for person: Fabian Emmes
