Cover Image

Control-Flow Refinement for Complexity Analysis of Probabilistic Programs in KoAT

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

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

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)

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

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)

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

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

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

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)

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)

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)

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)

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

Automated Verification of Higher-Order Probabilistic Programs via a Dependent Refinement Type System
by: Kura, Satoshi, et al.
Published: (2024)

To Zip Through the Cost Analysis of Probabilistic Programs
by: Hetzenberger, Matthias, et al.
Published: (2025)

Contextual Refinement of Higher-Order 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)

Compositional Interface Refinement Through Subtyping in Probabilistic Session Types
by: Blechschmidt, Paula
Published: (2025)

Programming and Reasoning in Partially Observable Probabilistic Environments
by: Gürtler, Tobias, et al.
Published: (2025)

A Deductive Refinement Calculus for Differential-Algebraic Programs
by: Hellwig, Jonathan, et al.
Published: (2026)

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

A Typed Lambda-Calculus for Establishing Trust in Probabilistic Programs
by: Genco, Francesco A., et al.
Published: (2023)

noDice: Inference for Discrete Probabilistic Programs with Nondeterminism and Conditioning
by: Gürtler, Tobias, et al.
Published: (2026)

A Dual-Threshold Probabilistic Knowing Value Logic
by: Wang, Shanxia
Published: (2026)

Probabilistic Linear Logic Programming with an Application to Bayesian Network Computations (Extended Version)
by: Acclavio, Matteo, et al.
Published: (2026)

Tropical Mathematics and the Lambda-Calculus II: Tropical Geometry of Probabilistic Programming Languages
by: Barbarossa, Davide, et al.
Published: (2025)

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

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

Denotational Semantics for Probabilistic and Concurrent Programs
by: Zilberstein, Noam, et al.
Published: (2025)

Fast Inference for Probabilistic Answer Set Programs via the Residual Program
by: Azzolini, Damiano, et al.
Published: (2024)

Integrating Belief Domains into Probabilistic Logic Programs
by: Azzolini, Damiano, et al.
Published: (2025)