Automated Loop Detection and Iteration Count Analysis in Binary Code
This paper presents an automated, scalable method that combines interprocedural static analysis with control-flow and data-dependency tracking to accurately detect natural loops and determine their iteration counts in optimized binary code, achieving high precision and scalability on real-world software and benchmark suites.