On the public citation graph

Interprocedurally Analyzing Polynomial Identities

https://doi.org/10.1007/11672142_3
0 signed · 36 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/11547662_17openalex-snapshot
A Generic Framework for Interprocedural Analysis of Numerical Properties
inferredcites →https://doi.org/10.1007/3-540-45789-5_4openalex-snapshot
Polynomial Constants Are Decidable
inferredcites →https://doi.org/10.1007/3-540-61474-5_80openalex-snapshot
Powerful techniques for the automatic generation of invariants
inferredcites →https://doi.org/10.1007/978-1-4612-0913-3openalex-snapshot
Gröbner Bases: A Computational Approach to Commutative Algebra
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-27864-1_21openalex-snapshot
An Abstract Interpretation Approach for Automatic Generation of Polynomial Invariants
inferredcites →https://doi.org/10.1007/978-3-540-27864-1_22openalex-snapshot
Approximating the Algebraic Relational Semantics of Imperative 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-31987-0_5openalex-snapshot
Analysis of Modular Arithmetic
inferredcites →https://doi.org/10.1007/bf00268497openalex-snapshot
Affine relationships among variables of a program
inferredcites →https://doi.org/10.1016/j.ipl.2004.05.004openalex-snapshot
Computing polynomial program invariants
inferredcites →https://doi.org/10.1016/s0304-3975(96)00191-0openalex-snapshot
Automatic generation of invariants and intermediate assertions
inferredcites →https://doi.org/10.1145/1005285.1005324openalex-snapshot
Automatic Generation of Polynomial Loop Invariants
inferredcites →https://doi.org/10.1145/1040305.1040332openalex-snapshot
Precise interprocedural analysis using random interpretation
inferredcites →https://doi.org/10.1145/321921.321938openalex-snapshot
Global Data Flow Analysis and Iterative Algorithms
inferredcites →https://doi.org/10.1145/512950.512961openalex-snapshot
Symbolic evaluation and the global value graph
inferredcites →https://doi.org/10.1145/604131.604138openalex-snapshot
Discovering affine equalities using random interpretation
inferredcites →https://doi.org/10.1145/964001.964028openalex-snapshot
Non-linear loop invariant generation using Gröbner bases
inferredcites →https://doi.org/10.1145/964001.964029openalex-snapshot
Precise interprocedural analysis through linear algebra
inferredcites →https://doi.org/10.1145/982962.964028openalex-snapshot
Non-linear loop invariant generation using Gröbner bases
inferredcites →https://doi.org/10.1145/982962.964029openalex-snapshot
Precise interprocedural analysis through linear algebra

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-540-69166-2_20openalex-snapshot
Analysing All Polynomial Equations in ${\mathbb Z_{2^w}}$
inferred← citeshttps://doi.org/10.1007/978-3-540-71316-6_18openalex-snapshot
Computing Procedure Summaries for Interprocedural Analysis
inferred← citeshttps://doi.org/10.1007/978-3-540-78800-3_18openalex-snapshot
Reasoning Algebraically About P-Solvable Loops
inferred← citeshttps://doi.org/10.1007/978-3-642-03237-0_22openalex-snapshot
Invariant Checking for Programs with Procedure Calls
inferred← citeshttps://doi.org/10.1007/978-3-642-17511-4_7openalex-snapshot
ABC: Algebraic Bound Computation for Loops
inferred← citeshttps://doi.org/10.1007/978-3-642-33125-1_7openalex-snapshot
Inference of Polynomial Invariants for Imperative Programs: A Farewell to Gröbner Bases
inferred← citeshttps://doi.org/10.1007/978-3-642-34281-3_31openalex-snapshot
A Practical Loop Invariant Generation Approach Based on Random Testing, Constraint Solving and Verification
inferred← citeshttps://doi.org/10.1007/978-3-642-37651-1_8openalex-snapshot
Elimination Techniques for Program Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-41202-8_8openalex-snapshot
Assisting Specification Refinement by Random Testing
inferred← citeshttps://doi.org/10.1007/978-3-662-46669-8_19openalex-snapshot
Inter-procedural Two-Variable Herbrand Equalities
inferred← citeshttps://doi.org/10.1016/j.jlap.2010.07.005openalex-snapshot
Relational bytecode correlations
inferred← citeshttps://doi.org/10.1016/j.scico.2014.02.028openalex-snapshot
Inference of polynomial invariants for imperative programs: A farewell to Gröbner bases
inferred← citeshttps://doi.org/10.1109/isola.2006.46openalex-snapshot
Combining Logic and Algebraic Techniques for Program Verification in Theorema
inferred← citeshttps://doi.org/10.23638/lmcs-13(2:5)2017openalex-snapshot
Inter-procedural Two-Variable Herbrand Equalities
inferred← citeshttps://doi.org/10.2991/isaeece-16.2016.31openalex-snapshot
A Way of Validating Polynomial Program with Semi-algebraic System
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.