Dataflow analyses are built upon some interpretation of the bitvectors attached to each basic block, represented via a zero-sized structure.
A less precise version of
A dataflow analysis that tracks whether a pointer or reference could possibly exist that points to a given local.
Dataflow analysis that determines whether each local requires storage at a given location; i.e. whether its storage can go away without being observed.