Maximal Fixed Point

Historically, the least solution to the data flow equations is called the MFP solution (for Maximal Fixed Point) althout it in fact computes the least fixed point; the reason is that the classical literature tends to focus on analyses where $\bigsqcup <!--\; \bigsqcup \; -->$ is $\cap <!--\; \cap \; -->$ (and because the least fixed point with respect to $⊑<!--\; ⊑\; -->$ or $\supseteq <!--\; \supseteq \; -->$ then equals the greatest fixed point with respect to $\subseteq <!--\; \subseteq \; -->$)

Nielson, Flemming, Hanne R. Nielson, and Chris Hankin. Principles of program analysis. Springer, 2015.