On the public citation graph

Ranking Functions for Linear-Constraint Loops

0 signed · 121 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/11523468_109openalex-snapshot

The Polyranking Principle

inferredcites →https://doi.org/10.1007/11539452_37openalex-snapshot

Termination Analysis of Integer Linear Loops

inferredcites →https://doi.org/10.1007/11562931_25openalex-snapshot

Testing for Termination with Monotonicity Constraints

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

Practical Methods for Proving Program Termination

inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot

Reducibility among Combinatorial Problems

inferredcites →https://doi.org/10.1007/978-3-319-02444-8_26openalex-snapshot

Linear Ranking for Linear Lasso Programs

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-25979-4_15openalex-snapshot

Automated Termination Proofs with AProVE

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-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-30579-8_8openalex-snapshot

Termination of Polynomial Programs

inferredcites →https://doi.org/10.1007/978-3-540-78163-9_6openalex-snapshot

An Improved Tight Closure Algorithm for Integer Octagonal Constraints

inferredcites →https://doi.org/10.1007/978-3-540-92188-2_5openalex-snapshot

COSTA: Design and Implementation of a Cost and Termination Analyzer for Java Bytecode

inferredcites →https://doi.org/10.1007/978-3-642-02158-9_9openalex-snapshot

Integer Polyhedra for Program Analysis

inferredcites →https://doi.org/10.1007/978-3-642-12002-2_19openalex-snapshot

Ranking Function Synthesis for Bit-Vector Relations

inferredcites →https://doi.org/10.1007/978-3-642-14295-6_9openalex-snapshot

Termination Analysis with Compositional Transition Invariants

inferredcites →https://doi.org/10.1007/978-3-642-15769-1_19openalex-snapshot

Alternation for Termination

inferredcites →https://doi.org/10.1007/978-3-642-15769-1_8openalex-snapshot

Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs

inferredcites →https://doi.org/10.1007/978-3-642-27940-9_7openalex-snapshot

Verification of Gap-Order Constraint Abstractions of Counter Systems

inferredcites →https://doi.org/10.1007/978-3-642-28756-5_18openalex-snapshot

Deciding Conditional Termination

inferredcites →https://doi.org/10.1007/978-3-642-36742-7_4openalex-snapshot

Ramsey vs. Lexicographic Termination Proving

inferredcites →https://doi.org/10.1007/978-3-642-39799-8_28openalex-snapshot

Better Termination Proving through Cooperation

inferredcites →https://doi.org/10.1007/bf01407835openalex-snapshot

Some efficient solutions to the affine scheduling problem. I. One-dimensional time

inferredcites →https://doi.org/10.1007/s10817-010-9174-1openalex-snapshot

Closed-Form Upper Bounds in Static Cost Analysis

inferredcites →https://doi.org/10.1007/s10990-006-8609-1openalex-snapshot

The octagon abstract domain

inferredcites →https://doi.org/10.1016/j.ic.2012.03.003openalex-snapshot

A new look at the automatic synthesis of linear ranking functions

inferredcites →https://doi.org/10.1016/j.scico.2007.08.001openalex-snapshot

The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems

inferredcites →https://doi.org/10.1017/s1471068407003122openalex-snapshot

Recurrence with affine level mappings is P-time decidable for CLP

inferredcites →https://doi.org/10.1080/01495730008947354openalex-snapshot

A LIBRARY FOR DOING POLYHEDRAL OPERATIONS

inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot

Lecture Notes in Computer Science 1205

inferredcites →https://doi.org/10.1109/fmcad.2013.6679413openalex-snapshot

Proving termination of imperative programs using Max-SMT

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

Transition invariants

inferredcites →https://doi.org/10.1109/memcod.2010.5558638openalex-snapshot

Understanding loops: The influence of the decomposition of Karp, Miller, and Winograd

inferredcites →https://doi.org/10.1109/sfcs.1980.29openalex-snapshot

On linear characterizations of combinatorial optimization problems

inferredcites →https://doi.org/10.1137/s009753979528977xopenalex-snapshot

