Reflections on termination of linear loops

DOI10.1007/978-3-030-81688-9_3zbMath1493.68126arXiv2105.13941OpenAlexW3185819676MaRDI QIDQ832249

Zachary Kincaid, Shaowei Zhu

Publication date: 25 March 2022

Full work available at URL: https://arxiv.org/abs/2105.13941

zbMATH Keywords

linear dynamical systemsterminationreflective subcategorybest abstractionconditional terminationmonotone analysis

Mathematics Subject Classification ID

Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Related Items (1)

Algebraic program analysis

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Fast algorithms for the characteristic polynomial
• Factoring polynomials with rational coefficients
• Conflict-driven conditional termination
• On multiphase-linear ranking functions
• A lattice-theoretical fixpoint theorem and its applications
• An abstract interpretation framework for termination
• Proving Termination Through Conditional Termination
• Proving Conditional Termination
• Ranking Templates for Linear Loops
• Tools and Algorithms for the Construction and Analysis of Systems
• Computer Aided Verification
• On Termination of Integer Linear Loops
• An Abstract Domain to Infer Ordinal-Valued Ranking Functions
• Computer Aided Verification
• Termination of Integer Linear Programs
• Verification, Model Checking, and Abstract Interpretation
• Numerical invariants via abstract machines
• Loop summarization with rational vector addition systems
• Termination of triangular Integer loops is decidable

This page was built for publication: Reflections on termination of linear loops