| Publication | Date of Publication | Type |
|---|
Proving confluence in the confluence framework with confident
Fundamenta Informaticae | 2024-10-21 | Paper |
| scientific article; zbMATH DE number 7799622 (Why is no real title available?) | 2024-02-05 | Paper |
An Optimizing Protocol Transformation for Constructor Finite Variant Theories in Maude-NPA
1511.94044 | 2022-12-22 | 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 |
A transformational approach to resource analysis with typed-norms inference
Theory and Practice of Logic Programming | 2021-09-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 |
Variant-based decidable satisfiability in initial algebras with predicates
(available as arXiv preprint) | 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 |
A transformational approach to resource analysis with typed-norms
Logic-Based Program Synthesis and Transformation | 2015-11-30 | Paper |
A transformational approach to resource analysis with typed-norms
Logic-Based Program Synthesis and Transformation | 2015-11-30 | 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 |
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 |
Order-sorted equality enrichments modulo axioms
Rewriting Logic and Its Applications | 2012-10-16 | Paper |
Proving termination properties with \textsc{mu-term}
Algebraic Methodology and Software Technology | 2011-01-21 | Paper |
Proving termination in the context-sensitive dependency pair framework
Rewriting Logic and Its Applications | 2010-10-12 | Paper |
Context-sensitive dependency pairs
Information and Computation | 2010-08-19 | Paper |
Improving Context-Sensitive Dependency Pairs
Logic for Programming, Artificial Intelligence, and Reasoning | 2009-01-27 | Paper |
Usable Rules for Context-Sensitive Rewrite Systems
Rewriting Techniques and Applications | 2008-08-28 | Paper |
Context-Sensitive Dependency Pairs
FSTTCS 2006: Foundations of Software Technology and Theoretical Computer Science | 2008-04-17 | Paper |
