C17 · program analysis · memory dependence

PS-form Memory Dependence Analyzer

The task is to conservatively determine whether two parametric memory accesses can overlap without enumerating large value domains.

01

Problem

The task is to conservatively determine whether two parametric memory accesses can overlap without enumerating large value domains.

02

Constraints

The analysis must be conservative, fast on large domains, and checkable on small domains.

03

Solution

Counts iteration pairs exactly for supported affine address differences; modular/GCD conditions prove selected disjointness cases, while unresolved symbolic inputs remain maybe.

04

Outcome

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.

05

Verification

Exact brute-force oracle on small domains, metamorphic generation, sanitizers, and reproducible WA/TL examples.

06

My ownership

Analysis algorithm, exact oracle, stress infrastructure, and counterexample analysis.