Answers are grounded in this paper and cite their sources.
In this paper, we present a GSA-based technique that performs more efficient and more precise symbolic analysis of predicated assignments, recurrences and index arrays. The efficiency is improved by using a backward substitution scheme that performs resolution of assertions on-demand and uses heuristics to limit the number of substitution.
No takes yet. Share an insight, caveat, or question.
Tu et al. (1995) studied this question.