Copertina

A Dependency Pair Framework for Relative Termination of Term Rewriting

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Kassing, Jan-Christoph, Vartanyan, Grigory, 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

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

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

A Complete Dependency Pair Framework for Almost-Sure Innermost 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)

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

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

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

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)

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

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

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

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

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

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)

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

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)

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

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

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

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

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

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)

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

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

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

Formalizing Representation Theorems for a Logical Framework with Rewriting
di: Traversié, Thomas, et al.
Pubblicazione: (2025)

Unified Opinion Dynamic Modeling as Concurrent Set Relations in Rewriting Logic
di: Olarte, Carlos, et al.
Pubblicazione: (2024)

Drag Rewriting
di: Dershowitz, Nachum, et al.
Pubblicazione: (2024)

A Topological Rewriting of Tarski's Mereogeometry
di: Barlatier, Patrick, et al.
Pubblicazione: (2025)

Rewriting and Inductive Reasoning
di: Hajdu, Márton, et al.
Pubblicazione: (2024)

Templates in Rewriting Induction
di: Hagens, Kasper, et al.
Pubblicazione: (2026)

Higher-Order Constrained Dependency Pairs for (Universal) Computability
di: Guo, Liye, et al.
Pubblicazione: (2024)

Terminating Hybrid Tableaus for Ordered Models
di: Nishimura, Yuki
Pubblicazione: (2025)

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

Bounded Rewriting Induction for LCSTRSs
di: Hagens, Kasper, et al.
Pubblicazione: (2026)