Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
Date:
Conference Talk at 29th International Conference on Automated Deduction (CADE 2023), Rome, Italy
Jan-Christoph Kassing
(Probabilistic) Program Verification, Rewriting, Termination
- Kassing(at)cs.rwth-aachen.de
- RWTH Aachen University
- Aachen, Germany
- Room 4209, Ahornstr. 55
- Google Scholar
- ORCID
- ResearchGate
- Github