Posts by Collection

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.

Download Paper | Evaluation Website

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

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

talks

Download Slides

teaching

Programming
RWTH Aachen, Winter, 2022/2023.

Verification Techniques
RWTH Aachen, Winter, 2022/2023.

Advanced Programming Concepts
RWTH Aachen, Summer, 2023.

Programming (Nominated for teaching award)
RWTH Aachen, Winter, 2023/2024.

Verification Techniques
RWTH Aachen, Winter, 2023/2024.

Advanced Programming Concepts
RWTH Aachen, Summer, 2024.

Foundations of Functional Programming
RWTH Aachen, Summer, 2024.

Programming
RWTH Aachen, Winter, 2024/2025.

Verification Techniques
RWTH Aachen, Winter, 2024/2025.

Advanced Programming Concepts
RWTH Aachen, Summer, 2025.

Foundations of Logic Programming
RWTH Aachen, Summer, 2025.

Satisfiability Checking
RWTH Aachen, Summer, 2025.

Using Dependency Tuples for Proving Relative Termination of Term Rewriting by Grigory Vartanyan.
RWTH Aachen, Summer, 2023.

Integration of New State-of-the-art SMT-Solvers into the Termination Tool AProVE by Jiaqian Chen.
RWTH Aachen, Winter, 2023/2024.

Integration of Advanced Interpretation Techniques for Termination Analysis of (Probabilistic) Term Rewriting by Jonas Säuberlich.
RWTH Aachen, Summer, 2024.

Analyzing Strong Almost-Sure Termination for Probabilistic Term Rewriting Using Dependency Pairs by Leon Spitzer.
RWTH Aachen, Winter, 2024/2025.

Defining H-Termination for the Analysis of Haskell Programs by Fabian Berkner.
RWTH Aachen, Winter, 2024/2025.

Jan-Christoph Kassing

Posts by Collection

orga

publications

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

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

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

A Dependency Pair Framework for Relative Termination of Term Rewriting

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

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

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

talks

teaching