Abstract

A control flow graph (CFG) is essential for binary program analysis. However, exceptions, which are part of a program, have not been previously considered when building a CFG. Recent work has suggested how to make a CFG with exceptions through symbolic execution. This method extracts the instruction that generates the exception, then creates the input that causes the exception through symbolic execution, and links the handling function. However, this method involves too much overhead because it requires consideration of the candidate instruction and each program path. Therefore, we propose an improved method of reducing overhead through abstract interpretation. Our proposed method can reduce the overhead of symbolic execution by identifying the range of the operand value of the instruction and further reducing candidate instructions.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.