A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2018; you can also visit the original URL.
The file type is application/pdf
.
Concolic Execution on Small-Size Binaries: Challenges and Empirical Study
2017
2017 47th Annual IEEE/IFIP International Conference on Dependable Systems and Networks (DSN)
Concolic execution has achieved great success in many binary analysis tasks. However, it is still not a primary option for industrial usage. A well-known reason is that concolic execution cannot scale up to large-size programs. Many research efforts have focused on improving its scalability. Nonetheless, we find that, even when processing small-size programs, concolic execution suffers a great deal from the accuracy and scalability issues. This paper systematically investigates the challenges
doi:10.1109/dsn.2017.11
dblp:conf/dsn/XuZKL17
fatcat:v4thrye44nei7eupfay7ocq2f4