Image de couverture de livre

Efficient Ranking Function-Based Termination Analysis with Bi-Directional Feedback

Fuente: arXiv

Enregistré dans:

Détails bibliographiques
Auteurs principaux:	Sarita, Yasmin, Singh, Avaljot, Gomber, Shaurya, Singh, Gagandeep, Vishwanathan, Mahesh
Format:	Preprint
Publié:	2024
Sujets:	Logic in Computer Science
Accès en ligne:	Acceder al recurso
Tags:	Ajouter un tag Pas de tags, Soyez le premier à ajouter un tag!

Documents similaires

ConstraintFlow: A DSL for Specification and Verification of Neural Network Analyses
par: Singh, Avaljot, et autres
Publié: (2024)

Evolving Abstract Transformers for Gradient-Guided, Adaptable Abstract Interpretation
par: Gomber, Shaurya, et autres
Publié: (2025)

Terminating Hybrid Tableaus for Ordered Models
par: Nishimura, Yuki
Publié: (2025)

Automated Verification of Soundness of DNN Certifiers
par: Singh, Avaljot, et autres
Publié: (2025)

Complete and Terminating Tableau Calculus for Undirected Graph
par: Nishimura, Yuki, et autres
Publié: (2024)

AProVE: Modular Termination Analysis of Memory-Manipulating C Programs
par: Emrich, Frank, et autres
Publié: (2023)

Type-Based Termination for Futures
par: Somayyajula, Siva, et autres
Publié: (2021)

Hydra Battles and AC Termination
par: Hirokawa, Nao, et autres
Publié: (2023)

Termination of Triangular Polynomial Loops
par: Hark, Marcel, et autres
Publié: (2019)

Termination Analysis of Linear-Constraint Programs
par: Ben-Amram, Amir M., et autres
Publié: (2025)

Deciding Termination of Simple Randomized Loops
par: Meyer, Éléanore, et autres
Publié: (2025)

A Formal Model to Prove Instantiation Termination for E-matching-Based Axiomatisations (Extended Version)
par: Ge, Rui, et autres
Publié: (2024)

Sound and Complete Proof Rules for Probabilistic Termination
par: Majumdar, Rupak, et autres
Publié: (2024)

Non-Termination of Logic Programs Using Patterns
par: Payet, Etienne
Publié: (2025)

Taking Bi-Intuitionistic Logic First-Order: A Proof-Theoretic Investigation via Polytree Sequents
par: Lyon, Tim S., et autres
Publié: (2024)

Positive Almost-Sure Termination of Polynomial Random Walks
par: Winkler, Lorenz, et autres
Publié: (2025)

Termination of Real Linear Loops
par: Neumann, Eike, et autres
Publié: (2026)

A Dependency Pair Framework for Relative Termination of Term Rewriting
par: Kassing, Jan-Christoph, et autres
Publié: (2024)

Termination of Graph Transformation Systems Using Weighted Subgraph Counting
par: Overbeek, Roy, et autres
Publié: (2023)

Chase Termination Beyond Polynomial Time
par: Hanisch, Philipp, et autres
Publié: (2024)

Small Term Reachability and Related Problems for Terminating Term Rewriting Systems
par: Baader, Franz, et autres
Publié: (2024)

From Innermost to Full Almost-Sure Termination of Probabilistic Term Rewriting
par: Kassing, Jan-Christoph, et autres
Publié: (2023)

Termination of Graph Transformation Systems via Generalized Weighted Type Graphs
par: Endrullis, Jörg, et autres
Publié: (2023)

Domain theory in univalent foundations I: Directed complete posets and Scott's $D_\infty$
par: de Jong, Tom
Publié: (2024)

Rank-decreasing transductions
par: Bojańczyk, Mikołaj, et autres
Publié: (2024)

Annotated Dependency Pairs for Full Almost-Sure Termination of Probabilistic Term Rewriting
par: Kassing, Jan-Christoph, et autres
Publié: (2024)

The Annotated Dependency Pair Framework for Almost-Sure Termination of Probabilistic Term Rewriting
par: Kassing, Jan-Christoph, et autres
Publié: (2024)

Proof-Theoretic Functional Completeness for the Connexive Logic C
par: Ayhan, Sara, et autres
Publié: (2025)

From Innermost to Full Probabilistic Term Rewriting: Almost-Sure Termination, Complexity, and Modularity
par: Kassing, Jan-Christoph, et autres
Publié: (2024)

Disproving (Positive) Almost-Sure Termination of Probabilistic Term Rewriting via Random Walks
par: Kassing, Jan-Christoph, et autres
Publié: (2026)

Why not? Developing ABox Abduction beyond Repairs
par: Haak, Anselm, et autres
Publié: (2025)

About the Multi-Head Linear Restricted Chase Termination
par: Gerlach, Lukas, et autres
Publié: (2025)

Breaking the Mold: Nonlinear Ranking Function Synthesis Without Templates
par: Zhu, Shaowei, et autres
Publié: (2024)

A Complete Dependency Pair Framework for Almost-Sure Innermost Termination of Probabilistic Term Rewriting
par: Kassing, Jan-Christoph, et autres
Publié: (2023)

An Optimal 14-Symbol Hybrid Basis for BCH-Algebras
par: Ramani, Mahesh, et autres
Publié: (2026)

Dependency Pairs for Expected Innermost Runtime Complexity and Strong Almost-Sure Termination of Probabilistic Term Rewriting
par: Kassing, Jan-Christoph, et autres
Publié: (2025)

Restricted Chase Termination: You Want More than Fairness
par: Carral, David, et autres
Publié: (2025)

Alignment Monitoring
par: Henzinger, Thomas A., et autres
Publié: (2025)

A Dichotomy Theorem for Ordinal Ranks in MSO
par: Niwiński, Damian, et autres
Publié: (2025)

Almost-Sure Termination by Guarded Refinement
par: Gregersen, Simon Oddershede, et autres
Publié: (2024)