Cover Image

Modular Automatic Complexity Analysis of Recursive Integer Programs

Fuente: arXiv

Saved in:

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

Similar Items

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

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

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

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

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

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

Satisfiability Modulo Exponential Integer Arithmetic
by: Frohn, Florian, 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)

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

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

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

Accelerating Loops with Arrays
by: Frohn, Florian, et al.
Published: (2026)

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

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)

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

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)

From Innermost to Full Almost-Sure 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)

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

Optimization Modulo Integer Linear-Exponential Programs
by: Hitarth, S, et al.
Published: (2025)

Integer Linear-Exponential Programming in NP by Quantifier Elimination
by: Chistikov, Dmitry, et al.
Published: (2024)

Declassification Policy for Program Complexity Analysis
by: Hainry, Emmanuel, et al.
Published: (2024)

Primitive Recursive Dependent Type Theory
by: Buchholtz, Ulrik, et al.
Published: (2024)

Resource-Aware Quantum Programming with General Recursion and Quantum Control
by: Chardonnet, Kostia, et al.
Published: (2025)

Recursive Program Synthesis from Sketches and Mixed-Quantifier Properties
by: Egolf, Derek, et al.
Published: (2026)

Solving Fuzzy Satisfiability via Mixed-Integer Non-Linear Programming
by: Castro, Pablo F.
Published: (2026)

A Program Instrumentation Framework for Automatic Verification
by: Amilon, Jesper, et al.
Published: (2024)

Induction and Recursion Principles in a Higher-Order Quantitative Logic for Probability
by: Bacci, Giorgio, et al.
Published: (2025)

Normalisation for Negative Free Logics without and with Definite Descriptions
by: Kürbis, Nils
Published: (2024)

Specification and Automatic Verification of Computational Reductions
by: Grange, Julien, et al.
Published: (2024)

Simple Classes of Automatic Structures
by: Blumensath, Achim
Published: (2025)

Products of Recursive Programs for Hypersafety Verification (Extended Version)
by: Cheng, Ruotong, et al.
Published: (2025)

Static Analysis of Recursive SHACL
by: Oudshoorn, Anouk, et al.
Published: (2026)

Strong negation in the theory of computable functionals TCF
by: Köpp, Nils, et al.
Published: (2022)

A Cut-free, Sound and Complete Russellian Theory of Definite Descriptions
by: Indrzejczak, Andrzej, et al.
Published: (2024)

Growing a Modular Framework for Modal Systems- HOLMS: a HOL Light Library
by: Bilotta, Antonella
Published: (2025)

Pathformer: Recursive Path Query Encoding for Complex Logical Query Answering
by: Zhang, Chongzhi, et al.
Published: (2024)