On the public citation graph
Proving Non-Termination via Loop Acceleration
0 signed · 58 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/11823230_10openalex-snapshot
Combining Widening and Acceleration in Linear Relation Analysis
inferredcites →https://doi.org/10.1007/978-3-030-17502-3_10openalex-snapshot
The Termination and Complexity Competition
inferredcites →https://doi.org/10.1007/978-3-030-17502-3_9openalex-snapshot
Automatic Verification of C and Java Programs: SV-COMP 2019
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-08587-6_28openalex-snapshot
StarExec: A Cross-Community Infrastructure for Logic Solving
inferredcites →https://doi.org/10.1007/978-3-319-08867-9_52openalex-snapshot
Proving Non-termination Using Max-SMT
inferredcites →https://doi.org/10.1007/978-3-319-40229-1_37openalex-snapshot
Lower Runtime Bounds for Integer Programs
inferredcites →https://doi.org/10.1007/978-3-319-48989-6_16openalex-snapshot
Upper and Lower Amortized Cost Bounds of Programs Expressed as Cost Relations
inferredcites →https://doi.org/10.1007/978-3-319-89963-3_16openalex-snapshot
Geometric Nontermination Arguments
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-70545-1_27openalex-snapshot
The Barcelogic SMT Solver
inferredcites →https://doi.org/10.1007/978-3-540-78800-3_24openalex-snapshot
Z3: An Efficient SMT Solver
inferredcites →https://doi.org/10.1007/978-3-540-79124-9_11openalex-snapshot
Non-termination Checking for Imperative Programs
inferredcites →https://doi.org/10.1007/978-3-642-31762-0_9openalex-snapshot
Automated Detection of Non-termination and NullPointerExceptions for Java Bytecode
inferredcites →https://doi.org/10.1007/978-3-642-54862-8_11openalex-snapshot
Proving Nontermination via Safety
inferredcites →https://doi.org/10.1007/978-3-662-48899-7_38openalex-snapshot
Constrained Term Rewriting tooL
inferredcites →https://doi.org/10.1007/978-3-662-49674-9_22openalex-snapshot
T2: Temporal Property Verification
inferredcites →https://doi.org/10.1007/978-3-662-49674-9_4openalex-snapshot
Synthesizing Ranking Functions from Bits and Pieces
inferredcites →https://doi.org/10.1007/978-3-662-54577-5_6openalex-snapshot
Proving Termination Through Conditional Termination
inferredcites →https://doi.org/10.1007/s10703-015-0228-1openalex-snapshot
Under-approximating loops in C programs for fast counterexample detection
inferredcites →https://doi.org/10.1007/s10817-016-9388-yopenalex-snapshot
Analyzing Program Termination and Complexity Automatically with AProVE
inferredcites →https://doi.org/10.1109/fmcad.2013.6679413openalex-snapshot
Proving termination of imperative programs using Max-SMT
inferredcites →https://doi.org/10.1109/fmcad.2014.6987597openalex-snapshot
Disproving termination with overapproximation
inferredcites →https://doi.org/10.1109/fmcad.2015.7542250openalex-snapshot
Compositional safety verification with Max-SMT
inferredcites →https://doi.org/10.1109/fmcad.2015.7542253openalex-snapshot
Compositional recurrence analysis
inferredcites →https://doi.org/10.1109/fmcad.2015.7542259openalex-snapshot
Accelerating invariant generation
inferredcites →https://doi.org/10.1145/1542476.1542518openalex-snapshot
Control-flow refinement and progress invariants for bound analysis
inferredcites →https://doi.org/10.1145/2535838.2535843openalex-snapshot
Abstract acceleration of general linear loops
inferredcites →https://doi.org/10.1145/2737924.2737993openalex-snapshot
Termination and non-termination specification inference
inferredcites →https://doi.org/10.1145/2866575openalex-snapshot
Analyzing Runtime and Size Complexity of Integer Programs
inferredcites →https://doi.org/10.1145/3192366.3192405openalex-snapshot
Advanced automata-based algorithms for program termination checking
inferredcites →https://doi.org/10.1201/9780429246593openalex-snapshot
An Introduction to the Bootstrap
inferredcites →https://doi.org/10.48550/arxiv.cs/0512056openalex-snapshot
PURRS: Towards Computer Algebra Support for Fully Automatic Worst-Case Complexity Analysis
inferredcites →https://doi.org/10.5555/2682923.2682941openalex-snapshot
Disproving termination with overapproximation
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-45190-5_4openalex-snapshot
A Calculus for Modular Loop Acceleration
inferred← citeshttps://doi.org/10.1007/978-3-030-65474-0_5openalex-snapshot
Termination of Polynomial Loops
inferred← citeshttps://doi.org/10.1007/978-3-030-99527-0_21openalex-snapshot
AProVE: Non-Termination Witnesses for C Programs
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-10769-6_41openalex-snapshot
Proving Non-Termination and Lower Runtime Bounds with LoAT (System Description)
inferred← citeshttps://doi.org/10.1007/978-3-031-10769-6_43openalex-snapshot
Automatic Complexity Analysis of Integer Programs via Triangular Weakly Non-Linear Loops
inferred← citeshttps://doi.org/10.1007/978-3-031-37706-8_6openalex-snapshot
Commutativity for Concurrent Program Termination Proofs
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_13openalex-snapshot
Proving Non-Termination by Acceleration Driven Clause Learning (Short Paper)
inferred← citeshttps://doi.org/10.1007/978-3-031-38499-8_16openalex-snapshot
Proving Termination of C Programs with Lists
inferred← citeshttps://doi.org/10.1007/978-3-031-44245-2_13openalex-snapshot
ADCL: Acceleration Driven Clause Learning for Constrained Horn Clauses
inferred← citeshttps://doi.org/10.1007/978-3-031-63498-7_21openalex-snapshot
Satisfiability Modulo Exponential Integer Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-031-71162-6_29openalex-snapshot
Reachability Analysis for Multiloop Programs Using Transition Power Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-032-22752-2_21openalex-snapshot
Modular Attractor Acceleration in Infinite-State Games
inferred← citeshttps://doi.org/10.1007/s10009-022-00670-2openalex-snapshot
A calculus for modular loop acceleration and non-termination proofs
inferred← citeshttps://doi.org/10.1109/ase56229.2023.00061openalex-snapshot
EndWatch: A Practical Method for Detecting Non-Termination in Real-World Software
inferred← citeshttps://doi.org/10.1109/ase63991.2025.00164openalex-snapshot
Non-termination Witnesses and Their Validation
inferred← citeshttps://doi.org/10.1145/3410331openalex-snapshot
Inferring Lower Runtime Bounds for Integer Programs
inferred← citeshttps://doi.org/10.1145/3428257openalex-snapshot
DynamiTe: dynamic termination and non-termination proofs
inferred← citeshttps://doi.org/10.1145/3453483.3454093openalex-snapshot
Proving non-termination by program reversal
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.