| Issue |
MATEC Web Conf.
Volume 189, 2018
2018 2nd International Conference on Material Engineering and Advanced Manufacturing Technology (MEAMT 2018)
|
|
|---|---|---|
| Article Number | 04005 | |
| Number of page(s) | 10 | |
| Section | Circuit Analysis | |
| DOI | https://doi.org/10.1051/matecconf/201818904005 | |
| Published online | 10 August 2018 | |
Target function location based on code coverage analysis
State Key Laboratory of Mathematical Engineering and Advanced Computing, Henan, China
*
Corresponding author : 394884987@qq.com
How to locate the target function faster and more accurately is a key problem of Automatic Reverse-Engineering of Software Programs. In order to solve this problem, a target function location method based on code coverage analysis is proposed. Firstly, it obtains function call information of the program and calculate the suspicious rate of each function. And then a stability factor is proposed to reduce the noise functions. Finally, the target function is successfully located. The experimental results show the method proposed has linear time complexity. For software programs with million function calls, it can accurately locate the target function within several minutes, the performance and accuracy are greately improved compared to the contrast methods.
© The Authors, published by EDP Sciences, 2018
This is an Open Access article distributed under the terms of the Creative Commons Attribution License (http://creativecommons.org/licenses/by/4.0), which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.
Current usage metrics show cumulative count of Article Views (full-text article views including HTML views, PDF and ePub downloads, according to the available data) and Abstracts Views on Vision4Press platform.
Data correspond to usage on the plateform after 2015. The current usage metrics is available 48-96 hours after online publication and is updated daily on week days.
Initial download of the metrics may take a while.