:: Library Catalog

Cover Image

Saved in:

Bibliographic Details
Main Authors:	Emrich, Frank, Hensel, Jera, Giesl, Jürgen
Format:	Preprint
Published:	2023
Subjects:	Logic in Computer Science
Online Access:	https://arxiv.org/abs/2302.02382
Tags:	Add Tag No Tags, Be the first to tag this record!

Similar Items

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

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

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

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

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

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)

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

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

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

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

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

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

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

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

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

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

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

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

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

Termination Analysis of Linear-Constraint Programs
by: Ben-Amram, Amir M., et al.
Published: (2025)

Non-Termination of Logic Programs Using Patterns
by: Payet, Etienne
Published: (2025)

Terminating Hybrid Tableaus for Ordered Models
by: Nishimura, Yuki
Published: (2025)

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

Type-Based Termination for Futures
by: Somayyajula, Siva, et al.
Published: (2021)

On Modular Termination Proofs of General Logic Programs
by: Bossi, Annalisa, et al.
Published: (2000)

Efficient Ranking Function-Based Termination Analysis with Bi-Directional Feedback
by: Sarita, Yasmin, et al.
Published: (2024)

Hydra Battles and AC Termination
by: Hirokawa, Nao, et al.
Published: (2023)

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

Sound and Complete Proof Rules for Probabilistic Termination
by: Majumdar, Rupak, et al.
Published: (2024)

Deductive Verification of Weak Memory Programs with View-based Protocols (extended version)
by: Şakar, Ömer, et al.
Published: (2026)

Thread and Memory-Safe Programming with CLASS
by: Caires, Luís
Published: (2025)

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

Positive Almost-Sure Termination of Polynomial Random Walks
by: Winkler, Lorenz, et al.
Published: (2025)

Modular Reasoning about Error Bounds for Concurrent Probabilistic Programs (Extended Version)
by: Li, Kwing Hei, et al.
Published: (2025)

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

Chase Termination Beyond Polynomial Time
by: Hanisch, Philipp, et al.
Published: (2024)

Termination of Graph Transformation Systems Using Weighted Subgraph Counting
by: Overbeek, Roy, et al.
Published: (2023)