On the public citation graph

Termination Analysis of Integer Linear Loops

0 signed · 83 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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1007/11513988_48openalex-snapshot

Linear Ranking with Reachability

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-45657-0_36openalex-snapshot

Practical Methods for Proving Program Termination

inferredcites →https://doi.org/10.1007/3-540-49253-4_5openalex-snapshot

Visual Abstractions for Temporal Verification

inferredcites →https://doi.org/10.1007/3-540-61474-5_70openalex-snapshot

Deductive model checking

inferredcites →https://doi.org/10.1007/978-1-4419-6339-0_10openalex-snapshot

The Hardware to Software Interface

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-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.1016/s0167-6423(97)00008-7openalex-snapshot

Constraint programming over nonlinear constraints

inferredcites →https://doi.org/10.1109/lics.2004.1319598openalex-snapshot

Transition invariants

inferredcites →https://doi.org/10.1109/lics.2004.50openalex-snapshot

Transition invariants

inferredcites →https://doi.org/10.1145/125826.125848openalex-snapshot

The Omega test: a fast and practical integer programming algorithm for dependence analysis

inferredcites →https://doi.org/10.1145/135226.135233openalex-snapshot

A practical algorithm for exact array dependence analysis

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/512950.512973openalex-snapshot

Abstract interpretation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11537328_8openalex-snapshot

Counterexample-Based Refinement for a Boundedness Test for CFSM Languages

inferred← citeshttps://doi.org/10.1007/11691372_21openalex-snapshot

A Region Graph Based Approach to Termination Proofs

inferred← citeshttps://doi.org/10.1007/11817949_7openalex-snapshot

Proving Liveness by Backwards Reachability

inferred← citeshttps://doi.org/10.1007/11817963_34openalex-snapshot

Termination of Integer Linear Programs

inferred← citeshttps://doi.org/10.1007/11817963_47openalex-snapshot

Programs with Lists Are Counter Automata

inferred← citeshttps://doi.org/10.1007/11823230_25openalex-snapshot

Parametric and Termination-Sensitive Control Dependence

inferred← citeshttps://doi.org/10.1007/11921240_3openalex-snapshot

Verification Constraint Problems with Strengthening

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-75783-9_2openalex-snapshot

Sound and Complete Techniques for Reasoning About Termination

inferred← citeshttps://doi.org/10.1007/978-3-319-02444-8_26openalex-snapshot

Linear Ranking for Linear Lasso Programs

inferred← citeshttps://doi.org/10.1007/978-3-319-08867-9_52openalex-snapshot

Proving Non-termination Using Max-SMT

inferred← citeshttps://doi.org/10.1007/978-3-319-21668-3_18openalex-snapshot

Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions

inferred← citeshttps://doi.org/10.1007/978-3-642-12002-2_19openalex-snapshot

Ranking Function Synthesis for Bit-Vector Relations

inferred← citeshttps://doi.org/10.1007/978-3-642-12189-0_42openalex-snapshot

Termination of Loop Programs with Polynomial Guards

inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_19openalex-snapshot

Alternation for Termination

inferred← citeshttps://doi.org/10.1007/978-3-642-27705-4_21openalex-snapshot

Termination Analysis of Imperative Programs Using Bitvector Arithmetic

inferred← citeshttps://doi.org/10.1007/978-3-642-27940-9_6openalex-snapshot

On the Termination of Integer Loops

inferred← citeshttps://doi.org/10.1007/978-3-662-49674-9_4openalex-snapshot

Synthesizing Ranking Functions from Bits and Pieces

inferred← citeshttps://doi.org/10.1007/s00165-012-0252-5openalex-snapshot

Proving termination of nonlinear command sequences

inferred← citeshttps://doi.org/10.1007/s10703-013-0186-4openalex-snapshot

Ranking function synthesis for bit-vector relations

inferred← citeshttps://doi.org/10.1007/s11424-013-1004-1openalex-snapshot

Generating exact nonlinear ranking functions by symbolic-numeric hybrid method

inferred← citeshttps://doi.org/10.1007/s11704-009-0074-7openalex-snapshot

Recent advances in program verification through computer algebra

inferred← citeshttps://doi.org/10.1007/s11704-014-3150-6openalex-snapshot

Proving total correctness and generating preconditions for loop programs via symbolic-numeric computation methods

inferred← citeshttps://doi.org/10.1016/j.entcs.2009.05.032openalex-snapshot

Automatic Verification of Counter Systems With Ranking Function

inferred← citeshttps://doi.org/10.1016/j.jlamp.2018.02.001openalex-snapshot

Convergence: Integrating termination and abort-freedom

inferred← citeshttps://doi.org/10.1016/j.scico.2012.05.006openalex-snapshot

Invariant assertions, invariant relations, and invariant functions

inferred← citeshttps://doi.org/10.1109/iccis.2011.34openalex-snapshot

A Heuristic Approach to Verifying the Termination of Linear Programs

inferred← citeshttps://doi.org/10.1109/iccis.2012.311openalex-snapshot

Termination Analysis of Multipath Loop Programs

inferred← citeshttps://doi.org/10.1109/iccsit.2009.5234919openalex-snapshot

Automatic discovery of non-linear ranking functions of loop programs

