@@ -130,7 +130,7 @@ module RangeAnalysis {
130130 }
131131
132132 /**
133- * Holds if `r` can be modelled as `r = root * sign + bias`.
133+ * Holds if `r` can be modeled as `r = root * sign + bias`.
134134 *
135135 * Only looks "one step", that is, does not follow data flow and does not recursively
136136 * unfold nested arithmetic expressions.
@@ -203,7 +203,7 @@ module RangeAnalysis {
203203 }
204204
205205 /**
206- * Holds if `r` can be modelled as `r = root * sign + bias`.
206+ * Holds if `r` can be modeled as `r = root * sign + bias`.
207207 */
208208 predicate linearDefinition ( DataFlow:: Node r , DataFlow:: Node root , int sign , Bias bias ) {
209209 if exists ( r .getImmediatePredecessor ( ) )
@@ -229,7 +229,7 @@ module RangeAnalysis {
229229 }
230230
231231 /**
232- * Holds if `r` can be modelled as `r = xroot * xsign + yroot * ysign + bias`.
232+ * Holds if `r` can be modeled as `r = xroot * xsign + yroot * ysign + bias`.
233233 */
234234 predicate linearDefinitionSum (
235235 DataFlow:: Node r , DataFlow:: Node xroot , int xsign , DataFlow:: Node yroot , int ysign , Bias bias
@@ -260,7 +260,7 @@ module RangeAnalysis {
260260 }
261261
262262 /**
263- * Holds if the given comparison can be modelled as `A <op> B + bias` where `<op>` is the comparison operator,
263+ * Holds if the given comparison can be modeled as `A <op> B + bias` where `<op>` is the comparison operator,
264264 * and `A` is `a * asign` and likewise `B` is `b * bsign`.
265265 */
266266 predicate linearComparison (
0 commit comments