Scholar
Jan-Christoph Kassing
Google Scholar ID: fjs2eB0AAAAJ
Research Group Computer Science 2, RWTH Aachen University
Citations & Impact
Citations
40
H-index
4
i10-index
0
Publications
14
Co-authors
2
list available
Publications
Resume (English only)
Academic Achievements
- J.-C. Kassing and J. Giesl, 'Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting', Principles of Verification: Cycling the Probabilistic Landscape, Lecture Notes in Computer Science 15260, pages 339-366, 2024.
- J.-C. Kassing, G. Vartanyan, and J. Giesl, 'A Dependency Pair Framework for Relative Termination of Term Rewriting', Proceedings of the International Joint Conference on Automated Reasoning (IJCAR '24), Nancy, France, Lecture Notes in Artificial Intelligence 14740, pages 360-380, 2024.
- J.-C. Kassing, S. Dollase, and J. Giesl, 'A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting', Proceedings of the 17th International Symposium on Functional and Logic Programming (FLOPS '24), Kumamoto, Japan, Lecture Notes in Computer Science 14659, pages 62-80, 2024.
- J.-C. Kassing, F. Frohn, and J. Giesl, 'From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting', Proceedings of the 27th International Conference on Foundations of Software Science and Computation Structures (FoSSaCS '24), Luxembourg City, Luxembourg, Lecture Notes in Computer Science 14575, pages 206-228, 2024.
- J.-C. Kassing and J. Giesl, 'Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs', Proceedings of the 29th International Conference on Automated Deduction (CADE '23), Rome, Italy, Lecture Notes in Artificial Intelligence 14132, pages 344-364, 2023.
Research Experience
- He works as a research assistant and PhD student at Lehr- und Forschungsgebiet Informatik 2, where he has been involved in several research projects.
Education
- Since October 2022, he has been a research assistant and PhD student at RWTH Aachen University.
Background
- Research interests: theoretical computer science, term rewriting, probabilistic programming, and automatic verification of (probabilistic) programs. He is one of the main developers of the Automated Program Verification Environment (AProVE) tool.
Miscellany
- Teaching activities include: lectures on logic programming, seminars on advanced programming concepts, courses on programming, and seminars on verification methods.
