1. ESP: path-sensitive program verification in polynomial time;Das,2002
2. Folklore confirmed: reducible flow graphs are exponentially larger;Carter,2003
3. Detecting large number of infeasible paths through recognizing their patterns;Ngo,2007
4. Static race detection for device drivers: the Goblint approach;Vojdani,2016
5. A. Navabi, N. Kidd, S. Jagannathan, Path-Sensitive Analysis Using Edge Strings, Purdue University Technical Report 10-006.