Publications

Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting

by J.-C. Kassing, L. Spitzer, J. Giesl. In Proceedings of the 27th International Symposium on Principles and Practice of Declarative Programming (PPDP 2025), Rende, Italy, To be published, 2025.

Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems

by E. Ahrens, J.-C. Kassing, J. Giesl, J.-P. Katoen. In Proceedings of the 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025), Birmingham, UK, LIPIcs, Volume 337, pages 6:1-6:21, 2025.

Download Paper | Extended Version

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting

by J.-C. Kassing and J. Giesl. In Principles of Verification: Cycling the Probabilistic Landscape (Festschrift), Aachen, Germany, Lecture Notes in Computer Science 15260, pages 339-366, 2024.

Download Paper | Extended Version | Evaluation Website

A Dependency Pair Framework for Relative Termination of Term Rewriting

by J.-C. Kassing, G. Vartanyan, and J. Giesl. In Proceedings of the International Joint Conference on Automated Reasoning (IJCAR 2024), Nancy, France, Lecture Notes in Artificial Intelligence 14740, pages 360-380, 2024.

Download Paper | Extended Version | Download Slides | Evaluation Website

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting

by J.-C. Kassing, S. Dollase, and J. Giesl. In Proceedings of the 17th International Symposium on Functional and Logic Programming (FLOPS 2024), Kumamoto, Japan, Lecture Notes in Computer Science 14659, pages 62-80, 2024.

Download Paper | Extended Version | Download Slides | Evaluation Website

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting

by J.-C. Kassing, F. Frohn, and J. Giesl. In Proceedings of the 27th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS 2024), Luxembourg City, Luxembourg, Lecture Notes in Computer Science 14575, pages 206-228, 2024.

Download Paper | Extended Version | Download Slides | Evaluation Website

Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs

by J.-C. Kassing and J. Giesl. In Proceedings of the 29th International Conference on Automated Deduction (CADE 2023), Rome, Italy, Lecture Notes in Artificial Intelligence 14132, pages 344-364, 2023.

Download Paper | Extended Version | Download Slides | Evaluation Website

The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting

by J.-C. Kassing and J. Giesl. 2025.

Download Paper | Evaluation Website

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity

by J.-C. Kassing and J. Giesl. 2024.

Download Paper | Evaluation Website

AProVE25: Confluence Analysis in a Termination Tool

by J.-C. Kassing, T. Sokolowski. In 13th International Workshop on Confluence, Leipzig, Germany, , 2025.

Download Paper

AProVE: Becoming Open Source and Recent Improvements

by F. Frohn, C. Fuhs, J. Giesl, J.-C. Kassing, N. Lommen. In 20th International Workshop on Termination, Leipzig, Germany, , 2025.

Download Paper

Modularity of Termination in Probabilistic Term Rewriting

by J.-C. Kassing, J. Giesl. In 20th International Workshop on Termination, Leipzig, Germany, , 2025.

Download Paper

A Dependency Pair Framework for Relative Termination of Term Rewriting

by J.-C. Kassing, G. Vartanyan, J. Giesl. In 20th International Workshop on Termination, Leipzig, Germany, , 2025.

Download Paper

Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting (Short WST Version)

by J.-C. Kassing, J. Giesl. In 19th International Workshop on Termination, Obergurgl, Austria, , 2023.

Download Paper