Computing Two-Dimensional Integer Hulls

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

Termination proofs for systems code

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

Termination detection in logic programs using argument sizes (extended abstract)

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

Termination analysis of logic programs through combination of type-based norms

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

Size-change termination with difference constraints

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

Automatic numeric abstractions for heap-manipulating programs

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

A termination analyzer for Java bytecode based on path-length

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

On the Termination of Integer Loops

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

Eventual linear ranking functions

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

Querying constraints

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

The size-change principle for program termination

inferredcites →https://doi.org/10.1287/opre.34.2.250openalex-snapshot

A Strongly Polynomial Algorithm to Solve Combinatorial Linear Programs

inferredcites →https://doi.org/10.2168/lmcs-7(3:4)2011openalex-snapshot

Monotonicity Constraints for Termination in the Integer Domain

inferredcites →https://doi.org/10.22028/d291-25890openalex-snapshot

Temporal verification with transition invariants

inferredcites →https://doi.org/10.2307/2005950openalex-snapshot

Complexity of Computer Computations

inferredcites →https://doi.org/10.2307/253980openalex-snapshot

Theory of Linear and Integer Programming

inferredcites →https://doi.org/10.48550/arxiv.1401.5351openalex-snapshot

Ranking Function Synthesis for Linear Lasso Programs

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-030-17127-8openalex-snapshot

Foundations of Software Science and Computation Structures

inferred← citeshttps://doi.org/10.1007/978-3-030-17127-8_5openalex-snapshot

Tight Worst-Case Bounds for Polynomial Loop Programs

inferred← citeshttps://doi.org/10.1007/978-3-030-32304-2_22openalex-snapshot

Multiphase-Linear Ranking Functions and Their Relation to Recurrent Sets

inferred← citeshttps://doi.org/10.1007/978-3-030-32409-4_27openalex-snapshot

Synthesizing Nested Ranking Functions for Loop Programs via SVM

inferred← citeshttps://doi.org/10.1007/978-3-030-72016-2_14openalex-snapshot

Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes

inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_4openalex-snapshot

Decision Tree Learning in CEGIS-Based Termination Analysis

inferred← citeshttps://doi.org/10.1007/978-3-030-92124-8_22openalex-snapshot

Lightweight Nontermination Inference with CHCs

inferred← citeshttps://doi.org/10.1007/978-3-031-08166-8_10openalex-snapshot

Improving Automatic Complexity Analysis of Integer Programs

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-65627-9_21openalex-snapshot

Breaking the Mold: Nonlinear Ranking Function Synthesis Without Templates

inferred← citeshttps://doi.org/10.1007/978-3-032-32537-2_3openalex-snapshot

KoAT: Automatic Complexity and Termination Analysis of Integer Programs

inferred← citeshttps://doi.org/10.1007/978-3-319-11439-2_1openalex-snapshot

Complexity Bounds for Ordinal-Based Termination

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-319-46750-4_3openalex-snapshot

Termination of Single-Path Polynomial Loop Programs

inferred← citeshttps://doi.org/10.1007/978-3-319-63390-9_32openalex-snapshot

On Multiphase-Linear Ranking Functions

inferred← citeshttps://doi.org/10.1007/978-3-319-69483-2_8openalex-snapshot

Termination of Semi-algebraic Loop Programs

inferred← citeshttps://doi.org/10.1007/978-3-319-89963-3_16openalex-snapshot

Geometric Nontermination Arguments

inferred← citeshttps://doi.org/10.1007/978-3-642-54862-8_12openalex-snapshot

Ranking Templates for Linear Loops

inferred← citeshttps://doi.org/10.1007/978-3-662-46669-8_8openalex-snapshot

Unrestricted Termination and Non-termination Arguments for Bit-Vector Programs

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/978-3-662-53413-7_15openalex-snapshot

On the Linear Ranking Problem for Simple Floating-Point Loops

inferred← citeshttps://doi.org/10.1007/s00521-021-05763-8openalex-snapshot

Synthesis of ranking functions via DNN

