Copertina

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Kassing, Jan-Christoph, Giesl, Jürgen
Natura:	Preprint
Pubblicazione:	2024
Soggetti:	Logic in Computer Science
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

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

Termination of Triangular Polynomial Loops
di: Hark, Marcel, et al.
Pubblicazione: (2019)

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

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

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

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

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

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

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

Satisfiability Modulo Exponential Integer Arithmetic
di: Frohn, Florian, et al.
Pubblicazione: (2024)

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

Accelerating Loops with Arrays
di: Frohn, Florian, et al.
Pubblicazione: (2026)

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

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

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

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

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

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

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

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

Confluence Criteria for Logically Constrained Rewrite Systems (Full Version)
di: Schöpf, Jonas, et al.
Pubblicazione: (2023)

Recovering Commutation of Logically Constrained Rewriting and Equivalence Transformations (Full Version)
di: Takahata, Kanta, et al.
Pubblicazione: (2025)

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

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

The Computability Path Order for Beta-Eta-Normal Higher-Order Rewriting (Full Version)
di: Niederhauser, Johannes, et al.
Pubblicazione: (2025)