Cover Image

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Kassing, Jan-Christoph, Dollase, Stefan, Giesl, Jürgen
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2025)

The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
by: Kassing, Jan-Christoph, et al.
Published: (2024)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2023)

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
by: Kassing, Jan-Christoph, et al.
Published: (2026)

A Dependency Pair Framework for Relative Termination of Term Rewriting
by: Kassing, Jan-Christoph, et al.
Published: (2024)

Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
by: Baader, Franz, et al.
Published: (2024)

Weighted Rewriting: Semiring Semantics for Abstract Reduction Systems
by: Ahrens, Emma, et al.
Published: (2025)

Termination of Innermost-Terminating Right-Linear Overlay Term Rewrite Systems (Full Version)
by: Nishida, Naoki
Published: (2026)

Almost-Sure Termination by Guarded Refinement
by: Gregersen, Simon Oddershede, et al.
Published: (2024)

Deciding Termination of Simple Randomized Loops
by: Meyer, Éléanore, et al.
Published: (2025)

Positive Almost-Sure Termination of Polynomial Random Walks
by: Winkler, Lorenz, et al.
Published: (2025)

Termination of Triangular Polynomial Loops
by: Hark, Marcel, et al.
Published: (2019)

Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
by: Lommen, Nils, et al.
Published: (2023)

AProVE: Modular Termination Analysis of Memory-Manipulating C Programs
by: Emrich, Frank, et al.
Published: (2023)

Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT
by: Lommen, Nils, et al.
Published: (2024)

Targeting Completeness: Automated Complexity Analysis of Integer Programs
by: Lommen, Nils, et al.
Published: (2024)

Algorithm and Strategy Construction for Sure-Almost-Sure Stochastic Parity Games
by: Doyen, Laurent, et al.
Published: (2026)

Robust Almost-Sure Reachability in Multi-Environment MDPs
by: van der Vegt, Marck, et al.
Published: (2023)

On Deciding Constant Runtime of Linear Loops
by: Frohn, Florian, et al.
Published: (2026)

Compositional Verification of Almost-Sure Büchi Objectives in MDPs
by: van der Vegt, Marck, et al.
Published: (2025)

Sound and Complete Proof Rules for Probabilistic Termination
by: Majumdar, Rupak, et al.
Published: (2024)

Modular Automatic Complexity Analysis of Recursive Integer Programs
by: Lommen, Nils, et al.
Published: (2025)

Integrating Loop Acceleration into Bounded Model Checking
by: Frohn, Florian, et al.
Published: (2024)

Satisfiability Modulo Exponential Integer Arithmetic
by: Frohn, Florian, et al.
Published: (2024)

Accelerating Loops with Arrays
by: Frohn, Florian, et al.
Published: (2026)

Infinite State Model Checking by Learning Transitive Relations
by: Frohn, Florian, et al.
Published: (2025)

A PSPACE Algorithm for Almost-Sure Rabin Objectives in Multi-Environment MDPs
by: Suilen, Marnix, et al.
Published: (2024)

Optimally Rewriting Formulas and Database Queries: A Confluence of Term Rewriting, Structural Decomposition, and Complexity
by: Chen, Hubie, et al.
Published: (2024)

Almost Surely Asymptotically Constant Graph Neural Networks
by: Adam-Day, Sam, et al.
Published: (2024)

Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
by: Lommen, Nils, et al.
Published: (2022)

Complete and Terminating Tableau Calculus for Undirected Graph
by: Nishimura, Yuki, et al.
Published: (2024)

On the Completeness of Interpolation Algorithms
by: Hetzl, Stefan, et al.
Published: (2024)

Strategy Templates for Almost-Sure and Positive Winning of Stochastic Parity Games towards Permissive and Resilient Control
by: Phalakarn, Kittiphon, et al.
Published: (2024)

Equational Theories and Validity for Logically Constrained Term Rewriting (Full Version)
by: Aoto, Takahito, et al.
Published: (2024)

Partial Rewriting and Value Interpretation of Logically Constrained Terms (Full Version)
by: Aoto, Takahito, et al.
Published: (2026)

Difference of Constrained Patterns in Logically Constrained Term Rewrite Systems (Full Version)
by: Nishida, Naoki, et al.
Published: (2025)

On Complexity Bounds and Confluence of Parallel Term Rewriting
by: Baudon, Thaïs, et al.
Published: (2023)

Tree Rewriting Calculi for Strictly Positive Logics
by: Santiago-Fernández, Sofía, et al.
Published: (2025)