|
JAIST Repository >
School of Information Science >
Articles >
Journal Articles >
Please use this identifier to cite or link to this item:
https://hdl.handle.net/10119/7880
|
| Title: | Context-Sensitive Relevancy Analysis for Efficient Symbolic Execution |
| Authors: | Li, Xin
Shannon, Daryl
Ghosh, Indradeep
Ogawa, Mizuhito
Rajan, Sreeranga P.
Khurshid, Sarfraz |
| Issue Date: | 2008 |
| Publisher: | Springer |
| Magazine name: | Lecture Notes in Computer Science |
| Volume: | 5356 |
| Start page: | 36 |
| End page: | 52 |
| DOI: | 10.1007/978-3-540-89330-1_4 |
| Abstract: | Symbolic execution is a flexible and powerful, but computationally expensive technique to detect dynamic behaviors of a program. In this paper, we present a context-sensitive relevancy analysis algorithm based on weighted pushdown model checking, which pinpoints memory locations in the program where symbolic values can flow into. This information is then utilized by a code instrumenter to transform only relevant parts of the program with symbolic constructs, to help improve the efficiency of symbolic execution of Java programs. Our technique is evaluated on a generalized symbolic execution engine that is developed upon Java Path Finder with checking safety properties of Java applications. Our experiments indicate that this technique can effectively improve the performance of the symbolic execution engine with respect to the approach that blindly instruments the whole program. |
| Rights: | This is the author-created version of Springer, Xin Li, Daryl Shannon, Indradeep Ghosh, Mizuhito Ogawa, Sreeranga P. Rajan, and Sarfraz Khurshid, Lecture Notes in Computer Science, 5356, 2008, 36-52. The original publication is available at www.springerlink.com, http://dx.doi.org/10.1007/978-3-540-89330-1_4 |
| URI: | https://hdl.handle.net/10119/7880 |
| Material Type: | author |
| Appears in Collections: | b10-1. 雑誌掲載論文 (Journal Articles)
|
Files in This Item:
| File |
Description |
Size | Format |
|---|
| APLAS08.pdf | | 303Kb | Adobe PDF | View/Open |
|
All items in DSpace are protected by copyright, with all rights reserved.
|
