<?xml version="1.0" encoding="utf-8" standalone="yes"?><rss version="2.0" xmlns:atom="http://www.w3.org/2005/Atom"><channel><title>Tim Alberdingk on The Trail of Bits Blog</title><link>https://miscreants.github.io/blog.trailofbits.com/authors/tim-alberdingk/</link><description>Recent content in Tim Alberdingk on The Trail of Bits Blog</description><generator>Hugo</generator><language>en-us</language><lastBuildDate>Fri, 06 Jul 2018 07:50:11 -0400</lastBuildDate><atom:link href="https://miscreants.github.io/blog.trailofbits.com/authors/tim-alberdingk/index.xml" rel="self" type="application/rss+xml"/><item><title>Optimizing Lifted Bitcode with Dead Store Elimination</title><link>https://miscreants.github.io/blog.trailofbits.com/2018/07/06/optimizing-lifted-bitcode-with-dead-store-elimination/</link><pubDate>Fri, 06 Jul 2018 07:50:11 -0400</pubDate><guid>https://miscreants.github.io/blog.trailofbits.com/2018/07/06/optimizing-lifted-bitcode-with-dead-store-elimination/</guid><description>Tim Alberdingk Thijm As part of my Springternship at Trail of Bits, I created a series of data-flow-based optimizations that eliminate most “dead” stores that emulate writes to machine code registers in McSema-lifted programs. For example, applying my dead-store-elimination (DSE) passes to Apache httpd eliminated 117,059 stores, or 50% of the store operations to Remill’s […]</description></item></channel></rss>