MDE recursively deduplicates data representations in pointer analysis to eliminate over 90% redundant set-union operations, yielding up to 18x lower peak memory and 8x faster runtime on SPEC benchmarks with gains increasing for larger programs.
Precise interprocedural dataflow analysis with applications to constant propagation
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
cs.PL 1years
2026 1verdicts
CONDITIONAL 1representative citing papers
citing papers explorer
-
Points-to Analysis Using MDE: A Multi-level Deduplication Engine for Repetitive Data and Operations
MDE recursively deduplicates data representations in pointer analysis to eliminate over 90% redundant set-union operations, yielding up to 18x lower peak memory and 8x faster runtime on SPEC benchmarks with gains increasing for larger programs.