Jan-Christoph Kassing

Orcid: 0009-0001-9972-2470

According to our database1, Jan-Christoph Kassing authored at least 17 papers between 2023 and 2026.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book  In proceedings  Article  PhD thesis  Dataset  Other 

Links

Online presence:

On csauthors.net:

Bibliography

2026
Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks.
CoRR, February, 2026

The annotated dependency pair framework for almost-sure termination of probabilistic term rewriting.
Sci. Comput. Program., 2026

2025
Report on the 10th International Conference on Formal Structures for Computation and Deduction (FSCD 2025).
ACM SIGLOG News, October, 2025

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity.
Log. Methods Comput. Sci., 2025

Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting.
Proceedings of the 27th International Symposium on Principles and Practice of Declarative Programming, 2025

Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems.
Proceedings of the 10th International Conference on Formal Structures for Computation and Deduction, 2025

2024
From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting - AProVE Artifact.
Dataset, March, 2024

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting - AProVE Artifact.
Dataset, January, 2024

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting - AProVE Artifact.
Dataset, January, 2024

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting - AProVE Artifact.
Dataset, January, 2024

A Dependency Pair Framework for Relative Termination of Term Rewriting.
Proceedings of the Automated Reasoning - 12th International Joint Conference, 2024

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting.
Proceedings of the Foundations of Software Science and Computation Structures, 2024

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting.
Proceedings of the Functional and Logic Programming - 17th International Symposium, 2024

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting.
Proceedings of the Principles of Verification: Cycling the Probabilistic Landscape, 2024

2023
Improving Dependency Tuples for Almost-Sure Innermost Termination of Probabilistic Term Rewriting.
CoRR, 2023

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

Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs.
Proceedings of the Automated Deduction - CADE 29, 2023


  Loading...