Cover Image

Targeting Completeness: Automated Complexity Analysis of Integer Programs

Fuente: arXiv

Saved in:

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

Similar Items

Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT
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)

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

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

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

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

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

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

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

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

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

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

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

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)

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)

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

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

Dense Integer-Complete Synthesis for Bounded Parametric Timed Automata
by: André, Étienne, et al.
Published: (2023)

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)

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

Complete Dynamic Logic of Communicating Hybrid Programs
by: Brieger, Marvin, et al.
Published: (2024)

On the Completeness of Interpolation Algorithms
by: Hetzl, Stefan, et al.
Published: (2024)

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

Completions of Kleene's second model
by: Terwijn, Sebastiaan A.
Published: (2023)

Ordered Completion for Non-Locally Tight mini-gringo Programs
by: Heuer, Jan
Published: (2025)

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

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

Completeness Theorems for k-SUM and Geometric Friends: Deciding Fragments of Integer Linear Arithmetic
by: Gokaj, Geri, et al.
Published: (2025)

Proof-Theoretic Functional Completeness for the Connexive Logic C
by: Ayhan, Sara, et al.
Published: (2025)

Some General Completeness Results for Propositionally Quantified Modal Logics
by: Ding, Yifeng, et al.
Published: (2024)

Complete representation by partial functions for signatures containing antidomain restriction
by: McLean, Brett
Published: (2023)

Integer Reasoning Modulo Different Constants in SMT
by: Pertseva, Elizaveta, et al.
Published: (2025)