On the public citation graph

Iterative methods of program analysis

https://doi.org/10.1007/bf01070122
0 signed · 29 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/bf00268497openalex-snapshot
Affine relationships among variables of a program
inferredcites →https://doi.org/10.1007/bf00289078openalex-snapshot
Fast algorithms for the elimination of common subexpressions
inferredcites →https://doi.org/10.1007/bf00290339openalex-snapshot
Monotone data flow analysis frameworks
inferredcites →https://doi.org/10.1137/0204044openalex-snapshot
A Simple Algorithm for Global Data Flow Analysis Problems
inferredcites →https://doi.org/10.1137/0209015openalex-snapshot
Monoids for Rapid Data Flow Analysis
inferredcites →https://doi.org/10.1137/1.9781611971316.ch2openalex-snapshot
2. Mathematical Programming—Theory
inferredcites →https://doi.org/10.1145/322217.322228openalex-snapshot
Variations on the Common Subexpression Problem
inferredcites →https://doi.org/10.1145/390016.808436openalex-snapshot
Finding Invariant assertions for proving programs
inferredcites →https://doi.org/10.1145/512927.512945openalex-snapshot
A unified approach to global program optimization
inferredcites →https://doi.org/10.1145/800027.808436openalex-snapshot
Finding Invariant assertions for proving programs
inferredcites →https://doi.org/10.1145/800127.804083openalex-snapshot
Complexity Of Computations
inferredcites →https://doi.org/10.2307/2315157openalex-snapshot
Lectures in General 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-1-4939-0476-1_1openalex-snapshot
Theoretical and Applied Programming
inferred← citeshttps://doi.org/10.1007/bf01069778openalex-snapshot
Design of effective automaton-reduction algorithms for some equivalence relations
inferred← citeshttps://doi.org/10.1007/bf01082683openalex-snapshot
Iterative methods of program analysis: Equalities and inequalities
inferred← citeshttps://doi.org/10.1007/bf01130538openalex-snapshot
Program reduction allowing for additional specifications
inferred← citeshttps://doi.org/10.1007/bf02366358openalex-snapshot
Congruent closure algorithms for finite automata and some applications
inferred← citeshttps://doi.org/10.1007/bf02366578openalex-snapshot
Generalizations of algorithms that find invariant relationships in programs over algebra of terms
inferred← citeshttps://doi.org/10.1007/bf02667035openalex-snapshot
Intersection of term equality sets in finitely defined algebras
inferred← citeshttps://doi.org/10.1007/bf02733112openalex-snapshot
Computing congruent closures on terms
inferred← citeshttps://doi.org/10.1007/bf02733467openalex-snapshot
Heuristic search for invariants for one class of programs
inferred← citeshttps://doi.org/10.1007/s10559-010-9242-xopenalex-snapshot
Polynomial invariants for linear loops
inferred← citeshttps://doi.org/10.1007/s10559-012-9406-yopenalex-snapshot
Nonlinear invariants for linear loops and eigenpolynomials of linear operators
inferred← citeshttps://doi.org/10.1007/s10559-014-9653-1openalex-snapshot
A Method of Proving the Invariance of Linear Inequalities for Linear Loops
inferred← citeshttps://doi.org/10.1007/s10559-015-9736-7openalex-snapshot
The Structure of Polynomial Invariants of Linear Loops
inferred← citeshttps://doi.org/10.1007/s10559-016-9806-5openalex-snapshot
Analysis of Linear Definite Iterative Loops
inferred← citeshttps://doi.org/10.1109/csitechnol.2013.6710332openalex-snapshot
Invariants in symbolic modeling and verification of requirements
inferred← citeshttps://doi.org/10.29007/2nr2openalex-snapshot
Usage of Invariants for Symbolic Verification of Requirements
inferred← citeshttps://doi.org/10.55056/ceur-ws.org/vol-1356/paper_79.pdfopenalex-snapshot
The Static Analysis of Linear Loops
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.