Callgraph properties of executables

  • Authors:
  • Daniel Bilar

  • Affiliations:
  • Wellesley College, Department of Computer Science, Wellesley, MA 02481, USA. E-mail: dbilar@wellesley.edu

  • Venue:
  • AI Communications - Network Analysis in Natural Sciences and Engineering
  • Year:
  • 2007

Quantified Score

Hi-index 0.00

Visualization

Abstract

This paper examines the callgraphs of 120 malicious and 280 non-malicious executables. Pareto models are fitted to indegree, outdegree and basic block count distributions, and a statistically significant difference is shown for the derived power law exponent. A two-step optimization process is hypothesized to account for structural features of the executable.