Lines Matching defs:Check
256 changes, we therefore need to check whether the new term can attain
301 Recent versions of {\tt PipLib} also check for such duplicates.
371 \subsubsection{Feasibility Check and Detection of Equalities}
376 In {\tt isl}, we therefore first perform a feasibility check on
379 In fact, we do not simply check the feasibility, but we also
380 check for implicit equalities among the integer points by computing
580 If all the evaluations are non-negative, we only need to check for the
1368 To check whether the results are exact, we need to consider two
1379 Since $T$ is known to be an overapproximation, we only need to check
1391 Note that $T$ may be exact even if $K$ is not exact, so the check
1393 To check exactness of the power, we simply need to check
1395 to be an overapproximation, we only need to check whether
1408 All that remains is to explain how to check the cyclicity of $R$.
1470 The exactness check is performed on each component separately.
1472 then the entire result is marked inexact and the exactness check
1484 result turns out not to be exact, then we check whether
1488 be fairly expensive, so we may want to make this check
1843 and $\range R_i$. We therefore need to check that domain
2036 we check the following conditions, as proposed by