Loading…
Academic Journal
Input data generation for reaching specific function in program by iterative dynamic analysis
A. Y. Gerasimov, L. V. Kruglov
Труды Института системного программирования РАН, Vol 28, Iss 5, Pp 159-174 (2018)
Saved in:
| Title | Input data generation for reaching specific function in program by iterative dynamic analysis |
|---|---|
| Authors | A. Y. Gerasimov, L. V. Kruglov |
| Publication Year |
2018
|
| Source |
Труды Института системного программирования РАН, Vol 28, Iss 5, Pp 159-174 (2018)
|
| Description |
Dynamic symbolic execution is a well-known technique used for different tasks of program analysis: input generation for increasing test coverage for program, inputs of death generation, exploit generation and etc. But huge time costs of program analysis during dynamic symbolic execution for any real-life program is a well-known problem caused by path explosion and necessity of path constraint solving for every path with different SAT/SMT techniques which is a NP-complete task in general case. Brute force analysis of every path in program has limited practical sense for time limited analysis; instead different techniques and heuristics are used to improve analysis performance and reduce space of analysis for specific needs of analyst or while solving specific problem under analysis. We present our approach which combines static analysis of program binary code based on binutils library with dynamic symbolic execution tool based on Avalanche - an iterative dynamic analysis tool to perform targeted input data generation for reaching specific function in the program. As the first step of our algorithm we extract reduced program call graph which contains only calls to functions which ends with the function of interest, then we amplify this call graph with control flow graph inside of functions included into reduced call graph. Using the reduced control-flow graph of program which contain only calls and conditional jumps directions which lead to the function of interest we built the metric of best next analysis direction. This approach allows us to significantly (up to twelve times for some real world programs) reduce the time of reaching function of interest comparatively to brute force program paths analysis with inversion of every conditional jump at the execution path dependent on tainted data.
|
| Document Type |
article
|
| Language |
English
Russian |
| Publisher Information |
Ivannikov Institute for System Programming of the Russian Academy of Sciences, 2018.
|
| Subject Terms | |
