Problem
The task is to conservatively determine whether two parametric memory accesses can overlap without enumerating large value domains.
C17 · program analysis · memory dependence
The task is to conservatively determine whether two parametric memory accesses can overlap without enumerating large value domains.
The task is to conservatively determine whether two parametric memory accesses can overlap without enumerating large value domains.
The analysis must be conservative, fast on large domains, and checkable on small domains.
Counts iteration pairs exactly for supported affine address differences; modular/GCD conditions prove selected disjointness cases, while unresolved symbolic inputs remain maybe.
Exact affine iteration-pair counting and modular/GCD disjointness proofs; yes/no cross-checked with a small-domain oracle and metamorphic tests, unresolved cases remain maybe.
Exact brute-force oracle on small domains, metamorphic generation, sanitizers, and reproducible WA/TL examples.
Analysis algorithm, exact oracle, stress infrastructure, and counterexample analysis.