For the analysis of these so-called control flow graphs, we investigate the use of convolution neural ... The approach achieved promising results on this publicly available data set.

SMDA is a minimalist recursive disassembler library that is optimized for accurate Control Flow Graph (CFG) recovery from memory dumps.

A small tool which takes a control flow graph - described in the DOT/Graphviz format - as an input and executes the selected data flow analysis. As an output you receive an image of the control flow ...

It uses Machine SUIF's control-flow graph (CFG) library [cite bibcfg] to parse the program being analyzed into basic blocks, and it associates data-flow results with ... another that does ...

To determine the initial control flow graph for a function, we first decode all possible instructions between the function's start and end addresses. This is done by treating each address in this ...

In most cases, the traditional approach leads to a control flow graph that covers only a small fraction of the valid instructions of the function under analysis. This claim is supported by the ...

This document discusses the Machine-SUIF control flow graph (CFG) library ... provides companion libraries based on this one that support control-flow and data-flow analysis. This section lists our ...

Control flow ... many graphs of large size, some with hundreds of thousands of nodes and edges, and two classes, malicious and benign. We recognize two main audiences for this work: one, researchers ...

For the analysis of these so-called control flow graphs, we investigate the use of convolution neural ... The approach achieved promising results on this publicly available data set.