Editing Data-flow analysis (section)

== Other approaches ==
Several modern compilers use [[static single-assignment form]] as the method for analysis of variable dependencies.<ref>{{cite web |title=Static Single Assignment (with relevant examples) |url=https://www.geeksforgeeks.org/static-single-assignment-with-relevant-examples/ |website=GeeksforGeeks |access-date=2023-08-16 |language=en-us |date=2 October 2021}}</ref>

In 2002, Markus Mohnen described a new method of data-flow analysis that does not require the explicit construction of a data-flow graph,<ref name="Mohnen_2002"/> instead relying on [[abstract interpretation]] of the program and keeping a working set of program counters. At each conditional branch, both targets are added to the working set. Each path is followed for as many instructions as possible (until end of program or until it has looped with no changes), and then removed from the set and the next program counter retrieved.

A combination of [[control flow analysis]] and data flow analysis has shown to be useful and complementary in identifying cohesive source code regions implementing functionalities of a system (e.g., [[Software feature|features]], [[requirement]]s or [[use case]]s).<ref name="Kuang_2015"/>