On the public citation graph

Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis

https://doi.org/10.1145/3632867
0 signed · 49 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/978-3-030-25543-5_7openalex-snapshot
Loop Summarization with Rational Vector Addition Systems
inferredcites →https://doi.org/10.1007/978-3-030-65474-0_5openalex-snapshot
Termination of Polynomial Loops
inferredcites →https://doi.org/10.1007/978-3-030-81685-8_3openalex-snapshot
Algebraic Program Analysis
inferredcites →https://doi.org/10.1007/978-3-030-81688-9_3openalex-snapshot
Reflections on Termination of Linear Loops
inferredcites →https://doi.org/10.1007/978-3-031-22308-2_3openalex-snapshot
Solving Invariant Generation for Unsolvable Loops
inferredcites →https://doi.org/10.1007/978-3-031-30820-8_29openalex-snapshot
Competition on Software Verification and Witness Validation: SV-COMP 2023
inferredcites →https://doi.org/10.1007/978-3-319-16721-3openalex-snapshot
Ideals, Varieties, and Algorithms
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-540-27836-8_85openalex-snapshot
A Note on Karr’s Algorithm
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-642-03237-0_7openalex-snapshot
Refinement of Trace Abstraction
inferredcites →https://doi.org/10.1007/978-3-642-15582-6openalex-snapshot
Mathematical software--ICMS 2010 : third International Congress on Mathematical Software, Kobe, Japan, September 13-17, 2010 : proceedings
inferredcites →https://doi.org/10.1007/978-3-642-15582-6_17openalex-snapshot
FGb: A Library for Computing Gröbner Bases
inferredcites →https://doi.org/10.1007/978-3-642-33125-1_7openalex-snapshot
Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases
inferredcites →https://doi.org/10.1016/j.ipl.2004.05.004openalex-snapshot
Computing polynomial program invariants
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/j.jsc.2008.03.002openalex-snapshot
Computing the algebraic relations of C-finite sequences and multisequences
inferredcites →https://doi.org/10.1016/j.tcs.2018.06.005openalex-snapshot
Generalized homogeneous polynomials for efficient template-based nonlinear invariant synthesis
inferredcites →https://doi.org/10.1016/s0022-4049(99)00005-5openalex-snapshot
A new efficient algorithm for computing Gröbner bases (F4)
inferredcites →https://doi.org/10.1090/surv/104openalex-snapshot
Recurrence Sequences
inferredcites →https://doi.org/10.1109/ase.2019.00121openalex-snapshot
VeriAbs : Verification by Abstraction and Test Generation
inferredcites →https://doi.org/10.1109/fmcad.2015.7542253openalex-snapshot
Compositional recurrence analysis
inferredcites →https://doi.org/10.1109/tc.2017.2690633openalex-snapshot
Arb: Efficient Arbitrary-Precision Midpoint-Radius Interval Arithmetic
inferredcites →https://doi.org/10.1126/science.86.2235.392-bopenalex-snapshot
The Summer Meeting of the American Mathematical Society
inferredcites →https://doi.org/10.1145/1005285.1005324openalex-snapshot
Automatic Generation of Polynomial Loop Invariants
inferredcites →https://doi.org/10.1145/1088216.1088219openalex-snapshot
A theoretical basis for the reduction of polynomials to canonical forms
inferredcites →https://doi.org/10.1145/3158142openalex-snapshot
Non-linear reasoning for invariant synthesis
inferredcites →https://doi.org/10.1145/3209108.3209142openalex-snapshot
Polynomial Invariants for Affine Programs
inferredcites →https://doi.org/10.1145/3290358openalex-snapshot
Refinement of path expressions for static analysis
inferredcites →https://doi.org/10.1145/3385412.3385969openalex-snapshot
Polynomial invariant generation for non-deterministic recursive programs
inferredcites →https://doi.org/10.1145/3453483.3454110openalex-snapshot
Termination analysis without the tears
inferredcites →https://doi.org/10.1145/3571237openalex-snapshot
When Less Is More: Consequence-Finding in a Weak Theory of Arithmetic
inferredcites →https://doi.org/10.1145/3586052openalex-snapshot
Algebro-geometric Algorithms for Template-Based Synthesis of Polynomial Programs
inferredcites →https://doi.org/10.1145/3614319openalex-snapshot
On Strongest Algebraic Program Invariants
inferredcites →https://doi.org/10.1145/3632867openalex-snapshot
Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis
inferredcites →https://doi.org/10.1145/964001.964028openalex-snapshot
Non-linear loop invariant generation using Gröbner bases
inferredcites →https://doi.org/10.5281/zenodo.8419344openalex-snapshot
Solvable Polynomial Ideals: The Ideal Reflection for Program Analysis Artifact

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-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-031-91121-7_1openalex-snapshot
Efficient Synthesis of Tight Polynomial Upper-Bounds for Systems of Conditional Polynomial Recurrences
inferred← citeshttps://doi.org/10.1016/j.jsc.2025.102551openalex-snapshot
Algebraic and algorithmic methods for computing polynomial loop invariants
inferred← citeshttps://doi.org/10.1145/3666000.3669710openalex-snapshot
Algebraic Tools for Computing Polynomial Loop Invariants
inferred← citeshttps://doi.org/10.1145/3704862openalex-snapshot
Simple Linear Loops: Algebraic Invariants and Applications
inferred← citeshttps://doi.org/10.1145/3704873openalex-snapshot
Linear and Non-linear Relational Analyses for Quantum Program Optimization
inferred← citeshttps://doi.org/10.1145/3708559openalex-snapshot
Synthesizing Invariants for Polynomial Programs by Semidefinite Programming
inferred← citeshttps://doi.org/10.1145/3763142openalex-snapshot
Software Model Checking via Summary-Guided Search
inferred← citeshttps://doi.org/10.1145/3776698openalex-snapshot
Determination Problems for Orbit Closures and Matrix Groups
inferred← citeshttps://doi.org/10.1145/3808307openalex-snapshot
A Categorical Basis for Robust Program Analysis
showing the first 10 of 11 · page through all 11
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.