Imagen de Portada

Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks

Fuente: arXiv

Guardado en:

Detalles Bibliográficos
Autores principales:	Kassing, Jan-Christoph, Nagel, Henri, Schlecht, Alexander, Giesl, Jürgen
Formato:	Preprint
Publicado:	2026
Materias:	Logic in Computer Science
Acceso en línea:	Acceder al recurso
Etiquetas:	Agregar Etiqueta Sin Etiquetas, Sea el primero en etiquetar este registro!

Ejemplares similares

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

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

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

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

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
por: Kassing, Jan-Christoph, et al.
Publicado: (2023)

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

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

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

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

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

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

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

Termination of Triangular Polynomial Loops
por: Hark, Marcel, et al.
Publicado: (2019)

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

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

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

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

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

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

Accelerating Loops with Arrays
por: Frohn, Florian, et al.
Publicado: (2026)

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

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

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

Satisfiability Modulo Exponential Integer Arithmetic
por: Frohn, Florian, et al.
Publicado: (2024)

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem
por: Barile, Adriano, et al.
Publicado: (2024)

Drag Rewriting
por: Dershowitz, Nachum, et al.
Publicado: (2024)