Module 17: Loops
  Lecture 34: Symbolic Analysis
 


GCD Test

  • There is an integer solution to the dependence eqn. when divides c
  • If not, then there are no integer solutions regardless of the bounds.
  • Applies to Single Dependence eqn.
  • Inexpensive test; finding gcd is very efficient

Extreme Value Test

  • Find the extreme values of the expression in dependence eqn.

    The region of is bounded by loop limits and other constraints
  • Method finds lower and upper bounds of the function
  • Value of c must lie between lower and upper bounds
  • Efficient but inexact test
  • Does not enforce restriction to integer soln.

Example

If M>0 then
For I=1 to 10 do

Endfor
Endif

Therefore,

The constraints are:

 
 
 

Modify