Cover Image

Infinite State Model Checking by Learning Transitive Relations

Fuente: arXiv

Saved in:

Bibliographic Details
Main Authors:	Frohn, Florian, 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

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)

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)

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

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

CTL* Model Checking on Infinite Families of Finite-State Labeled Transition Systems (Technical Report)
by: Pettinau, Roberto, et al.
Published: (2026)

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

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

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

Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
by: Lommen, Nils, 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)

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)

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)

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 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)

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

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)

Efficient Probabilistic Model Checking for Relational Reachability (Extended Version)
by: Gerlach, Lina, et al.
Published: (2025)

Infinite trees
by: Goy, Alexandre
Published: (2025)

Synthesis of Infinite State Systems
by: Drucker, Ohad, et al.
Published: (2025)

Complexity of the Model Checking problem for inquisitive propositional and modal logic
by: Grilletti, Gianluca, et al.
Published: (2024)

Parameterized Infinite-State Reactive Synthesis
by: Maderbacher, Benedikt, et al.
Published: (2025)

Towards Learning Infinite SMT Models (Work in Progress)
by: Janota, Mikoláš, et al.
Published: (2025)

Explanations for Unrealizability of Infinite-State Safety Shields
by: Rodriguez, Andoni, et al.
Published: (2025)

Distributional Probabilistic Model Checking
by: Elsayed-Aly, Ingy, et al.
Published: (2023)

Computing with Infinite Objects: the Gray Code Case
by: Spreen, Dieter, et al.
Published: (2021)

Probabilistic Model Checking: Applications and Trends
by: Kwiatkowska, Marta, et al.
Published: (2025)

Localized Attractor Computations for Infinite-State Games (Full Version)
by: Schmuck, Anne-Kathrin, et al.
Published: (2024)

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

Three Fundamental Questions in Modern Infinite-Domain Constraint Satisfaction
by: Pinsker, Michael, et al.
Published: (2025)

Model Checking Markov Chains as Distribution Transformers
by: Aghamov, Rajab, et al.
Published: (2024)

Hybrid Spatiotemporal Logic for Automotive Applications: Modeling and Model-Checking
by: Tulcan, Radu-Florin, et al.
Published: (2026)