Traditional code optimization techniques treat loops as non-predictable structures and do not consider expressions containing
array accesses for optimization. We show that the polyhedron model can be used to implement code placement techniques that
exploit equalities of expressions that hold between loop iterations. We also present preliminary results for a simple example.