Changes between Version 2 and Version 3 of AliasAnalysis

Timestamp:

04/22/16 12:23:23 (10 years ago)

Author:

zmanchun

Comment:

--

AliasAnalysis

@@ -35 +35 @@
 Suppose the current state is `S=(p0: s0, p1:s1)`, i.e., the enable statement of `p0` and `p1` is `s0` and `s1`, respectively. Since we know **statically** that `O(p, s0)` never intersect with `O(q, s1)`, then we know that `s0` and `s1` commute. So the ample set at `S` is either `{p0}` or `{p1}`.
 
+In fact, the ample set of any reachable state of this program is always `{p0}` and `{p1}`.
+
+
 === Example 2 ===
 Now let's look at a more complicated example which is obtained by modifying **Example 1**.