This post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.
Sitemap
A list of all the posts and pages found on the site. For you robots out there, there is an XML version available for digesting as well.
Pages
Posts
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
This is a sample blog post. Lorem ipsum I can’t remember the rest of lorem ipsum and don’t have an internet connection right now. Testing testing testing this blog post. Blog posts are cool.
orga
publications
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
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
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
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
From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
by J.-C. Kassing and J. Giesl. 2024.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.The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
by J.-C. Kassing and J. Giesl. 2025.talks
teaching
RWTH Aachen, Winter, 2022/2023.
RWTH Aachen, Winter, 2022/2023.
RWTH Aachen, Summer, 2023.
RWTH Aachen, Winter, 2023/2024.
RWTH Aachen, Winter, 2023/2024.
RWTH Aachen, Summer, 2024.
RWTH Aachen, Summer, 2024.
RWTH Aachen, Winter, 2024/2025.
RWTH Aachen, Winter, 2024/2025.
RWTH Aachen, Summer, 2025.
RWTH Aachen, Summer, 2025.
RWTH Aachen, Summer, 2025.
RWTH Aachen, Summer, 2023.
RWTH Aachen, Winter, 2023/2024.
RWTH Aachen, Summer, 2024.
RWTH Aachen, Winter, 2024/2025.
RWTH Aachen, Winter, 2024/2025.