Hey all. I thought I would share a presentation myself and a classmate, Andrew Darrow, gave recently for our CS551 class (the very class that has given me the content I’ve written about this past semester). We were assigned a research paper titled discovRE: Efficient Cross-Architecture Identification of Bugs in Binary Code. The paper itself is actually very good. I highly recommend everyone to take a look. There is definitely some math-y parts to it, but the algorithms they use aren’t necessarily complicated and definitely make sense in the context. If you’re like me, you can just skip over the specific math descriptions, as long as you get the gist.

I look forward to any discussions about this! I know not everything I said in the presentation might be 100% correct, but I feel happy with this, and definitely welcome and corrections or constructive criticisms about anything at all (including my presenting abilities).

Regards!