A fine-grained data-flow analysis framework (L, F) where the elements
of the semilattice L are mappings from a set of items I to a semilatti
ce of values V is introduced, and an algorithm is presented to solve t
his framework by considering the elements of I and V individually, rat
her than regarding the elements of L as atomic values. It is shown tha
t a variety of useful data-flow problems fit into the fine-grained dat
a-flow analysis framework, and can be solved in O(\I\ x \N\) time.