IntFinder: Automatically Detecting Integer Bugs in x86 Binary Program

Author(s):  
Ping Chen ◽  
Hao Han ◽  
Yi Wang ◽  
Xiaobin Shen ◽  
Xinchun Yin ◽  
...  
Keyword(s):  
Cybersecurity ◽  
2021 ◽  
Vol 4 (1) ◽  
Author(s):  
Shushan Arakelyan ◽  
Sima Arasteh ◽  
Christophe Hauser ◽  
Erik Kline ◽  
Aram Galstyan

AbstractTackling binary program analysis problems has traditionally implied manually defining rules and heuristics, a tedious and time consuming task for human analysts. In order to improve automation and scalability, we propose an alternative direction based on distributed representations of binary programs with applicability to a number of downstream tasks. We introduce Bin2vec, a new approach leveraging Graph Convolutional Networks (GCN) along with computational program graphs in order to learn a high dimensional representation of binary executable programs. We demonstrate the versatility of this approach by using our representations to solve two semantically different binary analysis tasks – functional algorithm classification and vulnerability discovery. We compare the proposed approach to our own strong baseline as well as published results, and demonstrate improvement over state-of-the-art methods for both tasks. We evaluated Bin2vec on 49191 binaries for the functional algorithm classification task, and on 30 different CWE-IDs including at least 100 CVE entries each for the vulnerability discovery task. We set a new state-of-the-art result by reducing the classification error by 40% compared to the source-code based inst2vec approach, while working on binary code. For almost every vulnerability class in our dataset, our prediction accuracy is over 80% (and over 90% in multiple classes).


2016 ◽  
Vol 7 ◽  
pp. 03004 ◽  
Author(s):  
Feng-Yi Tang ◽  
Chao Feng ◽  
Chao-Jing Tang
Keyword(s):  

Author(s):  
Hui Lu ◽  
Chengjie Jin ◽  
Xiaohan Helu ◽  
Man Zhang ◽  
Yanbin Sun ◽  
...  

Science ◽  
1975 ◽  
Vol 189 (4201) ◽  
pp. 440-440
Author(s):  
D. S.
Keyword(s):  

1993 ◽  
Vol 45 (5) ◽  
pp. 237-241 ◽  
Author(s):  
Philipp Hanschke ◽  
Jörg Würtz
Keyword(s):  

Science ◽  
1982 ◽  
Vol 217 (4559) ◽  
pp. 517-517 ◽  
Author(s):  
C. Holden
Keyword(s):  

2005 ◽  
Vol 2005 (2) ◽  
pp. 113-121 ◽  
Author(s):  
Bahram Alidaee ◽  
Fred Glover ◽  
Gary A. Kochenberger ◽  
Cesar Rego

The number partitioning problem has proven to be a challenging problem for both exact and heuristic solution methods. We present a new modeling and solution approach that consists of recasting the problem as an unconstrained quadratic binary program that can be solved by efficient metaheuristic methods. Our approach readily accommodates both the common two-subset partition case as well as the more general case of multiple subsets. Preliminary computational experience is presented illustrating the attractiveness of the method.


Sign in / Sign up

Export Citation Format

Share Document