Cover Image

Accelerating Loops with Arrays

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Frohn, Florian, Giesl, Jürgen
Format:	Preprint
Published:	2026
Subjects:	Logic in Computer Science
Online Access:	Acceder al recurso
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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

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

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

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

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

Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
by: Baader, Franz, 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)

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

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

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)

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

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

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

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

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

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

Compositional Shape Analysis with Shared Abduction and Biabductive Loop Acceleration (Extended Version)
by: Sextl, Florian, et al.
Published: (2023)

Combinatory Array Logic with Sums
by: Raya, Rodrigo
Published: (2023)

Undecidability of the Emptiness Problem of Deterministic Propositional While Programs with Graph Loop: Hypothesis Elimination Using Loops
by: Nakamura, Yoshiki
Published: (2025)

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

Incorrectness Separation Logic with Arrays and Pointer Arithmetic
by: Lee, Yeonseok, et al.
Published: (2025)

Satisfiability Modulo Extensional Constant Arrays (Extended Version)
by: Preiner, Mathias, et al.
Published: (2026)

Encoding and Reasoning about Arrays in Constraint Logic Programming with Sets
by: Cristiá, Maximiliano, et al.
Published: (2025)

Higher Order Model Checking in Isabelle for Human Centric Infrastructure Security
by: Kammüller, Florian
Published: (2023)

Termination of Real Linear Loops
by: Neumann, Eike, et al.
Published: (2026)

The Equational Theory of Relational Kleene Algebra with Graph Loop is PSPACE-Complete
by: Nakamura, Yoshiki
Published: (2025)

Loop-Checking and Counter-Model Extraction for Intuitionistic Tense Logics via Nested Sequents
by: Lyon, Tim S.
Published: (2026)

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

Accelerating Protocol Synthesis and Detecting Unrealizability with Interpretation Reduction
by: Egolf, Derek, et al.
Published: (2025)

Proceedings Workshop on Logical Frameworks and Meta-Languages: Theory and Practice
by: Rabe, Florian, et al.
Published: (2024)

Modular Attractor Acceleration in Infinite-State Games (Full Version)
by: Heim, Philippe, et al.
Published: (2026)

Regular Abstractions for Array Systems
by: Hong, Chih-Duo, et al.
Published: (2024)

FORWORD: Accelerating Formal Datapath Verification via Word-Level Sweeping
by: Yang, Ziyi, et al.
Published: (2025)