Can I read Abstract Symbolic Automata: Mixed syntactic/semantic similarity analysis of executables on EtoBox?

Abstract Symbolic Automata: Mixed syntactic/semantic similarity analysis of executables by Mila Dalla Preda; Roberto Giacobazzi; Arun Lakhotia; Isabella Mastroeni is a Computer Science article available to read on EtoBox.

What is Abstract Symbolic Automata: Mixed syntactic/semantic similarity analysis of executables about?

We introduce a model for mixed syntactic/semantic approximation of programs based on symbolic finite automata (SFA). The edges of SFA are labeled by predicates whose semantics specifies the denotations that are allowed by the edge. We introduce the notion of abstract symbolic finite automaton (ASFA) where approximation is made by abstract interpretation of symbolic finite automata, acting both at syntactic (predicate) and semantic (denotation) level. We investigate in the details how the syntactic and semantic abstractions of SFA relate to each other and contribute to the determination of the recognized language. Then we introduce a family of transformations for simplifying ASFA. We apply this model to prove properties of commonly used tools for similarity analysis of binary executables. Following the structure of their control flow graphs, disassembled binary executables are represented as (concrete) SFA, where states are program points and predicates represent the (possibly infinite) I/O semantics of each basic block in a constraint form. Known tools for binary code analysis are viewed as specific choices of symbolic and semantic abstractions in our framework, making symbolic fin

Who reads Abstract Symbolic Automata: Mixed syntactic/semantic similarity analysis of executables?

Author

Mila Dalla Preda; Roberto Giacobazzi; Arun Lakhotia; Isabella Mastroeni

Publisher

ACM

Published

2015

Language

EN

Field

Computer Science (Physical Sciences)