On the public citation graph

Propagating differences: An efficient new fixpoint algorithm for distributive constraint systems

https://doi.org/10.1007/bfb0053565
0 signed · 60 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.1002/spe.4380230406openalex-snapshot
Generic abstract interpretation algorithms for Prolog: Two optimization techniques and their experimental evaluation
inferredcites →https://doi.org/10.1007/3-540-16442-1_25openalex-snapshot
An application of abstract interpretation of logic programs: Occur check reduction
inferredcites →https://doi.org/10.1007/3-540-52592-0_54openalex-snapshot
Symbolic finite differencing - Part I
inferredcites →https://doi.org/10.1007/3-540-55844-6_144openalex-snapshot
Generic abstract interpretation algorithms for prolog: Two optimization techniques and their experimental evaluation
inferredcites →https://doi.org/10.1007/3-540-57264-3_25openalex-snapshot
The impact of granularity in abstract interpretation of Prolog
inferredcites →https://doi.org/10.1007/3-540-59293-8_226openalex-snapshot
Precise interprocedural dataflow analysis with applications to constant propagation
inferredcites →https://doi.org/10.1007/3-540-60360-3_31openalex-snapshot
Generation of efficient interprocedural analyzers with PAG
inferredcites →https://doi.org/10.1007/3-540-60360-3_53openalex-snapshot
GENA — A tool for generating Prolog analyzers from specifications
inferredcites →https://doi.org/10.1007/3-540-61739-6_42openalex-snapshot
An even faster solver for general systems of equations
inferredcites →https://doi.org/10.1016/0743-1066(87)90004-5openalex-snapshot
A generalization of the differential approach to recursive query evaluation
inferredcites →https://doi.org/10.1016/0743-1066(92)90035-2openalex-snapshot
Compile-time derivation of variable dependency using abstract interpretation
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50016-6openalex-snapshot
Performance Evaluation of Data Intensive Logic Programs
inferredcites →https://doi.org/10.1109/lics.1997.614960openalex-snapshot
On the cubic bottleneck in subtyping and flow analysis
inferredcites →https://doi.org/10.1145/16856.16859openalex-snapshot
An amateur's introduction to recursive query processing strategies
inferredcites →https://doi.org/10.1145/16894.16859openalex-snapshot
An amateur's introduction to recursive query processing strategies
inferredcites →https://doi.org/10.1145/174625.174627openalex-snapshot
Experimental evaluation of a generic abstract interpretation algorithm for PROLOG
inferredcites →https://doi.org/10.1145/182409.182495openalex-snapshot
Set-based analysis of ML programs
inferredcites →https://doi.org/10.1145/182590.182495openalex-snapshot
Set-based analysis of ML programs
inferredcites →https://doi.org/10.1145/199448.199462openalex-snapshot
Precise interprocedural dataflow analysis via graph reachability
inferredcites →https://doi.org/10.1145/200994.201001openalex-snapshot
Closure analysis in constraint form
inferredcites →https://doi.org/10.1145/210184.210187openalex-snapshot
A type system equivalent to flow analysis
inferredcites →https://doi.org/10.1145/222124.222146openalex-snapshot
Demand interprocedural dataflow analysis
inferredcites →https://doi.org/10.1145/258993.259006openalex-snapshot
Interconvertbility of set constraints and context-free language reachability
inferredcites →https://doi.org/10.1145/258994.259006openalex-snapshot
Interconvertbility of set constraints and context-free language reachability
inferredcites →https://doi.org/10.1145/263699.263745openalex-snapshot
Infinitary control flow analysis
inferredcites →https://doi.org/10.1145/263699.263758openalex-snapshot
Constraints to stop higher-order deforestation

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11513988_46openalex-snapshot
A Policy Iteration Algorithm for Computing Fixed Points in Static Analysis of Programs
inferred← citeshttps://doi.org/10.1007/3-540-47764-0_13openalex-snapshot
Solving Regular Tree Grammar Based Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-40018-9_11openalex-snapshot
A Differential Fixpoint Evaluation Framework for Non-distributive Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-49382-2_12openalex-snapshot
Locating Matches of Tree Patterns in Forests
inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_15openalex-snapshot
Upper Adjoints for Fast Inter-procedural Variable Equalities
inferred← citeshttps://doi.org/10.1007/978-3-540-78791-4_16openalex-snapshot
Java Bytecode Verification for @NonNull Types
inferred← citeshttps://doi.org/10.1007/978-3-642-03237-0_15openalex-snapshot
The Complexity of Andersen’s Analysis in Practice
inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_20openalex-snapshot
Interprocedural Analysis with Lazy Propagation
inferred← citeshttps://doi.org/10.1007/978-3-642-15769-1_21openalex-snapshot
Verifying a Local Generic Solver in Coq
inferred← citeshttps://doi.org/10.1007/978-3-642-36946-9_8openalex-snapshot
Alias Analysis for Object-Oriented Programs
inferred← citeshttps://doi.org/10.1007/bfb0053558openalex-snapshot
Programming languages and systems : 7th European Symposium on Programming, ESOP '98, held as part of the Joint European Conferences on Theory and Practice of Software, ETAPS '98, Lisbon, Portugal, March 28-April 4, 1998 : proceedings
inferred← citeshttps://doi.org/10.1016/j.entcs.2010.09.015openalex-snapshot
Explicit Versus Symbolic Algorithms for Solving ALFP Constraints
inferred← citeshttps://doi.org/10.1016/j.scico.2005.02.009openalex-snapshot
Weighted pushdown systems and their application to interprocedural dataflow analysis
inferred← citeshttps://doi.org/10.1016/j.scico.2010.10.004openalex-snapshot
Formalisation and implementation of an algorithm for bytecode verification of @NonNull types
inferred← citeshttps://doi.org/10.1016/s0167-6423(02)00134-xopenalex-snapshot
Eliminating dead code on recursive data
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00058-8openalex-snapshot
Interprocedural analyses: a comparison
inferred← citeshttps://doi.org/10.1016/s1571-0661(04)80955-1openalex-snapshot
Time Stamps for Fixed-Point Approximation
inferred← citeshttps://doi.org/10.1023/b:sqjo.0000039791.93071.a2openalex-snapshot
Online Cycle Detection and Difference Propagation: Applications to Pointer Analysis
inferred← citeshttps://doi.org/10.1109/ase56229.2023.00118openalex-snapshot
Two Birds with One Stone: Multi-Derivation for Fast Context-Free Language Reachability Analysis
inferred← citeshttps://doi.org/10.1109/hipc.2013.6799110openalex-snapshot
Accelerating inclusion-based pointer analysis on heterogeneous CPU-GPU systems
inferred← citeshttps://doi.org/10.1109/scam.2003.1238026openalex-snapshot
Online cycle detection and difference propagation for pointer analysis
inferred← citeshttps://doi.org/10.1109/tpds.2015.2397933openalex-snapshot
An Efficient GPU Implementation of Inclusion-Based Pointer Analysis
inferred← citeshttps://doi.org/10.1109/tse.2024.3437684openalex-snapshot
Pearl: A Multi-Derivation Approach to Efficient CFL-Reachability Solving
inferred← citeshttps://doi.org/10.1145/1275497.1275504openalex-snapshot
Analysis of modular arithmetic
inferred← citeshttps://doi.org/10.1145/1290520.1290524openalex-snapshot
Efficient field-sensitive pointer analysis of C
inferred← citeshttps://doi.org/10.1145/1667048.1667050openalex-snapshot
A relational approach to interprocedural shape analysis
inferred← citeshttps://doi.org/10.1145/2049706.2049710openalex-snapshot
Fast interprocedural linear two-variable equalities
inferred← citeshttps://doi.org/10.1145/2614628.2614632openalex-snapshot
Explicit and symbolic techniques for fast and scalable points-to analysis
inferred← citeshttps://doi.org/10.1145/2955811.2955814openalex-snapshot
A Note on the Soundness of Difference Propagation
inferred← citeshttps://doi.org/10.1145/3674650openalex-snapshot
Deriving with Derivatives: Optimizing Incremental Fixpoints for Higher-Order Flow Analysis
inferred← citeshttps://doi.org/10.1145/964001.964029openalex-snapshot
Precise interprocedural analysis through linear algebra
inferred← citeshttps://doi.org/10.1145/982962.964029openalex-snapshot
Precise interprocedural analysis through linear algebra
inferred← citeshttps://doi.org/10.1145/996821.996835openalex-snapshot
Efficient field-sensitive pointer analysis for C
inferred← citeshttps://doi.org/10.13140/rg.2.1.5111.0243openalex-snapshot
On the Verification of Local Generic Solvers
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.