Copertina

On Deciding Constant Runtime of Linear Loops

Fuente: arXiv

Salvato in:

Dettagli Bibliografici
Autori principali:	Frohn, Florian, Giesl, Jürgen, Giesl, Peter, Lommen, Nils
Natura:	Preprint
Pubblicazione:	2026
Soggetti:	Logic in Computer Science
Accesso online:	Acceder al recurso
Tags:	Aggiungi Tag Nessun Tag, puoi essere il primo ad aggiungerne!!

Documenti analoghi

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

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

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

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)

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

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

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

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

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)

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)

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

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
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)

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

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

A Dependency Pair Framework for Relative Termination of 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)

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

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

Decidability in First-Order Modal Logic with Non-Rigid Constants and Definite Descriptions
di: Artale, Alessandro, et al.
Pubblicazione: (2025)

The 2-Dimensional Constraint Loop Problem is Decidable
di: Guilmant, Quentin, et al.
Pubblicazione: (2024)

Decidability of Quantum Modal Logic
di: Tokuo, Kenji
Pubblicazione: (2026)

On the Decidability of Presburger Arithmetic Expanded with Powers
di: Karimov, Toghrul, et al.
Pubblicazione: (2024)

Decidability for Sturmian words
di: Hieronymi, Philipp, et al.
Pubblicazione: (2021)

Generalized Decidability via Brouwer Trees
di: de Jong, Tom, et al.
Pubblicazione: (2026)

Dynamic Probability Logic: Decidability & Computability
di: Chopoghloo, Somayeh, et al.
Pubblicazione: (2024)

Decidability of Quasi-Dense Modal Logics
di: Ostropolski-Nalewaja, Piotr, et al.
Pubblicazione: (2024)

Deciding Equations in the Time Warp Algebra
di: van Gool, Sam, et al.
Pubblicazione: (2023)

Proceedings of the 12th Workshop on Horn Clauses for Verification and Synthesis
di: De Angelis, Emanuele, et al.
Pubblicazione: (2025)

Deciding Boolean Separation Logic via Small Models (Technical Report)
di: Dacík, Tomáš, et al.
Pubblicazione: (2024)

Measuring Decidability as Related to Busy Beaver Numbers
di: Tandi, Gurpreet, et al.
Pubblicazione: (2026)

On the Decidability of Monadic Theories of Arithmetic Predicates
di: Berthé, Valérie, et al.
Pubblicazione: (2024)

Termination of Real Linear Loops
di: Neumann, Eike, et al.
Pubblicazione: (2026)

Decidability of MSO Reparameterization over Countable Chains
di: Rabinovich, Alexander
Pubblicazione: (2026)

Craig Interpolation for Decidable First-Order Fragments
di: Cate, Balder ten, et al.
Pubblicazione: (2023)

Decidability and Complexity of Decision Problems for Affine Continuous VASS
di: Balasubramanian, A. R.
Pubblicazione: (2024)

Deciding Separation Logic with Pointer Arithmetic and Inductive Definitions
di: Su, Wanyun, et al.
Pubblicazione: (2024)