search for: 7_22

...and is more > complicated > Note that we don't do full-on polynomial time equivalence finding. > While it would be fun to play with such algorithms, they are often > not practical. > The one i saw some hope for was > http://link.springer.com/chapter/10.1007%2F978-3-540-76637-7_22 > I haven't had a chance to play with it. If I recall correctly, AWZ will get this too (https://courses.cs.washington.edu/courses/cse501/04wi/papers/alpern-popl88.pdf). AWZ is a Hopcroft-partitioning-based algorithm, and Hopcroft partitioning is O(n*log(n)). -Hal > __________________...

...ugh. I thought that might be the case. A lot of the examples in the papers seem a bit contrived anyway, so it would be interesting to know just how many "real" opportunities are being missed. > The one i saw some hope for was http://link.springer.com/chapter/10.1007%2F978-3-540-76637-7_22 > I haven't had a chance to play with it. This looks very promising, thank you. On Wed, 4 May 2016 at 11:01 Daniel Berlin <dberlin at dberlin.org> wrote: > >> If I recall correctly, AWZ will get this too ( >> https://courses.cs.washington.edu/courses/cse501/04wi/pap...

Hello, I was hoping to get some clarification on the aim of the GVN pass. I have been reading a bit about global value numbering, and from what I understand, there are polynomial time algorithms for removing duplicate computations from loops[1]. I have an example program[2] which computes the sum of an array twice, in two separate accumulators. Here, sum0 and sum1 are both sums of the array A.