Def. ("deep sharing"): dshared(x,y,A,M) = (\exists v: reach(x,v,A,M) & reach(y,v,A,M) ) wlp(M := m[i<-c] , dshared(x,y,A,M)) = < def. dshared > wlp(M := m[i<-c] , (\exists v: reach(x,v,A,M) & reach(y,v,A,M) ) ) = < distr. wlp over det. and term. assgnm. > (\exists v: wlp(M := m[i<-c] , reach(x,v,A,M)) & wlp(M := m[i<-c] , reach(y,v,A,M)) ) = < wlp for reach > Case 1: i \in A --------------- (\exists v: reach(x,v,A,M) & reach(y,v,A,M) ) = < def. dshared > dshared(x,y,A,M) Case 2: i \not \in A -------------------- (\exists v: reach(x,v,Ai,M) | (reach(x,i,Ai,M) & reach(c,v,Ai,M)) & reach(y,v,Ai,M) | (reach(y,i,Ai,M) & reach(c,v,Ai,M)) ) = < pred. calc. > (\exists v: reach(x,v,Ai,M) & reach(y,v,Ai,M) ) | reach(y,i,Ai,M) & (\exists v: reach(x,v,Ai,M) & reach(c,v,Ai,M) ) | reach(x,i,Ai,M) & (\exists v: reach(y,v,Ai,M) & reach(c,v,Ai,M) ) | reach(x,i,Ai,M) & reach(y,i,Ai,M) & true = dshared(x,y,Ai,M) | reach(y,i,Ai,M) & dshared(x,c,Ai,M) | reach(x,i,Ai,M) & dshared(y,c,Ai,M) | reach(x,i,Ai,M) & reach(y,i,Ai,M)