Flow-sensitivity with respect to pointer analysis represents a technique that is typically classified infeasible due to scalability limitations. This thesis serves as an evaluation of partial flow-sensitivity, which is a scalable technique by which much of the benefit provided by flowsensitivity is offered. Two flow policies beyond the initial notion of partial flow-sensitivity are proposed and evaluated in order to provide further insight into the relationships between initial complexity, scalability, and result quality. Empirical results are gathered using counting methods that extrapolate the effects of partial flow-sensitivity as though no object replication has occurred. Finally, these results are compared across the variations of flow-sensitivity and their effects upon scalability are discussed.