inferred← citeshttps://doi.org/10.1109/icicta.2009.877openalex-snapshot

Termination Analysis of Linear Loop Programs

inferred← citeshttps://doi.org/10.1109/icime.2009.102openalex-snapshot

Termination of a Class of the Program with Polynomial Guards

inferred← citeshttps://doi.org/10.1109/icse.2012.6227047openalex-snapshot

Using invariant relations in the termination analysis of while loops

inferred← citeshttps://doi.org/10.1109/iscsct.2008.58openalex-snapshot

Termination of Nested Loop

inferred← citeshttps://doi.org/10.1109/itnec.2016.7560376openalex-snapshot

Eventual linear ranking functions for multi-path linear loops

inferred← citeshttps://doi.org/10.1109/lics.2011.39openalex-snapshot

Ackermannian and Primitive-Recursive Bounds with Dickson's Lemma

inferred← citeshttps://doi.org/10.1109/synasc.2010.64openalex-snapshot

A Purely Logical Approach to the Termination of Imperative Loops

inferred← citeshttps://doi.org/10.1109/tase.2016.8openalex-snapshot

The L-Depth Eventual Linear Ranking Functions for Single-Path Linear Constraint Loops

inferred← citeshttps://doi.org/10.1137/1.9781611973730.65openalex-snapshot

On Termination of Integer Linear Loops

inferred← citeshttps://doi.org/10.1145/1250734.1250771openalex-snapshot

Proving thread termination

inferred← citeshttps://doi.org/10.1145/1273442.1250771openalex-snapshot

Proving thread termination

inferred← citeshttps://doi.org/10.1145/1480881.1480898openalex-snapshot

SPEED

inferred← citeshttps://doi.org/10.1145/1594834.1480898openalex-snapshot

SPEED

inferred← citeshttps://doi.org/10.1145/1941487.1941509openalex-snapshot

Proving program termination

inferred← citeshttps://doi.org/10.1145/2400676.2400679openalex-snapshot

On the Termination of Integer Loops

inferred← citeshttps://doi.org/10.1145/2429069.2429078openalex-snapshot

On the linear ranking problem for integer linear-constraint loops

inferred← citeshttps://doi.org/10.1145/2480359.2429078openalex-snapshot

On the linear ranking problem for integer linear-constraint loops

inferred← citeshttps://doi.org/10.1145/2629488openalex-snapshot

Ranking Functions for Linear-Constraint Loops

inferred← citeshttps://doi.org/10.1145/2739480.2754752openalex-snapshot

Reducing Energy Consumption Using Genetic Improvement

inferred← citeshttps://doi.org/10.1145/2950290.2983972openalex-snapshot

Static loop analysis and its applications

inferred← citeshttps://doi.org/10.1145/3106237.3106260openalex-snapshot

Loopster: static loop termination analysis

inferred← citeshttps://doi.org/10.1145/3324884.3418929openalex-snapshot

Proving termination by k -induction

inferred← citeshttps://doi.org/10.1145/3428267openalex-snapshot

Termination analysis for evolving programs: an incremental approach by reusing certified modules

inferred← citeshttps://doi.org/10.1145/3498727openalex-snapshot

What’s decidable about linear loops?

inferred← citeshttps://doi.org/10.1145/3510003.3510220openalex-snapshot

Data-driven loop bound learning for termination analysis

inferred← citeshttps://doi.org/10.1145/3808205openalex-snapshot

Sound Termination and Non-termination Analysis of C Programs with Bit-Precise Bounded Semantics and Advanced Constructs

inferred← citeshttps://doi.org/10.1504/ijccbs.2014.059596openalex-snapshot

Verifying while loops with invariant relations

inferred← citeshttps://doi.org/10.20868/upm.thesis.14944openalex-snapshot

Termination and cost analysis: Complexity and precision issues

inferred← citeshttps://doi.org/10.29007/dq11openalex-snapshot

Generating Asymptotically Non-terminant Initial Variable Values for Linear Diagonalizable Programs.

inferred← citeshttps://doi.org/10.3929/ethz-a-006707337openalex-snapshot

Termination Analysis for Bit-Vector Programs

inferred← citeshttps://doi.org/10.4230/lipics.icalp.2019.118openalex-snapshot

Termination of Linear Loops over the Integers

inferred← citeshttps://doi.org/10.48550/arxiv.1401.5347openalex-snapshot

Linear Ranking for Linear Lasso Programs

inferred← citeshttps://doi.org/10.48550/arxiv.1407.4556openalex-snapshot

Generating Asymptotically Non-Terminating Initial Values for Linear Programs

inferred← citeshttps://doi.org/10.48550/arxiv.1409.3184openalex-snapshot

Characterization of Termination for Linear Loop Programs

inferred← citeshttps://doi.org/10.48550/arxiv.1409.4230openalex-snapshot

On the Termination of Linear and Affine Programs over the Integers

inferred← citeshttps://doi.org/10.48550/arxiv.1504.05018openalex-snapshot

Complexity of Bradley-Manna-Sipma Lexicographic Ranking Functions

inferred← citeshttps://doi.org/10.5555/2337223.2337471openalex-snapshot

Using invariant relations in the termination analysis of while loops

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.