One of the main difficulties with modular analysis is the issue of aliasing. Several systems have been proposed that allow modular analysis by restricting the programs to have heaps that are a tree or “almost tree”. We propose a system that allows analysing programs with DAGS and possibly general graphs by forcing the exposure of sharing rather than restricting it altogether. We allow indirect modification of subcomponents of an aggregate component at the price of more verbose specification.