Comparing Control Flow Graphs of Binary Programs through Match Propagation

被引:2
|
作者
Lim, Hyun-il [1 ]
机构
[1] Kyungnam Univ, Dept Comp Engn, Gyeongsangnam Do, South Korea
关键词
control flow graph; binary program analysis; software comparison;
D O I
10.1109/COMPSAC.2014.84
中图分类号
TP31 [计算机软件];
学科分类号
081202 ; 0835 ;
摘要
In this paper, we present an approach to comparing control flow graphs of binary programs by matching their basic blocks. We first set up an initial match and propagate it to reach a stable state. We consider the matched pairs to identify overall similarities. To evaluate the proposed method, we perform experiments on real-world Java applications, and compare their performance with previous structural matching method. In the experimental results, the proposed method shows more reliable results than previous method at distinguishing similar control flow graphs.
引用
收藏
页码:598 / 599
页数:2
相关论文
共 50 条
  • [1] Best Match Graphs With Binary Trees
    Schaller, David
    Geiss, Manuela
    Hellmuth, Marc
    Stadler, Peter F. F.
    [J]. IEEE-ACM TRANSACTIONS ON COMPUTATIONAL BIOLOGY AND BIOINFORMATICS, 2023, 20 (03) : 1679 - 1690
  • [2] Arc-Completion of 2-Colored Best Match Graphs to Binary-Explainable Best Match Graphs
    Schaller, David
    Geiss, Manuela
    Hellmuth, Marc
    Stadler, Peter F.
    [J]. ALGORITHMS, 2021, 14 (04)
  • [3] Identifying functions in binary code with reverse extended control flow graphs
    Qiu, Jing
    Su, Xiaohong
    Ma, Peijun
    [J]. JOURNAL OF SOFTWARE-EVOLUTION AND PROCESS, 2015, 27 (10) : 793 - 820
  • [4] Provably correct control flow graphs from Java bytecode programs with exceptions
    Afshin Amighi
    Pedro de Carvalho Gomes
    Dilian Gurov
    Marieke Huisman
    [J]. International Journal on Software Tools for Technology Transfer, 2016, 18 : 653 - 684
  • [5] Belief Propagation Through Provenance Graphs
    Batlajery, Belfrit Victor
    Weal, Mark
    Chapman, Adriane
    Moreau, Luc
    [J]. PROVENANCE AND ANNOTATION OF DATA AND PROCESSES, IPAW 2018, 2018, 11017 : 145 - 157
  • [6] Assumption propagation through annotated programs
    Chaudhari, Dipak L.
    Damani, Om
    [J]. FORMAL ASPECTS OF COMPUTING, 2017, 29 (03) : 495 - 530
  • [7] Provably correct control flow graphs from Java']Java bytecode programs with exceptions
    Amighi, Afshin
    Gomes, Pedro de Carvalho
    Gurov, Dilian
    Huisman, Marieke
    [J]. INTERNATIONAL JOURNAL ON SOFTWARE TOOLS FOR TECHNOLOGY TRANSFER, 2016, 18 (06) : 653 - 684
  • [8] Cosine Similarity through Control Flow Graphs For Secure Software Engineering
    Desku, Astrit
    Raufi, Bujar
    Luma, Artan
    Selimi, Besnik
    [J]. 2021 7TH INTERNATIONAL CONFERENCE ON ENGINEERING AND EMERGING TECHNOLOGIES (ICEET 2021), 2021, : 264 - 267
  • [9] Using regression-match graphs to control search in planning
    McDermott, D
    [J]. ARTIFICIAL INTELLIGENCE, 1999, 109 (1-2) : 111 - 159
  • [10] Efficient Propagation Techniques for Handling Cyclic Symmetries in Binary Programs
    van Doornmalen, Jasper
    Hojny, Christopher
    [J]. INFORMS JOURNAL ON COMPUTING, 2024, 36 (03)