| Publication | Date of Publication | Type |
|---|
On complexity bounds and confluence of parallel term rewriting
Fundamenta Informaticae | 2024-10-21 | Paper |
A static higher-order dependency pair framework
Programming Languages and Systems | 2023-11-24 | Paper |
Analysing parallel complexity of term rewriting
Logic-Based Program Synthesis and Transformation | 2023-06-02 | Paper |
Polynomial interpretations for higher-order rewriting
(available as arXiv preprint) | 2020-05-27 | Paper |
| Transforming derivational complexity of term rewriting to runtime complexity | 2020-05-13 | Paper |
A decision procedure for satisfiability in separation logic with inductive predicates
Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM/IEEE Symposium on Logic in Computer Science (LICS) | 2018-04-23 | Paper |
| Complexity analysis for term rewriting by integer transition systems | 2018-01-04 | Paper |
Verifying procedural programs via constrained rewriting induction
ACM Transactions on Computational Logic | 2017-07-13 | Paper |
Verifying procedural programs via constrained rewriting induction
ACM Transactions on Computational Logic | 2017-07-13 | 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 |
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 |
First-order formative rules
Lecture Notes in Computer Science | 2014-07-24 | Paper |
First-order formative rules
Lecture Notes in Computer Science | 2014-07-24 | Paper |
A linear operational semantics for termination and complexity analysis of ISO prolog
Logic-Based Program Synthesis and Transformation | 2013-03-13 | Paper |
Proving termination by dependency pairs and inductive theorem proving
Journal of Automated Reasoning | 2012-07-31 | Paper |
Harnessing first order termination provers using higher order dependency pairs
Frontiers of Combining Systems | 2011-10-07 | Paper |
Termination of Isabelle functions via termination of rewriting
Interactive Theorem Proving | 2011-08-17 | Paper |
SAT-based termination analysis using monotonicity constraints over the integers
Theory and Practice of Logic Programming | 2011-08-16 | Paper |
Optimal base encodings for pseudo-Boolean constraints
Tools and Algorithms for the Construction and Analysis of Systems | 2011-05-19 | Paper |
Lazy abstraction for size-change termination
Logic for Programming, Artificial Intelligence, and Reasoning | 2010-10-12 | Paper |
Synthesizing shortest linear straight-line programs over \(\mathrm{GF}(2)\) using SAT
Theory and Applications of Satisfiability Testing – SAT 2010 | 2010-09-29 | 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 |
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 |
Maximal Termination
Rewriting Techniques and Applications | 2008-08-28 | Paper |
