From: pertti.kellomaki@tut.fi   
      
   I am trying to wrap my head around the Banerjee inequality (a basis   
   for a particular form of dependence testing in loops).  While I   
   understand the gross outline, I am trying to work out the details to   
   convince myself. However, the proofs in Allen and Kennedy's Optimizing   
   Compilers for Modern Architectures are given in such high level that I   
   am having a hard time filling in some of the gaps.   
      
   Does anyone know of sources where the proofs would be spelled   
   out in more detail?   
   --   
   Pertti   
      
   --- SoupGate-Win32 v1.05   
    * Origin: you cannot sedate... all the things you hate (1:229/2)