| Publication | Date of Publication | Type |
|---|
| Proving confluence in the confluence framework with confident | 2024-10-21 | Paper |
| Fundamentals of context-sensitive rewriting | 2024-07-17 | Paper |
| A new proposal of concurrent process calculus | 2024-06-21 | Paper |
| Local confluence of conditional and generalized term rewriting systems | 2024-02-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q6187062 | 2024-02-05 | Paper |
| Proving program properties as first-order satisfiability | 2023-11-09 | Paper |
| Automatically Proving and Disproving Feasibility Conditions | 2022-11-09 | Paper |
| mu-term: Verify Termination Properties Automatically (System Description) | 2022-11-09 | Paper |
| Derivational complexity and context-sensitive Rewriting | 2022-01-21 | Paper |
| Applications and extensions of context-sensitive rewriting | 2021-08-03 | Paper |
| The origins of the halting problem | 2021-08-03 | Paper |
| The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques | 2021-02-17 | Paper |
| Automatic generation of logical models with AGES | 2020-03-10 | Paper |
| Using well-founded relations for proving operational termination | 2020-03-03 | Paper |
| Proving semantic properties as first-order satisfiability | 2020-01-20 | Paper |
| Analysis of rewriting-based systems as first-order theories | 2018-09-06 | Paper |
| Automatic synthesis of logical models for order-sorted first-order theories | 2018-08-09 | Paper |
| The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors | 2018-06-06 | Paper |
| Use of logical models for proving infeasibility in term rewriting | 2018-05-25 | Paper |
| Normal forms and normal theories in conditional rewriting | 2016-12-28 | Paper |
| Dependency pairs for proving termination properties of conditional term rewriting systems | 2016-11-30 | Paper |
| Use of Logical Models for Proving Operational Termination in General Logics | 2016-10-21 | Paper |
| Specialization of inductively sequential functional logic programs | 2016-09-01 | Paper |
| Strongly sequential and inductively sequential term rewriting systems | 2016-06-09 | Paper |
| Root-neededness and approximations of neededness | 2016-06-09 | Paper |
| Using Context-Sensitive Rewriting for Proving Innermost Termination of Rewriting | 2016-05-20 | Paper |
| Methods for Proving Termination of Rewriting-based Programming Languages by Transformation | 2016-05-20 | Paper |
| Extending the 2D Dependency Pair Framework for Conditional Term Rewriting Systems | 2015-10-02 | Paper |
| Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting | 2015-09-14 | Paper |
| Strong and Weak Operational Termination of Order-Sorted Rewrite Theories | 2015-09-09 | Paper |
| 2D Dependency Pairs for Proving Operational Termination of CTRSs | 2015-09-09 | Paper |
| Localized Operational Termination in General Logics | 2015-06-22 | Paper |
| Operational Termination of Membership Equational Programs: the Order-Sorted Way | 2015-03-19 | Paper |
| Completeness of context-sensitive rewriting | 2014-12-09 | Paper |
| Automatic Proofs of Termination With Elementary Interpretations | 2014-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2871851 | 2014-01-10 | Paper |
| Improving the Context-sensitive Dependency Graph | 2013-12-20 | Paper |
| Proving Termination of Context-Sensitive Rewriting with MU-TERM | 2013-12-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2851049 | 2013-10-02 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2849587 | 2013-09-20 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2844059 | 2013-08-27 | Paper |
| Lazy Rewriting and Context-Sensitive Rewriting | 2013-07-24 | Paper |
| SAT modulo linear arithmetic for solving polynomial constraints | 2012-07-31 | Paper |
| Removing Redundant Arguments of Functions* | 2011-05-06 | Paper |
| Termination of Rewriting with Strategy Annotations | 2011-05-06 | Paper |
| Abstract Diagnosis of Functional Programs | 2011-03-04 | Paper |
| Proving Termination Properties with mu-term | 2011-01-21 | Paper |
| Proving Termination in the Context-Sensitive Dependency Pair Framework | 2010-10-12 | Paper |
| A Dependency Pair Framework for A ∨ C-Termination | 2010-10-12 | Paper |
| From Matrix Interpretations over the Rationals to Matrix Interpretations over the Naturals | 2010-08-24 | Paper |
| Context-sensitive dependency pairs | 2010-08-19 | Paper |
| Termination Modulo Combinations of Equational Theories | 2010-01-07 | Paper |
| On-demand strategy annotations revisited: an improved on-demand evaluation strategy | 2009-12-15 | Paper |
| Operational termination of conditional term rewriting systems | 2009-12-04 | Paper |
| Proving operational termination of membership equational programs | 2009-08-04 | Paper |
| Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic | 2009-07-28 | Paper |
| Strong and NV-sequentiality of constructor systems | 2009-07-09 | Paper |
| Search Techniques for Rational Polynomial Orders | 2009-01-27 | Paper |
| Improving Context-Sensitive Dependency Pairs | 2009-01-27 | Paper |
| MTT: The Maude Termination Tool (System Description) | 2008-11-27 | Paper |
| Generalizing Newman’s Lemma for Left-Linear Rewrite Systems | 2008-09-25 | Paper |
| Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs | 2008-09-16 | Paper |
| Usable Rules for Context-Sensitive Rewrite Systems | 2008-08-28 | Paper |
| Termination of Fair Computations in Term Rewriting | 2008-05-27 | Paper |
| Termination of just/fair computations in term rewriting | 2008-05-19 | Paper |
| Context-Sensitive Dependency Pairs | 2008-04-17 | Paper |
| Foundations of Software Science and Computation Structures | 2007-09-28 | Paper |
| Removing redundant arguments automatically | 2007-03-23 | Paper |
| Proving termination of context-sensitive rewriting by transformation | 2007-01-22 | Paper |
| On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting | 2006-09-12 | Paper |
| Specialization of functional logic programs based on needed narrowing | 2006-02-08 | Paper |
| Polynomials over the reals in proofs of termination : from theory to practice | 2005-09-01 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4818829 | 2004-09-24 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4808754 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4809069 | 2004-08-12 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4428288 | 2003-09-15 | Paper |
| Context-sensitive rewriting strategies | 2003-01-14 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2766794 | 2002-07-22 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2778880 | 2002-03-21 | Paper |
| https://portal.mardi4nfdi.de/entity/Q2726287 | 2001-07-31 | Paper |
| https://portal.mardi4nfdi.de/entity/Q4259966 | 1999-09-09 | Paper |
