http://cseweb.ucsd.edu/~hovav/talks/blackhat08.html
The short story: arbitrary computation by finding 'ret's wit short sequences of useful code before them. Finding them in your code, and they need not actually be 'ret's thanks for the same reason this stuff works.
http://cseweb.ucsd.edu/~hovav/talks/blackhat08.html
The short story: arbitrary computation by finding 'ret's wit short sequences of useful code before them. Finding them in your code, and they need not actually be 'ret's thanks for the same reason this stuff works.