Lines Matching refs:possible

44 imagine that we want to track possible values of an integer variable in our
63 We use sets of integers to represent possible values of `x`. Local variables
65 between statements with sets of possible values.
97 Let's try to find the possible sets of values of `x` in a function that modifies
118 3 possible values, we stop tracking specific values at that program point.
119 Instead, we denote possible values of `x` with the symbol `⊤` (pronounced "top"
132 The statement "at this program point, `x`'s possible values are `⊤`" is
136 Note that we can get more than 3 possible values even without a loop:
153 When `x` is declared but not initialized, it has no possible values. We
169 the concept of "bottom", and how it applies to possible value analysis. We
175 lattice that we can use in practice to track possible values of integer
184 compute the sets of possible values algorithmically.
209 We can compute sets of possible values by propagating them through the CFG of
212 *   When `x` is declared but not initialized, its possible values are `{}`. The
215 *   When `x` is assigned a concrete value, its possible set of values contains
225 The sets of possible values are influenced by:
253 possible previous program points.
377 how we had to limit the sizes of computed sets of possible values to 3 elements.