Hold together local variable and stack state.
Return the bottom element.
Return the bottom element.
Compute the least upper bound of a list of elements.
Compute the least upper bound of a list of elements.
The least upper bound is set inclusion for locals, and pairwise set inclusion for stacks.
The least upper bound is set inclusion for locals, and pairwise set inclusion for stacks.
Return the top element.
Return the top element.
The lattice for reaching definitions. Elements are a triple (local variable, basic block, index of instruction of that basic block)