Context-sensitive relevancy analysis for efficient symbolic execution

2Citations
Citations of this article
7Readers
Mendeley users who have this article in their library.
Get full text

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. © 2008 Springer Berlin Heidelberg.

Cite

CITATION STYLE

APA

Li, X., Shannon, D., Ghosh, I., Ogawa, M., Rajan, S. P., & Khurshid, S. (2008). Context-sensitive relevancy analysis for efficient symbolic execution. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5356 LNCS, pp. 36–52). Springer Verlag. https://doi.org/10.1007/978-3-540-89330-1_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free