Proving Almost-Sure Innermost Termination of Probabilistic Term Rewriting Using Dependency Pairs
- Location
-
Deutsche Nationalbibliothek Frankfurt am Main
- Extent
-
Online-Ressource
- Language
-
Englisch
- Notes
-
In: 10.1007/978-3-031-38499-8_20
- Event
-
Veröffentlichung
- (where)
-
Aachen
- (who)
-
Universitätsbibliothek der RWTH Aachen
- (when)
-
2023
- Creator
-
Kassing, Jan-Christoph
Giesl, Jürgen
- DOI
-
10.18154/RWTH-2023-10836
- URN
-
urn:nbn:de:101:1-2407040140030.304677113981
- Rights
-
Der Zugriff auf das Objekt ist unbeschränkt möglich.
- Last update
-
14.08.2025, 10:53 AM CEST
Data provider
This object is provided by:
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Deutsche Nationalbibliothek. If you have any questions about the object, please contact the data provider.
Associated
- Kassing, Jan-Christoph
- Giesl, Jürgen
- Universitätsbibliothek der RWTH Aachen
Time of origin
- 2023
Other Objects (12)
The DP framework for proving termination of term rewriting
Termination Proofs of Rewriting Systems
Proving Termination of C Programs with Lists
On termination of single pushout graph rewriting
Proving and disproving termination in the dependency pair framework
Proving termination of probabilistic recursive programs via SMT-solving
Termination proofs and derivation lengths in term rewriting systems
Termination of cycle rewriting by transformation and matrix interpretation
Proving termination of pointer programs on top of symbolic execution
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
Almost sure versions of weak limit theorems
A Dependency Pair Framework for Relative Termination of Term Rewriting
The DP framework for proving termination of term rewriting
Termination Proofs of Rewriting Systems
Proving Termination of C Programs with Lists
On termination of single pushout graph rewriting
Proving and disproving termination in the dependency pair framework
Proving termination of probabilistic recursive programs via SMT-solving
Termination proofs and derivation lengths in term rewriting systems
Termination of cycle rewriting by transformation and matrix interpretation
Proving termination of pointer programs on top of symbolic execution
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
Almost sure versions of weak limit theorems
A Dependency Pair Framework for Relative Termination of Term Rewriting
The DP framework for proving termination of term rewriting
Termination Proofs of Rewriting Systems
Proving Termination of C Programs with Lists
On termination of single pushout graph rewriting
Proving and disproving termination in the dependency pair framework
Proving termination of probabilistic recursive programs via SMT-solving
Termination proofs and derivation lengths in term rewriting systems
Termination of cycle rewriting by transformation and matrix interpretation
Proving termination of pointer programs on top of symbolic execution
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
Almost sure versions of weak limit theorems