Version alpha
lecture: A Code Pirate's Cutlass
Recovering Software Architecture from Embedded Binaries
![Event large](/2018/montreal/schedule/assets/event_large-4b8aa978adbb7c8e80151f5a83c6782a12e763374ae3a042a55e7e626a64d93b.png)
Large binaries produce giant call graphs and dividing up functionality in an automated way is difficult. This talk introduces the CodeCut problem: given the call graph of a large binary, segment the graph to recover the original object file boundaries. It also introduces local function affinity (LFA), a measurement representing the directionality of a function's relationship to nearby functions. It applies LFA to solve the CodeCut problem. It shows some useful applications, including automated module-to-module call graphs (extracting software architecture), and automated section naming based on common strings. Finally we'll discuss success metrics for CodeCut solutions.
Info
Day:
2018-06-17
Start time:
11:00
Duration:
00:30
Room:
Grand salon
Track:
Software Reverse Engineering
Links:
Files
Concurrent Events
Speakers
![]() |
evm |