| Publication | Date of Publication | Type |
|---|
| From innermost to full almost-sure termination of probabilistic term rewriting | 2024-10-30 | Paper |
| Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs | 2024-05-03 | Paper |
| Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper) | 2024-04-26 | Paper |
| Proving Termination of C Programs with Lists | 2024-04-26 | Paper |
| Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs | 2024-04-26 | Paper |
| Termination of triangular Integer loops is decidable | 2024-02-16 | Paper |
| Generating polynomial orderings for termination proofs | 2022-12-09 | Paper |
| Termination of constructor systems | 2022-12-09 | Paper |
| Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description) | 2022-12-07 | Paper |
| Automatic complexity analysis of integer programs via triangular weakly non-linear loops | 2022-12-07 | Paper |
| Complexity analysis for \textbf{Java} with \textsf{AProVE} | 2022-11-04 | Paper |
| Termination analysis for partial functions | 2022-02-16 | Paper |
| Termination of polynomial loops | 2021-10-18 | Paper |
| Inferring expected runtimes of probabilistic integer programs using expected sizes | 2021-08-04 | Paper |
| Computing expected runtimes for constant probability programs | 2020-03-10 | Paper |
| Analyzing runtime complexity via innermost runtime complexity | 2019-01-10 | Paper |
| Constant runtime complexity of term rewriting is semi-decidable | 2018-10-19 | Paper |
| Proving termination of programs with bitvector arithmetic by symbolic execution | 2018-07-06 | Paper |
| Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution | 2018-06-27 | Paper |
| Complexity analysis for term rewriting by integer transition systems | 2018-01-04 | Paper |
| Proving innermost normalisation automatically | 2017-11-17 | Paper |
| Lower bounds for runtime complexity of term rewriting | 2017-08-15 | Paper |
| Inferring lower bounds for runtime complexity | 2017-07-12 | Paper |
| Analyzing program termination and complexity automatically with \textsf{AProVE} | 2017-07-10 | Paper |
| Automatically proving termination and memory safety for programs with pointer arithmetic | 2017-07-10 | Paper |
| Lower runtime bounds for integer programs | 2016-09-05 | Paper |
| Termination Competition (termCOMP 2015) | 2015-12-02 | Paper |
| Automated termination proofs for logic programs by term rewriting | 2015-09-17 | Paper |
| Analyzing innermost runtime complexity of term rewriting by dependency pairs | 2015-06-23 | Paper |
| Proving termination of programs automatically with AProVE | 2014-09-26 | Paper |
| Proving termination and memory safety for programs with pointer arithmetic | 2014-09-26 | Paper |
| Simulating liveness by reduction strategies | 2013-08-27 | Paper |
| SAT solving for termination proofs with recursive path orders and dependency pairs | 2013-08-01 | Paper |
| A linear operational semantics for termination and complexity analysis of ISO prolog | 2013-03-13 | Paper |
| Proving Non-looping Non-termination Automatically | 2012-09-05 | Paper |
| Proving termination by dependency pairs and inductive theorem proving | 2012-07-31 | Paper |
| Automated termination analysis of Java bytecode by term rewriting | 2012-04-25 | Paper |
| Modular termination proofs of recursive Java bytecode programs by term rewriting | 2012-04-24 | Paper |
| Termination of Isabelle functions via termination of rewriting | 2011-08-17 | Paper |
| Polytool: polynomial interpretations as a basis for termination analysis of logic programs | 2011-08-17 | Paper |
| SAT-based termination analysis using monotonicity constraints over the integers | 2011-08-16 | Paper |
| A dependency pair framework for innermost complexity analysis of term rewrite systems | 2011-07-29 | Paper |
| Dependency triples for improving termination analysis of logic programs with cut | 2011-05-27 | Paper |
| Termination graphs for Java bytecode | 2010-11-22 | Paper |
| Lazy abstraction for size-change termination | 2010-10-12 | Paper |
| Automated termination analysis for logic programs with cut | 2010-08-19 | Paper |
| The dependency triple framework for termination of logic programs | 2010-05-04 | Paper |
| Deciding inductive validity of equations. | 2010-04-20 | Paper |
| Improving dependency pairs | 2010-02-24 | Paper |
| Advances in Computing Science – ASIAN 2003. Progamming Languages and Distributed Computation Programming Languages and Distributed Computation | 2009-08-11 | Paper |
| Termination Analysis by Dependency Pairs and Inductive Theorem Proving | 2009-07-28 | Paper |
| Proving Termination of Integer Term Rewriting | 2009-06-30 | Paper |
| SAT Solving for Termination Analysis with Polynomial Interpretations | 2009-03-10 | Paper |
| Proving Termination by Bounded Increase | 2009-03-06 | Paper |
| Search Techniques for Rational Polynomial Orders | 2009-01-27 | Paper |
| Improving Context-Sensitive Dependency Pairs | 2009-01-27 | Paper |
| Termination Analysis of Logic Programs Based on Dependency Graphs | 2009-01-22 | Paper |
| Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages | 2008-09-25 | Paper |
| Proving Termination Using Recursive Path Orders and SAT Solving | 2008-09-16 | Paper |
| Adding constants to string rewriting | 2008-09-10 | Paper |
| Maximal Termination | 2008-08-28 | Paper |
| Deciding Innermost Loops | 2008-08-28 | Paper |
| SAT Solving for Argument Filterings | 2008-05-27 | Paper |
| Automated Reasoning | 2007-09-25 | Paper |
| Automated Termination Analysis for Logic Programs by Term Rewriting | 2007-09-10 | Paper |
| Deaccumulation techniques for improving provability | 2007-05-23 | Paper |
| Mechanizing and improving dependency pairs | 2007-05-03 | Paper |
| Frontiers of Combining Systems | 2006-10-10 | Paper |
| The size-change principle and dependency pairs for termination of term rewriting | 2005-11-24 | Paper |
| Logic for Programming, Artificial Intelligence, and Reasoning | 2005-11-10 | Paper |
| Transformation techniques for context-sensitive rewrite systems | 2005-09-27 | Paper |
| https://portal.mardi4nfdi.de/entity/Q3021913 | 2005-06-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4447238 | 2004-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4447242 | 2004-02-16 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4412115 | 2003-07-13 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4539635 | 2002-07-10 | Paper |
| Pushing the frontiers of combining rewrite systems farther outwards | 2002-04-03 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778873 | 2002-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2753692 | 2001-11-11 | Paper |
| Verification of Erlang processes by dependency pairs | 2001-08-26 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723934 | 2001-07-08 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2723429 | 2001-07-05 | Paper |
| Termination analysis for functional programs | 2001-03-12 | Paper |
| Induction proofs with partial functions | 2001-02-18 | Paper |
| Approximating the domains of functional and imperative programs | 2000-01-04 | Paper |
| Termination of nested and mutually recursive algorithms | 1998-02-04 | Paper |
