| Publication | Date of Publication | Type |
|---|
Proving confluence in the confluence framework with confident
Fundamenta Informaticae | 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
Journal of Logical and Algebraic Methods in Programming | 2024-02-12 | Paper |
| scientific article; zbMATH DE number 7799622 (Why is no real title available?) | 2024-02-05 | Paper |
Proving program properties as first-order satisfiability
Logic-Based Program Synthesis and Transformation | 2023-11-09 | Paper |
Automatically Proving and Disproving Feasibility Conditions
Automated Reasoning | 2022-11-09 | Paper |
mu-term: Verify Termination Properties Automatically (System Description)
Automated Reasoning | 2022-11-09 | Paper |
Derivational complexity and context-sensitive Rewriting
Journal of Automated Reasoning | 2022-01-21 | Paper |
Applications and extensions of context-sensitive rewriting
Journal of Logical and Algebraic Methods in Programming | 2021-08-03 | Paper |
The origins of the halting problem
Journal of Logical and Algebraic Methods in Programming | 2021-08-03 | Paper |
The 2D dependency pair framework for conditional rewrite systems. II: Advanced processors and implementation techniques
Journal of Automated Reasoning | 2021-02-17 | Paper |
| Automatic generation of logical models with AGES | 2020-03-10 | Paper |
Using well-founded relations for proving operational termination
Journal of Automated Reasoning | 2020-03-03 | Paper |
Proving semantic properties as first-order satisfiability
Artificial Intelligence | 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
Journal of Automated Reasoning | 2018-08-09 | Paper |
The 2D dependency pair framework for conditional rewrite systems. I: Definition and basic processors
Journal of Computer and System Sciences | 2018-06-06 | Paper |
Use of logical models for proving infeasibility in term rewriting
Information Processing Letters | 2018-05-25 | Paper |
Normal forms and normal theories in conditional rewriting
Journal of Logical and Algebraic Methods in Programming | 2016-12-28 | Paper |
Dependency pairs for proving termination properties of conditional term rewriting systems
Journal of Logical and Algebraic Methods in Programming | 2016-11-30 | Paper |
Use of logical models for proving operational termination in general logics
Rewriting Logic and Its Applications | 2016-10-21 | Paper |
Specialization of inductively sequential functional logic programs
Proceedings of the fourth ACM SIGPLAN international conference on Functional programming | 2016-09-01 | Paper |
Strongly sequential and inductively sequential term rewriting systems
Information Processing Letters | 2016-06-09 | Paper |
Root-neededness and approximations of neededness
Information Processing Letters | 2016-06-09 | Paper |
Methods for proving termination of rewriting-based programming languages by transformation
Electronic Notes in Theoretical Computer Science | 2016-05-20 | Paper |
Using context-sensitive rewriting for proving innermost termination of rewriting
Electronic Notes in Theoretical Computer Science | 2016-05-20 | Paper |
Extending the 2D dependency pair framework for conditional term rewriting systems
Logic-Based Program Synthesis and Transformation | 2015-10-02 | Paper |
Function Calls at Frozen Positions in Termination of Context-Sensitive Rewriting
Lecture Notes in Computer Science | 2015-09-14 | Paper |
2D dependency pairs for proving operational termination of CTRSs
Rewriting Logic and Its Applications | 2015-09-09 | Paper |
Strong and weak operational termination of order-sorted rewrite theories
Rewriting Logic and Its Applications | 2015-09-09 | Paper |
Localized operational termination in general logics
Software, Services, and Systems | 2015-06-22 | Paper |
Operational termination of membership equational programs: the order-sorted way
Electronic Notes in Theoretical Computer Science | 2015-03-19 | Paper |
Completeness of context-sensitive rewriting
Information Processing Letters | 2014-12-09 | Paper |
Automatic proofs of termination with elementary interpretations
Electronic Notes in Theoretical Computer Science | 2014-07-22 | Paper |
| Comparing CSP and SAT solvers for polynomial constraints in termination provers | 2014-01-10 | Paper |
Proving termination of context-sensitive rewriting with MU-TERM
Electronic Notes in Theoretical Computer Science | 2013-12-20 | Paper |
Improving the context-sensitive dependency graph
Electronic Notes in Theoretical Computer Science | 2013-12-20 | Paper |
| Correct and complete (positive) strategy annotations for \textsf{OBJ} | 2013-10-02 | Paper |
| Strategies in programming languages today | 2013-09-20 | Paper |
| Abstract correction of first-order functional programs | 2013-08-27 | Paper |
Lazy rewriting and context-sensitive rewriting
Electronic Notes in Theoretical Computer Science | 2013-07-24 | Paper |
SAT modulo linear arithmetic for solving polynomial constraints
Journal of Automated Reasoning | 2012-07-31 | Paper |
Removing Redundant Arguments of Functions*
Algebraic Methodology and Software Technology | 2011-05-06 | Paper |
Termination of rewriting with strategy annotations
Logic for Programming, Artificial Intelligence, and Reasoning | 2011-05-06 | Paper |
Abstract diagnosis of functional programs
Logic Based Program Synthesis and Transformation | 2011-03-04 | Paper |
Proving termination properties with \textsc{mu-term}
Algebraic Methodology and Software Technology | 2011-01-21 | Paper |
A dependency pair framework for \(A \vee C\)-termination
Rewriting Logic and Its Applications | 2010-10-12 | Paper |
Proving termination in the context-sensitive dependency pair framework
Rewriting Logic and Its Applications | 2010-10-12 | Paper |
From Matrix Interpretations over the Rationals to Matrix Interpretations over the Naturals
Lecture Notes in Computer Science | 2010-08-24 | Paper |
Context-sensitive dependency pairs
Information and Computation | 2010-08-19 | Paper |
Termination Modulo Combinations of Equational Theories
Frontiers of Combining Systems | 2010-01-07 | Paper |
On-demand strategy annotations revisited: an improved on-demand evaluation strategy
Theoretical Computer Science | 2009-12-15 | Paper |
Operational termination of conditional term rewriting systems
Information Processing Letters | 2009-12-04 | Paper |
Proving operational termination of membership equational programs
Higher-Order and Symbolic Computation | 2009-08-04 | Paper |
Solving Non-linear Polynomial Arithmetic via SAT Modulo Linear Arithmetic
Automated Deduction – CADE-22 | 2009-07-28 | Paper |
Strong and NV-sequentiality of constructor systems
Information Processing Letters | 2009-07-09 | 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 |
MTT: The Maude Termination Tool (System Description)
Automated Reasoning | 2008-11-27 | Paper |
Generalizing Newman’s Lemma for Left-Linear Rewrite Systems
Lecture Notes in Computer Science | 2008-09-25 | Paper |
Termination of Innermost Context-Sensitive Rewriting Using Dependency Pairs
Frontiers of Combining Systems | 2008-09-16 | Paper |
Usable Rules for Context-Sensitive Rewrite Systems
Rewriting Techniques and Applications | 2008-08-28 | Paper |
Termination of Fair Computations in Term Rewriting
Logic for Programming, Artificial Intelligence, and Reasoning | 2008-05-27 | Paper |
Termination of just/fair computations in term rewriting
Information and Computation | 2008-05-19 | Paper |
Context-Sensitive Dependency Pairs
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
Foundations of Software Science and Computation Structures
Lecture Notes in Computer Science | 2007-09-28 | Paper |
Removing redundant arguments automatically
Theory and Practice of Logic Programming | 2007-03-23 | Paper |
Proving termination of context-sensitive rewriting by transformation
Information and Computation | 2007-01-22 | Paper |
On the relative power of polynomials with real, rational, and integer coefficients in proofs of termination of rewriting
Applicable Algebra in Engineering, Communication and Computing | 2006-09-12 | Paper |
Specialization of functional logic programs based on needed narrowing
Theory and Practice of Logic Programming | 2006-02-08 | Paper |
Polynomials over the reals in proofs of termination : from theory to practice
RAIRO - Theoretical Informatics and Applications | 2005-09-01 | Paper |
Polynomials over the reals in proofs of termination : from theory to practice
RAIRO - Theoretical Informatics and Applications | 2005-09-01 | Paper |
Polynomials over the reals in proofs of termination : from theory to practice
RAIRO - Theoretical Informatics and Applications | 2005-09-01 | Paper |
| scientific article; zbMATH DE number 2102742 (Why is no real title available?) | 2004-09-24 | Paper |
| scientific article; zbMATH DE number 2090310 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 2090080 (Why is no real title available?) | 2004-08-12 | Paper |
| scientific article; zbMATH DE number 1980914 (Why is no real title available?) | 2003-09-15 | Paper |
Context-sensitive rewriting strategies
Information and Computation | 2003-01-14 | Paper |
| scientific article; zbMATH DE number 1696605 (Why is no real title available?) | 2002-07-22 | Paper |
| scientific article; zbMATH DE number 1722708 (Why is no real title available?) | 2002-03-21 | Paper |
An evaluation semantics for narrowing-based functional logic languages
The Journal of Functional and Logic Programming | 2001-07-31 | Paper |
| scientific article; zbMATH DE number 1332639 (Why is no real title available?) | 1999-09-09 | Paper |