inferred← citeshttps://doi.org/10.1007/s10009-019-00527-1openalex-snapshot

Detecting multiphase linear ranking functions for single-path linear-constraint loops

inferred← citeshttps://doi.org/10.1007/s10009-019-00549-9openalex-snapshot

On ranking functions for single-path linear-constraint loops

inferred← citeshttps://doi.org/10.1007/s10270-024-01161-5openalex-snapshot

A lightweight approach to nontermination inference using Constrained Horn Clauses

inferred← citeshttps://doi.org/10.1007/s10703-023-00440-zopenalex-snapshot

Termination of triangular polynomial loops

inferred← citeshttps://doi.org/10.1007/s11590-021-01729-wopenalex-snapshot

How to find the convex hull of all integer points in a polyhedron?

inferred← citeshttps://doi.org/10.1016/j.ic.2020.104634openalex-snapshot

Time-bounded termination analysis for probabilistic programs with delays

inferred← citeshttps://doi.org/10.1016/j.jnca.2015.06.019openalex-snapshot

Termination analysis with recursive calling graphs

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

TerGEC: A graph enhanced contrastive approach for program termination analysis

inferred← citeshttps://doi.org/10.1016/j.tcs.2022.07.002openalex-snapshot

Synthesizing ranking functions for loop programs via SVM

inferred← citeshttps://doi.org/10.1017/s1471068419000310openalex-snapshot

Control-Flow Refinement by Partial Evaluation, and its Application to Termination and Cost Analysis

inferred← citeshttps://doi.org/10.1109/access.2018.2890692openalex-snapshot

Ranking Function Detection via SVM: A More General Method

inferred← citeshttps://doi.org/10.1109/dsis67228.2025.11390610openalex-snapshot

Generating Linear Ranking Functions for Program Termination Using Transformers

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/memcod.2015.7340490openalex-snapshot

From non-zenoness verification to termination

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.1109/uic-atc-scalcom-cbdcom-iop.2015.101openalex-snapshot

Verification for Security-Relevant Properties and Hyperproperties

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

The Polyhedron-Hitting Problem

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

Synthesis of ranking functions using extremal counterexamples

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

On linear recurrence sequences and loop termination

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

Synthesis of ranking functions using extremal counterexamples

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

Loopster: static loop termination analysis

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

Bit-Precise Procedure-Modular Termination Analysis

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

Advanced automata-based algorithms for program termination checking

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

Advanced automata-based algorithms for program termination checking

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

SVMRanker: a general termination analysis framework of loop programs via SVM

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

Inferring Lower Runtime Bounds for Integer Programs

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

O-Minimal Invariants for Discrete-Time Dynamical Systems

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

Neural termination analysis

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

Optimal CHC Solving via Termination Proofs

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

Modular Primal-Dual Fixpoint Logic Solving for Temporal Verification

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

Termination of linear loops under commutative updates

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

Monotonicity and the Precision of Program Analysis

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

Termination and Universal Termination Problems for Nondeterministic Quantum Programs

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.2168/lmcs-11(1:16)2015openalex-snapshot

Ranking Templates for Linear Loops

inferred← citeshttps://doi.org/10.23638/lmcs-16(2:4)2020openalex-snapshot

Tight Polynomial Worst-Case Bounds for Loop Programs

inferred← citeshttps://doi.org/10.26226/morressier.604907f41a80aac83ca25cf4openalex-snapshot

Inferring Expected Runtimes of Probabilistic Integer Programs Using Expected Sizes

inferred← citeshttps://doi.org/10.3233/com-150032openalex-snapshot

Mortality of iterated piecewise affine functions over the integers: Decidability and complexity

inferred← citeshttps://doi.org/10.4204/eptcs.161.6openalex-snapshot

The Hardness of Finding Linear Ranking Functions for Lasso Programs

inferred← citeshttps://doi.org/10.4204/eptcs.344.2openalex-snapshot

Termination Analysis of Programs with Multiphase Control-Flow

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

Termination of Linear Loops over the Integers

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.