Feautrier's original system handled only affine dependences; Barthou, Collard, and Feautrier have extended it to handle nonaffine terms.
The authors of FADA observe that the same combination of parametric integer programming and rewriting rules that Feautrier uses for affine dependences can be used for nonaffine dependences if the nonaffine terms can be coded as affine constraints in the descriptions of the [MATHEMATICAL EXPRESSION NOT REPRODUCIBLE IN ASCII] sets.