| Publication | Date of Publication | Type |
|---|
From innermost to full probabilistic term rewriting: almost-sure termination, complexity, and modularity
Logical Methods in Computer Science | 2026-02-13 | Paper |
Small term reachability and related problems for terminating term rewriting systems
Logical Methods in Computer Science | 2026-02-13 | Paper |
| Infinite state model checking by learning transitive relations | 2026-01-21 | Paper |
| On the complexity of the small term reachability problem for terminating term rewriting systems | 2026-01-14 | Paper |
Termination of triangular polynomial loops
Formal Methods in System Design | 2025-05-07 | Paper |
| 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
Computer Aided Verification | 2024-02-16 | Paper |
Generating polynomial orderings for termination proofs
Rewriting Techniques and Applications | 2022-12-09 | Paper |
Termination of constructor systems
Rewriting Techniques and Applications | 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
(available as arXiv preprint) | 2022-12-07 | Paper |
Complexity analysis for \textbf{Java} with \textsf{AProVE}
Lecture Notes in Computer Science | 2022-11-04 | Paper |
Termination analysis for partial functions
Static Analysis | 2022-02-16 | Paper |
| Termination of polynomial loops | 2021-10-18 | Paper |
Inferring expected runtimes of probabilistic integer programs using expected sizes
(available as arXiv preprint) | 2021-08-04 | Paper |
Computing expected runtimes for constant probability programs
(available as arXiv preprint) | 2020-03-10 | Paper |
Analyzing runtime complexity via innermost runtime complexity
EPiC Series in Computing | 2019-01-10 | Paper |
Constant runtime complexity of term rewriting is semi-decidable
Information Processing Letters | 2018-10-19 | Paper |
Proving termination of programs with bitvector arithmetic by symbolic execution
Software Engineering and Formal Methods | 2018-07-06 | Paper |
Termination and complexity analysis for programs with bitvector arithmetic by symbolic execution
Journal of Logical and Algebraic Methods in Programming | 2018-06-27 | Paper |
| Complexity analysis for term rewriting by integer transition systems | 2018-01-04 | Paper |
Proving innermost normalisation automatically
Rewriting Techniques and Applications | 2017-11-17 | Paper |
Lower bounds for runtime complexity of term rewriting
Journal of Automated Reasoning | 2017-08-15 | Paper |
| Inferring lower bounds for runtime complexity | 2017-07-12 | Paper |
Analyzing program termination and complexity automatically with \textsf{AProVE}
Journal of Automated Reasoning | 2017-07-10 | Paper |
Automatically proving termination and memory safety for programs with pointer arithmetic
Journal of Automated Reasoning | 2017-07-10 | Paper |
Lower runtime bounds for integer programs
Automated Reasoning | 2016-09-05 | Paper |
Termination Competition (termCOMP 2015)
Automated Deduction - CADE-25 | 2015-12-02 | Paper |
Automated termination proofs for logic programs by term rewriting
ACM Transactions on Computational Logic | 2015-09-17 | 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 |
Proving termination and memory safety for programs with pointer arithmetic
Automated Reasoning | 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
Journal of Automated Reasoning | 2013-08-01 | 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 |
Proving termination by dependency pairs and inductive theorem proving
Journal of Automated Reasoning | 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
Interactive Theorem Proving | 2011-08-17 | Paper |
Polytool: polynomial interpretations as a basis for termination analysis of logic programs
Theory and Practice of Logic Programming | 2011-08-17 | Paper |
SAT-based termination analysis using monotonicity constraints over the integers
Theory and Practice of Logic Programming | 2011-08-16 | Paper |
A dependency pair framework for innermost complexity analysis of term rewrite systems
Lecture Notes in Computer Science | 2011-07-29 | Paper |
Dependency triples for improving termination analysis of logic programs with cut
Logic-Based Program Synthesis and Transformation | 2011-05-27 | Paper |
Termination graphs for Java bytecode
Verification, Induction, Termination Analysis | 2010-11-22 | Paper |
Lazy abstraction for size-change termination
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
Automated termination analysis for logic programs with cut
Theory and Practice of Logic Programming | 2010-08-19 | Paper |
The dependency triple framework for termination of logic programs
Logic-Based Program Synthesis and Transformation | 2010-05-04 | Paper |
Deciding inductive validity of equations.
Lecture Notes in Computer Science | 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
Lecture Notes in Computer Science | 2009-08-11 | Paper |
Termination Analysis by Dependency Pairs and Inductive Theorem Proving
Automated Deduction – CADE-22 | 2009-07-28 | Paper |
Proving Termination of Integer Term Rewriting
Rewriting Techniques and Applications | 2009-06-30 | Paper |
SAT Solving for Termination Analysis with Polynomial Interpretations
Theory and Applications of Satisfiability Testing – SAT 2007 | 2009-03-10 | Paper |
Proving Termination by Bounded Increase
Automated Deduction – CADE-21 | 2009-03-06 | Paper |
Search Techniques for Rational Polynomial Orders
Lecture Notes in Computer Science | 2009-01-27 | Paper |
Improving Context-Sensitive Dependency Pairs
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Termination Analysis of Logic Programs Based on Dependency Graphs
Logic-Based Program Synthesis and Transformation | 2009-01-22 | Paper |
Automated Termination Analysis for Haskell: From Term Rewriting to Programming Languages
Lecture Notes in Computer Science | 2008-09-25 | Paper |
Proving Termination Using Recursive Path Orders and SAT Solving
Frontiers of Combining Systems | 2008-09-16 | Paper |
Adding constants to string rewriting
Applicable Algebra in Engineering, Communication and Computing | 2008-09-10 | Paper |
Maximal Termination
Rewriting Techniques and Applications | 2008-08-28 | Paper |
Deciding Innermost Loops
Rewriting Techniques and Applications | 2008-08-28 | Paper |
SAT Solving for Argument Filterings
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Automated Reasoning
Lecture Notes in Computer Science | 2007-09-25 | Paper |
Automated Termination Analysis for Logic Programs by Term Rewriting
Logic-Based Program Synthesis and Transformation | 2007-09-10 | Paper |
Deaccumulation techniques for improving provability
The Journal of Logic and Algebraic Programming | 2007-05-23 | Paper |
Mechanizing and improving dependency pairs
Journal of Automated Reasoning | 2007-05-03 | Paper |
Frontiers of Combining Systems
Lecture Notes in Computer Science | 2006-10-10 | Paper |
The size-change principle and dependency pairs for termination of term rewriting
Applicable Algebra in Engineering, Communication and Computing | 2005-11-24 | Paper |
Logic for Programming, Artificial Intelligence, and Reasoning
Lecture Notes in Computer Science | 2005-11-10 | Paper |
Transformation techniques for context-sensitive rewrite systems
Journal of Functional Programming | 2005-09-27 | Paper |
| scientific article; zbMATH DE number 2177631 (Why is no real title available?) | 2005-06-21 | Paper |
| scientific article; zbMATH DE number 2043534 (Why is no real title available?) | 2004-02-16 | Paper |
| scientific article; zbMATH DE number 2043538 (Why is no real title available?) | 2004-02-16 | Paper |
| scientific article; zbMATH DE number 1948501 (Why is no real title available?) | 2003-07-13 | Paper |
| scientific article; zbMATH DE number 1765694 (Why is no real title available?) | 2002-07-10 | Paper |
| Pushing the frontiers of combining rewrite systems farther outwards | 2002-04-03 | Paper |
| scientific article; zbMATH DE number 1722701 (Why is no real title available?) | 2002-03-21 | Paper |
| scientific article; zbMATH DE number 1670496 (Why is no real title available?) | 2001-11-11 | Paper |
Verification of Erlang processes by dependency pairs
Applicable Algebra in Engineering, Communication and Computing | 2001-08-26 | Paper |
| scientific article; zbMATH DE number 1615264 (Why is no real title available?) | 2001-07-08 | Paper |
| scientific article; zbMATH DE number 1614705 (Why is no real title available?) | 2001-07-05 | Paper |
| Termination analysis for functional programs | 2001-03-12 | Paper |
Induction proofs with partial functions
Journal of Automated Reasoning | 2001-02-18 | Paper |
Approximating the domains of functional and imperative programs
Science of Computer Programming | 2000-01-04 | Paper |
Termination of nested and mutually recursive algorithms
Journal of Automated Reasoning | 1998-02-04 | Paper |
