On the public citation graph
What’s decidable about linear loops?
0 signed · 80 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/11539452_37openalex-snapshot
Termination Analysis of Integer Linear Loops
inferredcites →https://doi.org/10.1007/11817963_34openalex-snapshot
Termination of Integer Linear Programs
inferredcites →https://doi.org/10.1007/3-540-45319-9_6openalex-snapshot
Synthesis of Linear Ranking Functions
inferredcites →https://doi.org/10.1007/3-540-63166-6_10openalex-snapshot
Construction of abstract state graphs with PVS
inferredcites →https://doi.org/10.1007/978-3-030-32304-2_22openalex-snapshot
Multiphase-Linear Ranking Functions and Their Relation to Recurrent Sets
inferredcites →https://doi.org/10.1007/978-3-319-10575-8_15openalex-snapshot
Predicate Abstraction for Program Verification
inferredcites →https://doi.org/10.1007/978-3-319-63390-9_32openalex-snapshot
On Multiphase-Linear Ranking Functions
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_20openalex-snapshot
A Complete Method for the Synthesis of Linear Ranking Functions
inferredcites →https://doi.org/10.1007/978-3-540-27813-9_6openalex-snapshot
Termination of Linear Programs
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_21openalex-snapshot
An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants
inferredcites →https://doi.org/10.1007/978-3-540-30579-8_1openalex-snapshot
Proving Program Invariance and Termination by Parametric Abstraction, Lagrangian Relaxation and Semidefinite Programming
inferredcites →https://doi.org/10.1007/978-3-540-45069-6_39openalex-snapshot
Linear Invariant Generation Using Non-linear Constraint Solving
inferredcites →https://doi.org/10.1007/978-3-642-20712-9_24openalex-snapshot
Orbits of Linear Maps and Regular Languages
inferredcites →https://doi.org/10.1007/978-3-662-43951-7_27openalex-snapshot
On the Positivity Problem for Simple Linear Recurrence Sequences,
inferredcites →https://doi.org/10.1007/978-3-662-43951-7_28openalex-snapshot
Ultimate Positivity is Decidable for Simple Linear Recurrence Sequences
inferredcites →https://doi.org/10.1007/bfb0015749openalex-snapshot
A simple proof of the Skolem-Mahler-Lech theorem
inferredcites →https://doi.org/10.1007/s00224-019-09913-3openalex-snapshot
Complete Semialgebraic Invariant Synthesis for the Kannan-Lipton Orbit Problem
inferredcites →https://doi.org/10.1007/s10009-013-0288-8openalex-snapshot
Termination proofs for linear simple loops
inferredcites →https://doi.org/10.1016/j.dam.2005.10.009openalex-snapshot
Positivity of second order linear recurrent sequences
inferredcites →https://doi.org/10.1016/j.dam.2009.06.021openalex-snapshot
Positivity of third order linear recurrence sequences
inferredcites →https://doi.org/10.1016/j.jlap.2008.08.004openalex-snapshot
A brief account of runtime verification
inferredcites →https://doi.org/10.1016/j.jsc.2007.01.002openalex-snapshot
Generating all polynomial invariants in simple loops
inferredcites →https://doi.org/10.1016/s0304-3975(02)00847-2openalex-snapshot
Almost periodic sequences
inferredcites →https://doi.org/10.1016/s0304-3975(03)00314-1openalex-snapshot
On iterating linear transformations over recognizable sets of integers
inferredcites →https://doi.org/10.1017/cbo9780511897184.016openalex-snapshot
Linear relations on algebraic groups
inferredcites →https://doi.org/10.1070/im1984v022n03abeh001456openalex-snapshot
LOGICAL THEORIES OF ONE-PLACE FUNCTIONS ON THE SET OF NATURAL NUMBERS
inferredcites →https://doi.org/10.1109/tac.1973.1100194openalex-snapshot
Lectures on linear sequential machines
inferredcites →https://doi.org/10.1137/1.9781611973402.27openalex-snapshot
Positivity Problems for Low-Order Linear Recurrence Sequences
inferredcites →https://doi.org/10.1137/1.9781611973730.64openalex-snapshot
The Polyhedron-Hitting Problem
inferredcites →https://doi.org/10.1137/s0097539794276853openalex-snapshot
The Complexity of the A B C Problem
inferredcites →https://doi.org/10.1145/1133981.1134029openalex-snapshot
Termination proofs for systems code
inferredcites →https://doi.org/10.1145/2429069.2429078openalex-snapshot
On the linear ranking problem for integer linear-constraint loops
inferredcites →https://doi.org/10.1145/2488608.2488728openalex-snapshot
The orbit problem in higher dimensions
inferredcites →https://doi.org/10.1145/2535838.2535843openalex-snapshot
Abstract acceleration of general linear loops
inferredcites →https://doi.org/10.1145/2629417openalex-snapshot
Approximate Verification of the Symbolic Dynamics of Markov Chains
inferredcites →https://doi.org/10.1145/2629488openalex-snapshot
Ranking Functions for Linear-Constraint Loops
inferredcites →https://doi.org/10.1145/2766189.2766191openalex-snapshot
On linear recurrence sequences and loop termination
inferredcites →https://doi.org/10.1145/2857050openalex-snapshot
On the Complexity of the Orbit Problem
inferredcites →https://doi.org/10.1145/3049797.3049798openalex-snapshot
On the Polytope Escape Problem for Continuous Linear Dynamical Systems
inferredcites →https://doi.org/10.1145/3158142openalex-snapshot
Non-linear reasoning for invariant synthesis
inferredcites →https://doi.org/10.1145/3434329openalex-snapshot
Deciding ω-regular properties on linear recurrence sequences
inferredcites →https://doi.org/10.1145/3501299openalex-snapshot
O-Minimal Invariants for Discrete-Time Dynamical Systems
inferredcites →https://doi.org/10.1145/512760.512770openalex-snapshot
Automatic discovery of linear restraints among variables of a program
inferredcites →https://doi.org/10.1145/6490.6496openalex-snapshot
Polynomial-time algorithm for the orbit problem
inferredcites →https://doi.org/10.1515/crll.1984.349.63openalex-snapshot
The distance between terms of an algebraic recurrence sequence.
inferredcites →https://doi.org/10.4230/lipics.concur.2021.28openalex-snapshot
The Orbit Problem for Parametric Linear Dynamical Systems
inferredcites →https://doi.org/10.4230/lipics.icalp.2017.24openalex-snapshot
The Polytope-Collision Problem
inferredcites →https://doi.org/10.4230/lipics.icalp.2019.118openalex-snapshot
Termination of Linear Loops over the Integers
inferredcites →https://doi.org/10.4230/lipics.mfcs.2020.54openalex-snapshot
On LTL Model Checking for Low-Dimensional Discrete Linear Dynamical Systems
inferredcites →https://doi.org/10.4230/lipics.stacs.2019.6openalex-snapshot
The Semialgebraic Orbit Problem
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_39openalex-snapshot
On Eventual Non-negativity and Positivity for the Weighted Sum of Powers of Matrices
inferred← citeshttps://doi.org/10.1007/978-3-031-13185-1_13openalex-snapshot
Affine Loop Invariant Generation via Matrix Algebra
inferred← citeshttps://doi.org/10.1007/978-3-031-15839-1_1openalex-snapshot
Algebraic Model Checking for Discrete Linear Dynamical Systems
inferred← citeshttps://doi.org/10.1007/978-3-031-22337-2_2openalex-snapshot
What’s Decidable About Discrete Linear Dynamical Systems?
inferred← citeshttps://doi.org/10.1007/978-3-031-28083-2_11openalex-snapshot
What Else is Undecidable About Loops?
inferred← citeshttps://doi.org/10.1007/978-3-031-30823-9_3openalex-snapshot
Model Checking Linear Dynamical Systems under Floating-point Rounding
inferred← citeshttps://doi.org/10.1007/978-3-031-75775-4_13openalex-snapshot
Model Checking Markov Chains as Distribution Transformers
inferred← citeshttps://doi.org/10.1007/s10703-024-00444-3openalex-snapshot
Porous invariants for linear systems
inferred← citeshttps://doi.org/10.1016/j.ic.2024.105197openalex-snapshot
Quantum temporal logic and reachability problems of matrix semigroups
inferred← citeshttps://doi.org/10.1016/j.ipl.2024.106481openalex-snapshot
Skolem and positivity completeness of ergodic Markov chains
inferred← citeshttps://doi.org/10.1016/j.nahs.2026.101680openalex-snapshot
Linear dynamical systems with weight functions
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114637openalex-snapshot
On simulating Turing machines with matrix semigroups with integrality tests
inferred← citeshttps://doi.org/10.1016/j.tcs.2024.114959openalex-snapshot
The monadic theory of toric words
inferred← citeshttps://doi.org/10.1109/lics56636.2023.10175758openalex-snapshot
The Power of Positivity
inferred← citeshttps://doi.org/10.1142/s0218271826500513openalex-snapshot
Decidability, observational bridges and finite-information quantum gravity
inferred← citeshttps://doi.org/10.1145/3531130.3533328openalex-snapshot
On the Skolem Problem and the Skolem Conjecture
inferred← citeshttps://doi.org/10.1145/3632872openalex-snapshot
Strong Invariants Are Hard: On the Hardness of Strongest Polynomial Invariants for (Probabilistic) Programs
inferred← citeshttps://doi.org/10.1145/3661814.3662119openalex-snapshot
On the Decidability of Monadic Second-Order Logic with Arithmetic Predicates
inferred← citeshttps://doi.org/10.29007/sj4lopenalex-snapshot
Automatic Bit- and Memory-Precise Verification of eBPF Code
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.