Re:Ask HN: Have you ever used Dynamic programming in your de...
by tptacek on Friday October 15, 2010 @10:13PM
(#1797126)
At various times during the year, we're hip deep in graphs; much of binary software security analysis is done over the graph of edges joining basic blocks --- series of assembly instructions that end in a transfer of control.
I'll concede that the algorithms we get to use for this are pretty boring; pretty much Sedgewick's Algorithms-in-C level of sophistication.
Halvar Flake at Zynamics has a whole team doing genuinely interesting graph theoretic analysis of binaries, for instance to diff out otherwise-secret security flaws from Microsoft patches.
I'll concede that the algorithms we get to use for this are pretty boring; pretty much Sedgewick's Algorithms-in-C level of sophistication.
Halvar Flake at Zynamics has a whole team doing genuinely interesting graph theoretic analysis of binaries, for instance to diff out otherwise-secret security flaws from Microsoft patches.