Signed-off-by: Sven Verdoolaege <skimo@kotnet.org>
Compute a parametric representation for all positive powers I<k> of C<map>.
The power I<k> is equated to the parameter at position C<param>.
Compute a parametric representation for all positive powers I<k> of C<map>.
The power I<k> is equated to the parameter at position C<param>.
-The result may be an overapproximation. If the result is exact,
+The result may be an overapproximation. If the result is known to be exact,
then C<*exact> is set to C<1>.
then C<*exact> is set to C<1>.
-The current implementation only produces exact results for particular
-cases of piecewise translations (i.e., piecewise uniform dependences).
=item * Transitive closure
=item * Transitive closure
Compute the transitive closure of C<map>.
The result may be an overapproximation. If the result is known to be exact,
then C<*exact> is set to C<1>.
Compute the transitive closure of C<map>.
The result may be an overapproximation. If the result is known to be exact,
then C<*exact> is set to C<1>.
-The current implementation only produces exact results for particular
-cases of piecewise translations (i.e., piecewise uniform dependences).
=item * Reaching path lengths
=item * Reaching path lengths