Proceedings of the 32nd ACM SIGPLAN Conference on Programming Language Design and Implementation 2011
DOI: 10.1145/1993498.1993558
|View full text |Cite
|
Sign up to set email alerts
|

Directed incremental symbolic execution

Abstract: The last few years have seen a resurgence of interest in the use of symbolic execution -a program analysis technique developed more than three decades ago to analyze program execution paths. Scaling symbolic execution and other path-sensitive analysis techniques to large systems remains challenging despite recent algorithmic and technological advances. An alternative to solving the problem of scalability is to reduce the scope of the analysis. One approach that is widely studied in the context of regression an… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
116
0

Year Published

2012
2012
2022
2022

Publication Types

Select...
5
2

Relationship

1
6

Authors

Journals

citations
Cited by 154 publications
(116 citation statements)
references
References 31 publications
0
116
0
Order By: Relevance
“…For example, the research community has invested a lot of effort in designing techniques for improving the testing of software patches, ranging from test suite prioritisation and selection algorithms [11,30,35] to program analysis techniques for test case generation and bug finding [1,2,20,21,27,28,36,40] to methods for surviving errors introduced by patches at runtime [14]. Many of these techniques depend on the existence of a manual test suite, sometimes requiring the availability of a test exercising the patch [24,37], sometimes making assumptions about the stability of program coverage or external behaviour over time [14,29], other times using it as a starting point for exploration [10,16,22,39], and often times employing it as a baseline for comparison [3,6,9,26].…”
Section: Introductionmentioning
confidence: 99%
“…For example, the research community has invested a lot of effort in designing techniques for improving the testing of software patches, ranging from test suite prioritisation and selection algorithms [11,30,35] to program analysis techniques for test case generation and bug finding [1,2,20,21,27,28,36,40] to methods for surviving errors introduced by patches at runtime [14]. Many of these techniques depend on the existence of a manual test suite, sometimes requiring the availability of a test exercising the patch [24,37], sometimes making assumptions about the stability of program coverage or external behaviour over time [14,29], other times using it as a starting point for exploration [10,16,22,39], and often times employing it as a baseline for comparison [3,6,9,26].…”
Section: Introductionmentioning
confidence: 99%
“…1. The WBS example is taken from [7]; it contains two integer global variables, AltPress and Meter. The CFG shown is for the update method in WBS with three integer variables, PedalPos, BSwitch, and PedalCmd, as input arguments.…”
Section: B Motivating Examplementioning
confidence: 99%
“…2) Generating an Impact Set: Impact sets for each method are generated using standard program slicing techniques as described in detail in [7]. High-level pseudocode for the dependence analysis used to generate the impact sets is shown in Fig.…”
Section: A Static Impact Analysismentioning
confidence: 99%
See 2 more Smart Citations