On the public citation graph
Abstract Domains of Affine Relations
0 signed · 70 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/11513988_44openalex-snapshot
Extended Weighted Pushdown Systems
inferredcites →https://doi.org/10.1007/11547662_17openalex-snapshot
A Generic Framework for Interprocedural Analysis of Numerical Properties
inferredcites →https://doi.org/10.1007/11817963_32openalex-snapshot
Improving Pushdown System Model Checking
inferredcites →https://doi.org/10.1007/3-540-16446-4_9openalex-snapshot
A relational framework for abstract interpretation
inferredcites →https://doi.org/10.1007/3-540-55984-1_13openalex-snapshot
The interprocedural coincidence theorem
inferredcites →https://doi.org/10.1007/978-3-540-24622-0_21openalex-snapshot
Symbolic Implementation of the Best Transformer
inferredcites →https://doi.org/10.1007/978-3-540-31987-0_5openalex-snapshot
Analysis of Modular Arithmetic
inferredcites →https://doi.org/10.1007/978-3-540-70545-1_26openalex-snapshot
Inferring Congruence Equations Using SAT
inferredcites →https://doi.org/10.1007/978-3-540-71410-1_16openalex-snapshot
Grids: A Domain for Analyzing the Distribution of Numerical Values
inferredcites →https://doi.org/10.1007/978-3-540-78791-4_3openalex-snapshot
A System for Generating Static Analyzers for Machine Instructions
inferredcites →https://doi.org/10.1007/978-3-642-11319-2_16openalex-snapshot
Automatic Abstraction for Congruences
inferredcites →https://doi.org/10.1007/978-3-642-31424-7_17openalex-snapshot
A Method for Symbolic Computation of Abstract Operations
inferredcites →https://doi.org/10.1007/978-3-642-33125-1_10openalex-snapshot
Bilateral Algorithms for Symbolic Abstraction
inferredcites →https://doi.org/10.1007/bf00268497openalex-snapshot
Affine relationships among variables of a program
inferredcites →https://doi.org/10.1016/0304-3975(89)90091-1openalex-snapshot
Two-level semantics and abstract interpretation
inferredcites →https://doi.org/10.1016/0304-3975(96)00072-2openalex-snapshot
Precise interprocedural dataflow analysis with applications to constant propagation
inferredcites →https://doi.org/10.1016/j.scico.2005.02.009openalex-snapshot
Weighted pushdown systems and their application to interprocedural dataflow analysis
inferredcites →https://doi.org/10.1016/j.scico.2007.08.001openalex-snapshot
The Parma Polyhedra Library: Toward a complete set of numerical abstractions for the analysis and verification of hardware and software systems
inferredcites →https://doi.org/10.1080/00207168908803778openalex-snapshot
Static analysis of arithmetical congruences
inferredcites →https://doi.org/10.1093/comjnl/12.1.41openalex-snapshot
Proving Properties of Programs by Structural Induction
inferredcites →https://doi.org/10.1109/ipps.1994.288298openalex-snapshot
Estimation of nested loops execution time by integer arithmetic in convex polyhedra
inferredcites →https://doi.org/10.1137/0220067openalex-snapshot
Asymptotically Fast Triangularization of Matrices over Rings
inferredcites →https://doi.org/10.1145/1040305.1040332openalex-snapshot
Precise interprocedural analysis using random interpretation
inferredcites →https://doi.org/10.1145/1275497.1275504openalex-snapshot
Analysis of modular arithmetic
inferredcites →https://doi.org/10.1145/178243.178254openalex-snapshot
Counting solutions to Presburger formulas
inferredcites →https://doi.org/10.1145/237578.237617openalex-snapshot
Counting solutions to linear and nonlinear constraints through Ehrhart polynomials
inferredcites →https://doi.org/10.1145/2591635.2667172openalex-snapshot
Counting solutions to linear and nonlinear constraints through Ehrhart polynomials
inferredcites →https://doi.org/10.1145/512644.512672openalex-snapshot
Data flow analysis of applicative programs using minimal function graphs
inferredcites →https://doi.org/10.1145/512760.512770openalex-snapshot
Automatic discovery of linear restraints among variables of a program
inferredcites →https://doi.org/10.1145/567752.567778openalex-snapshot
Systematic design of program analysis frameworks
inferredcites →https://doi.org/10.1145/604131.604137openalex-snapshot
A generic approach to the static analysis of concurrent programs with procedures
inferredcites →https://doi.org/10.1145/604131.604138openalex-snapshot
Discovering affine equalities using random interpretation
inferredcites →https://doi.org/10.1145/964001.964029openalex-snapshot
Precise interprocedural analysis through linear algebra
inferredcites →https://doi.org/10.3929/ethz-a-004141007openalex-snapshot
Algorithms for matrix canonical forms
inferredcites →https://doi.org/10.5860/choice.38-5065openalex-snapshot
Matrix analysis and applied 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-030-45190-5_5openalex-snapshot
Mind the Gap: Bit-vector Interpolation recast over Linear Integer Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-031-44245-2_22openalex-snapshot
Polynomial Analysis of Modular Arithmetic
inferred← citeshttps://doi.org/10.1007/978-3-032-07106-4_7openalex-snapshot
Comparing the Precision of Abstract Operators in the eBPF Verifier Using Differential Synthesis
inferred← citeshttps://doi.org/10.1007/978-3-319-52234-0_27openalex-snapshot
Sound Bit-Precise Numerical Domains
inferred← citeshttps://doi.org/10.1007/978-3-319-66706-5_17openalex-snapshot
A New Abstraction Framework for Affine Transformers
inferred← citeshttps://doi.org/10.1007/978-3-642-23702-7_17openalex-snapshot
Abstract Domains of Affine Relations
inferred← citeshttps://doi.org/10.1007/978-3-642-31424-7_17openalex-snapshot
A Method for Symbolic Computation of Abstract Operations
inferred← citeshttps://doi.org/10.1007/978-3-642-33125-1_10openalex-snapshot
Bilateral Algorithms for Symbolic Abstraction
inferred← citeshttps://doi.org/10.1007/978-3-662-44202-9_4openalex-snapshot
Finding Reference-Counting Errors in Python/C Programs with Affine Analysis
inferred← citeshttps://doi.org/10.1007/978-3-662-49122-5_1openalex-snapshot
Automating Abstract Interpretation
inferred← citeshttps://doi.org/10.1007/s10703-018-0325-zopenalex-snapshot
A new abstraction framework for affine transformers
inferred← citeshttps://doi.org/10.1007/s10703-024-00456-zopenalex-snapshot
An input–output relational domain for algebraic data types and functional arrays
inferred← citeshttps://doi.org/10.1016/j.entcs.2015.02.003openalex-snapshot
PostHat and All That: Automating Abstract Interpretation
inferred← citeshttps://doi.org/10.1016/j.jsc.2024.102314openalex-snapshot
Solving polynomial systems over non-fields and applications to modular polynomial factoring
inferred← citeshttps://doi.org/10.1016/j.scico.2022.102906openalex-snapshot
Static analysis of linear absolute value equalities among variables of a program
inferred← citeshttps://doi.org/10.1109/tase52547.2021.00020openalex-snapshot
An Abstract Domain to Infer Linear Absolute Value Equalities
inferred← citeshttps://doi.org/10.1145/3024084openalex-snapshot
Newtonian Program Analysis via Tensor Product
inferred← citeshttps://doi.org/10.1145/3037697.3037754openalex-snapshot
Sound Loop Superoptimization for Google Native Client
inferred← citeshttps://doi.org/10.1145/3093315.3037754openalex-snapshot
Sound Loop Superoptimization for Google Native Client
inferred← citeshttps://doi.org/10.1145/3093336.3037754openalex-snapshot
Sound Loop Superoptimization for Google Native Client
inferred← citeshttps://doi.org/10.1145/3093337.3037754openalex-snapshot
Sound Loop Superoptimization for Google Native Client
inferred← citeshttps://doi.org/10.1145/3156017openalex-snapshot
Verifying Reliability Properties Using the Hyperball Abstract Domain
inferred← citeshttps://doi.org/10.1145/3290358openalex-snapshot
Refinement of path expressions for static analysis
inferred← citeshttps://doi.org/10.1145/3650212.3680301openalex-snapshot
Scalable, Sound, and Accurate Jump Table Analysis
inferred← citeshttps://doi.org/10.1145/3704873openalex-snapshot
Linear and Non-linear Relational Analyses for Quantum Program Optimization
inferred← citeshttps://doi.org/10.1145/3733716openalex-snapshot
Automated Abstract Transformer Synthesis for Reduced Product Domains
inferred← citeshttps://doi.org/10.1145/3776722openalex-snapshot
Nice to Meet You: Synthesizing Practical MLIR Abstract Transformers
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.