TY - GEN
T1 - Segmental symbolic execution based on clustering
AU - Ma, Rui
AU - Gao, Haoran
AU - Dou, Bowen
AU - Wang, Xiajing
AU - Hu, Changzhen
N1 - Publisher Copyright:
© 2019 IEEE.
PY - 2019/8
Y1 - 2019/8
N2 - As the impact of security vulnerabilities on information systems becomes more and more serious, program analysis and vulnerability discovery techniques play an increasingly important role in the field of information security. Among many binary program analysis techniques, dynamic symbolic execution technology has been deeply researched and widely applied as an important automated test and vulnerability discovering technology in the information security field. Aimed at the existing problems in dynamic symbolic execution, this paper proposes a binary program segmental symbolic execution approach based on a clustering algorithm. Different from the previous approach of dividing the program segment according to the function process or method in the program, the proposed approach divides the program into larger segments by an improved GN algorithm, and then performs dynamic symbolic execution on each segment. Finally, the results are merged to complete the analysis of the entire program. In this paper, the approach is compared with the regular symbol execution using angr, and the experimental results show the effectiveness of the proposed approach in its time consumption, calculation and storage resource occupation.
AB - As the impact of security vulnerabilities on information systems becomes more and more serious, program analysis and vulnerability discovery techniques play an increasingly important role in the field of information security. Among many binary program analysis techniques, dynamic symbolic execution technology has been deeply researched and widely applied as an important automated test and vulnerability discovering technology in the information security field. Aimed at the existing problems in dynamic symbolic execution, this paper proposes a binary program segmental symbolic execution approach based on a clustering algorithm. Different from the previous approach of dividing the program segment according to the function process or method in the program, the proposed approach divides the program into larger segments by an improved GN algorithm, and then performs dynamic symbolic execution on each segment. Finally, the results are merged to complete the analysis of the entire program. In this paper, the approach is compared with the regular symbol execution using angr, and the experimental results show the effectiveness of the proposed approach in its time consumption, calculation and storage resource occupation.
KW - Angr
KW - GN algorithm
KW - Program analysis
KW - Segmental symbolic execution
UR - http://www.scopus.com/inward/record.url?scp=85083569615&partnerID=8YFLogxK
U2 - 10.1109/SmartWorld-UIC-ATC-SCALCOM-IOP-SCI.2019.00239
DO - 10.1109/SmartWorld-UIC-ATC-SCALCOM-IOP-SCI.2019.00239
M3 - Conference contribution
AN - SCOPUS:85083569615
T3 - Proceedings - 2019 IEEE SmartWorld, Ubiquitous Intelligence and Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Internet of People and Smart City Innovation, SmartWorld/UIC/ATC/SCALCOM/IOP/SCI 2019
SP - 1289
EP - 1296
BT - Proceedings - 2019 IEEE SmartWorld, Ubiquitous Intelligence and Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Internet of People and Smart City Innovation, SmartWorld/UIC/ATC/SCALCOM/IOP/SCI 2019
PB - Institute of Electrical and Electronics Engineers Inc.
T2 - 2019 IEEE SmartWorld, Ubiquitous Intelligence and Computing, Advanced and Trusted Computing, Scalable Computing and Communications, Internet of People and Smart City Innovation, SmartWorld/UIC/ATC/SCALCOM/IOP/SCI 2019
Y2 - 19 August 2019 through 23 August 2019
ER -