Tue Le
Research Subjects
Research Interests
Tue Le has a total of 7 co-authors. Here are the top co-authors by number of shared publications:
- Dinh Phung
Monash University, Melbourne, VIC, Australia
1 shared publication - John Grundy
Monash University, Melbourne, Australia
1 shared publication - Khanh Nguyen
AI Research Lab, Trusting Social
1 shared publication - Olivier De Vel
Defence Science and Technology Group
1 shared publication - Paul Montague
Defence Science and Technology Group
1 shared publication - Trung Le
Monash University, Melbourne, VIC, Australia
1 shared publication
Latest Publications
- 6 May 2020
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 12084, 712-725
Code Action Network for Binary Function Scope Identification
Function identification is a preliminary step in binary analysis for many applications from malware detection, common vulnerability detection and binary instrumentation to name a few. In this paper, we propose the Code Action Network (CAN) whose key idea is to encode the task of function scope identification to a sequence of three action states NI (i.e., next inclusion), NE (i.e., next exclusion), and FE (i.e., function end) to efficiently and effectively tackle function scope identification, the hardest and most crucial task in function identification. A bidirectional Recurrent Neural Network is trained to match binary programs with their sequence of action states. To work out function scopes in a binary, this binary is first fed to a trained CAN to output its sequence of action states which can be further decoded to know the function scopes in the binary. We undertake extensive experiments to compare our proposed method with other state-of-the-art baselines. Experimental results demonstrate that our proposed method outperforms the state-of-the-art baselines in terms of predictive performance on real-world datasets which include binaries from well-known libraries.
- 6 May 2020
- Published by Springer Nature in Lecture Notes in Computer Science
- Vol. 12084, 712-725
Code Action Network for Binary Function Scope Identification
Function identification is a preliminary step in binary analysis for many applications from malware detection, common vulnerability detection and binary instrumentation to name a few. In this paper, we propose the Code Action Network (CAN) whose key idea is to encode the task of function scope identification to a sequence of three action states NI (i.e., next inclusion), NE (i.e., next exclusion), and FE (i.e., function end) to efficiently and effectively tackle function scope identification, the hardest and most crucial task in function identification. A bidirectional Recurrent Neural Network is trained to match binary programs with their sequence of action states. To work out function scopes in a binary, this binary is first fed to a trained CAN to output its sequence of action states which can be further decoded to know the function scopes in the binary. We undertake extensive experiments to compare our proposed method with other state-of-the-art baselines. Experimental results demonstrate that our proposed method outperforms the state-of-the-art baselines in terms of predictive performance on real-world datasets which include binaries from well-known libraries.