Regular data depence checking on sparse codes usually results in very conservative estimates of actual dependences that will occur at run-time. Clearly, this is caused by the usage of copact data strcutres htat arae necessary to exploit sparsity in order to reduce storage rewuirements and computational time. However, if the compiler is presented with dense code and automatically convert it intu code that operates on sparse data analysis on the original code can be used to exploit protential concurrency in the generating and manipulating techniques that are based on this concepts