A storeless model of aliasing and its abstractions using finite representations of right-regular equivalence relations

Abstract

The problem of interference and aliasing in programming languages with structured, dynamically allocated data is studied. The author starts from a novel semantic model of data aliasing, then elaborates new results in formal language theory in order to represent its invariants, and finally uses these results to derive an efficient and online algorithm for statically determining dynamic aliasing properties of structured data.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>