Jan-Christoph Kassing

Jan-Christoph Kassing

(Probabilistic) Program Verification, Rewriting, Termination

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 post will show up by default. To disable scheduling of future posts, edit config.yml and set future: false.

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

talks

teaching

Formal Systems, Automata and Processes

The course provides an introduction to formal languages and systems, covering key topics such as grammars (including the Chomsky hierarchy), finite and pushdown automata, and regular expressions, enabling them to apply formal modeling techniques to areas like compiler construction and system verification. Read more..
RWTH Aachen, 2018 (Student Assistent).

Data Structures and Algorithms

The course explores foundational topics in algorithm design and data structures. It covers core structures like stacks, queues, linked lists, binary trees, and analytical tools such as the Master Theorem for solving recurrences. Read more..
RWTH Aachen, 2019 (Student Assistent).

Mathematical Logic

In this course students learn to formalize facts in appropriate logical systems and work with these formalizations, understand basic concepts and methods of mathematical logic (syntax and semantics of logical systems, inference relations, satisfiability, proof calculi, definability, etc.). Read more..
RWTH Aachen, 2021 (Student Assistent).

Complexity Theory

This lecture is an in-depth introduction of the central topics of the complexity theory. The topic of the complexity theory are the principle boundaries of efficient computability. Read more..
RWTH Aachen, 2021 (Student Assistent).

Foundations of Functional Programming (Nominated for teaching award)

The course gives an introduction to functional programming using the language Haskell. Moreover, we discuss models for the semantics and the implementation of functional languages. Read more..
RWTH Aachen, 2024.

Foundations of Logic Programming

Apart from a short introduction to the programming language Prolog this course is concerned with the basics of logic programming, programming techniques and implementations of logic programming languages. Read more..
RWTH Aachen, 2022 (Student Assistant), 2025.

Programming (Nominated for teaching award)

In this course we teach the basics of multiple different programming languages. We give a short introduction into the difference between imperative (object-oriented or procedural) and declarative (logical or functional) programming languages. Read more..
RWTH Aachen, 2018 (Student Assistent), 2019 (Student Assistent), 2022, 2023, 2024, 2025.

Verification Techniques

RWTH Aachen, 2022, 2023, 2024, 2025.

Advanced Programming Concepts

RWTH Aachen, 2023, 2024, 2025.

Satisfiability Checking

RWTH Aachen, 2025.

Using Dependency Tuples for Proving Relative Termination of Term Rewriting

by Grigory Vartanyan. RWTH Aachen, Summer, 2023.

Related Published Paper

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.

Related Published Paper

Defining H-Termination for the Analysis of Haskell Programs

by Fabian Berkner. RWTH Aachen, Winter, 2024/2025.

PReVision - A Visualization Tool for Computations of Probabilistic Term Rewriting

by David Weber. RWTH Aachen, Summer, 2025.

Refining the Dependency Framework for Basic Start Terms

by Henri Nagel. RWTH Aachen, Summer, 2025.

Counting the Probabilities of Loops: Disproving (Strong) Almost-Sure Termination of Probabilistic Rewriting Automatically

by Alexander Schlecht. RWTH Aachen, Summer, 2025.