Changes between Version 1 and Version 2 of AliasAnalysis

Timestamp:

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

Author:

zmanchun

Comment:

--

AliasAnalysis

@@ -33 +33 @@
 `O(q, s1)={y}`
 
-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}`.
+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}`.
+
+=== Example 2 ===
+Now let's look at a more complicated example which is obtained by modifying **Example 1**.