Sciweavers

166 search results - page 1 / 34
» Type-Dependence Analysis and Program Transformation for Symb...
Sort
View
TACAS
2007
Springer
125views Algorithms» more  TACAS 2007»
13 years 11 months ago
Type-Dependence Analysis and Program Transformation for Symbolic Execution
Symbolic execution can be problematic when applied to real applications. This paper addresses two of these problems: (1) the constraints generated during symbolic execution may be ...
Saswat Anand, Alessandro Orso, Mary Jean Harrold
APLAS
2008
ACM
13 years 7 months ago
Context-Sensitive Relevancy Analysis for Efficient Symbolic Execution
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-sensi...
Xin Li, Daryl Shannon, Indradeep Ghosh, Mizuhito O...
IPL
2007
78views more  IPL 2007»
13 years 5 months ago
Ensuring the quasi-termination of needed narrowing computations
We present a characterization of first-order functional programs which are quasiterminating w.r.t. the symbolic execution mechanism of needed narrowing, i.e., computations in the...
J. Guadalupe Ramos, Josep Silva, Germán Vid...
FASE
2011
Springer
12 years 8 months ago
Theoretical Aspects of Compositional Symbolic Execution
Given a program and an assertion in that program, determining if the assertion can fail is one of the key applications of program analysis. Symbolic execution is a well-known techn...
Dries Vanoverberghe, Frank Piessens
ISSTA
2010
ACM
13 years 7 months ago
Exploiting program dependencies for scalable multiple-path symbolic execution
This paper presents a new technique, called Symbolic Program Decomposition (or SPD), for symbolic execution of multiple paths that is more scalable than existing techniques, which...
Raúl A. Santelices, Mary Jean Harrold