On the public citation graph
Closed forms for numerical loops
0 signed · 75 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/11547662_24openalex-snapshot
Secure Information Flow as a Safety Problem
inferredcites →https://doi.org/10.1007/11817963_34openalex-snapshot
Termination of Integer Linear Programs
inferredcites →https://doi.org/10.1007/3-540-36206-1_14openalex-snapshot
How to Compose Presburger-Accelerations: Applications to Broadcast Protocols
inferredcites →https://doi.org/10.1007/978-3-319-21690-4_20openalex-snapshot
The SeaHorn Verification Framework
inferredcites →https://doi.org/10.1007/978-3-319-46520-3_30openalex-snapshot
Polynomial Invariants by Linear Algebra
inferredcites →https://doi.org/10.1007/978-3-319-73721-8_11openalex-snapshot
Invariant Generation for Multi-Path Loops with Polynomial Assignments
inferredcites →https://doi.org/10.1007/978-3-319-89963-3_30openalex-snapshot
Ultimate Automizer and the Search for Perfect Interpolants
inferredcites →https://doi.org/10.1007/978-3-319-99725-4_3openalex-snapshot
Numerical Invariants via Abstract Machines
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-78800-3_18openalex-snapshot
Reasoning Algebraically About P-Solvable Loops
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-642-02658-4_52openalex-snapshot
Apron: A Library of Numerical Abstract Domains for Static Analysis
inferredcites →https://doi.org/10.1007/978-3-642-14295-6_23openalex-snapshot
Fast Acceleration of Ultimately Periodic Relations
inferredcites →https://doi.org/10.1007/978-3-642-33512-9_3openalex-snapshot
Decision Problems for Linear Recurrence Sequences
inferredcites →https://doi.org/10.1007/978-3-662-49498-1_22openalex-snapshot
An Algorithm Inspired by Constraint Solvers to Infer Inductive Invariants in Numeric Programs
inferredcites →https://doi.org/10.1007/978-3-662-49674-9_42openalex-snapshot
PTIME Computation of Transitive Closures of Octagonal Relations
inferredcites →https://doi.org/10.1007/978-3-7091-9459-1_3openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.1007/bf01457454openalex-snapshot
Factoring polynomials with rational coefficients
inferredcites →https://doi.org/10.1007/bfb0028751openalex-snapshot
Multiple counters automata, safety analysis and presburger arithmetic
inferredcites →https://doi.org/10.1016/0304-3975(85)90049-0openalex-snapshot
Fast algorithms for the characteristics polynomial
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.1093/comjnl/36.5.450openalex-snapshot
Applying Linear Quantifier Elimination
inferredcites →https://doi.org/10.1109/fmcad.2015.7542253openalex-snapshot
Compositional recurrence analysis
inferredcites →https://doi.org/10.1109/isola.2006.46openalex-snapshot
Combining Logic and Algebraic Techniques for Program Verification in Theorema
inferredcites →https://doi.org/10.1137/1.9781611973730.65openalex-snapshot
On Termination of Integer Linear Loops
inferredcites →https://doi.org/10.1145/1005285.1005324openalex-snapshot
Automatic Generation of Polynomial Loop Invariants
inferredcites →https://doi.org/10.1145/2509136.2509511openalex-snapshot
Inductive invariant generation via abductive inference
inferredcites →https://doi.org/10.1145/2535838.2535843openalex-snapshot
Abstract acceleration of general linear loops
inferredcites →https://doi.org/10.1145/2578855.2535843openalex-snapshot
Abstract acceleration of general linear loops
inferredcites →https://doi.org/10.1145/2737924.2737955openalex-snapshot
Compositional certified resource bounds
inferredcites →https://doi.org/10.1145/2766189.2766191openalex-snapshot
On linear recurrence sequences and loop termination
inferredcites →https://doi.org/10.1145/2837614.2837659openalex-snapshot
Newtonian program analysis via tensor product
inferredcites →https://doi.org/10.1145/3062341.3062373openalex-snapshot
Compositional recurrence analysis revisited
inferredcites →https://doi.org/10.1145/3087604.3087623openalex-snapshot
Automated Generation of Non-Linear Loop Invariants Utilizing Hypergeometric Sequences
inferredcites →https://doi.org/10.1145/3158142openalex-snapshot
Non-linear reasoning for invariant synthesis
inferredcites →https://doi.org/10.1145/322261.322272openalex-snapshot
A Unified Approach to Path Problems
inferredcites →https://doi.org/10.1145/322261.322273openalex-snapshot
Fast Algorithms for Solving Path Problems
inferredcites →https://doi.org/10.1145/6490.6496openalex-snapshot
Polynomial-time algorithm for the orbit problem
inferredcites →https://doi.org/10.1525/9780520348097openalex-snapshot
A Decision Method for Elementary Algebra and Geometry
inferredcites →https://doi.org/10.4230/lipics.icalp.2017.24openalex-snapshot
The Polytope-Collision Problem
inferredcites →https://doi.org/10.5555/3929.3939openalex-snapshot
Fast algorithms for the characteristic polynomial
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-65474-0_2openalex-snapshot
Cost Analysis of Smart Contracts Via Parametric Resource Analysis
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-67067-2_2openalex-snapshot
Algebra-Based Synthesis of Loops and Their Invariants (Invited Paper)
inferred← citeshttps://doi.org/10.1007/978-3-030-81685-8_3openalex-snapshot
Algebraic Program Analysis
inferred← citeshttps://doi.org/10.1007/978-3-030-81688-9_3openalex-snapshot
Reflections on Termination of Linear Loops
inferred← citeshttps://doi.org/10.1007/978-3-030-88806-0_14openalex-snapshot
Selectively-Amortized Resource Bounding
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-13185-1_13openalex-snapshot
Affine Loop Invariant Generation via Matrix Algebra
inferred← citeshttps://doi.org/10.1007/978-3-031-43369-6_1openalex-snapshot
Targeting Completeness: Using Closed Forms for Size Bounds of Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-031-65627-9_20openalex-snapshot
On Polynomial Expressions with C-Finite Recurrences in Loops with Nested Nondeterministic Branches
inferred← citeshttps://doi.org/10.1007/978-3-032-22749-2_7openalex-snapshot
On Deciding Constant Runtime of Linear Loops
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/s00236-024-00457-9openalex-snapshot
Invariant relations for affine loops
inferred← citeshttps://doi.org/10.1007/s10703-023-00440-zopenalex-snapshot
Termination of triangular polynomial loops
inferred← citeshttps://doi.org/10.1007/s10703-024-00444-3openalex-snapshot
Porous invariants for linear systems
inferred← citeshttps://doi.org/10.1017/s1471068424000413openalex-snapshot
A Machine Learning-Based Approach for Solving Recurrence Relations and Its use in Cost Analysis of Logic Programs
inferred← citeshttps://doi.org/10.1145/3385412.3386035openalex-snapshot
Templates and recurrences: better together
inferred← citeshttps://doi.org/10.1145/3410313openalex-snapshot
Replication Package for Article: Termination Analysis without the Tears
inferred← citeshttps://doi.org/10.1145/3453483.3454110openalex-snapshot
Termination analysis without the tears
inferred← citeshttps://doi.org/10.1145/3485515openalex-snapshot
Dynaplex: analyzing program complexity using dynamically inferred recurrence relations
inferred← citeshttps://doi.org/10.1145/3563341openalex-snapshot
This is the moment for probabilistic loops
inferred← citeshttps://doi.org/10.1145/3586028openalex-snapshot
Solving Conditional Linear Recurrences for Program Verification: The Periodic Case
inferred← citeshttps://doi.org/10.1145/3597066.3597101openalex-snapshot
Termination of linear loops under commutative updates
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/3649822openalex-snapshot
Newtonian Program Analysis of Probabilistic Programs
inferred← citeshttps://doi.org/10.1145/3720492openalex-snapshot
Automatic Linear Resource Bound Analysis for Rust via Prophecy Potentials
inferred← citeshttps://doi.org/10.4204/eptcs.344.3openalex-snapshot
Regular Path Clauses and Their Application in Solving Loops
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.2108.08263openalex-snapshot
Selectively-Amortized Resource Bounding (Extended Version)
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.