ALGORITHM FOR THE ANALYSIS OF EXACTICTY OF  BANERJEE TEST

Monica Iuliana Ciaca; Loredana Mocean; Alexandru Vancea

doi:10.24297/ijct.v10i3.3271

Authors

Monica Iuliana Ciaca BabeÅŸ-Bolyai University, str. T. Mihali no.58-60
Loredana Mocean BabeÅŸ-Bolyai University, str. T. Mihali no.58-60
Alexandru Vancea BabeÅŸ-Bolyai University, str. T. Mihali no.58-60

DOI:

https://doi.org/10.24297/ijct.v10i3.3271

Keywords:

Banerjee, data dependences, imprecise test, solvable

Abstract

In compiler theory, the Banerjee test is a dependence test. The Banerjee test assumes that all loop indices are independent, however in reality, this is often not true. The Bannerjee test is a conservative test. That is, it will not break a dependence that does not exist.

This means that the only thing the test can guarantee is the absence of dependence.

This paper proposes an innovative algorithm which allows precise determination of information about dependences and can act in situation where certain cycling limits are known.