Name
Abstract | ||
|---|---|---|
Detection of infeasible paths is required in many areas including test coverage analysis, test case generation, security vulnerability analysis, etc. Existing approaches typically use static analysis coupled with symbolic evaluation, heuristics, or path-pattern analysis. This paper is related to these approaches but with a different objective. It is to analyze code of real systems to build patterns of unsatisfiable constraints in infeasible paths. The resulting patterns can be used to detect infeasible paths without the use of constraint solver and evaluation of function calls involved, thus improving scalability. The patterns can be built gradually. Evaluation of the proposed approach shows promising results.
|
Year | DOI | Venue |
|---|---|---|
2015 | 10.1109/AST.2015.21 | AST@ICSE |
Keywords | Field | DocType |
Infeasible paths, pattern mining, symbolic evaluation, static analysis, structural testing | Code coverage,Data mining,Mathematical optimization,Vulnerability (computing),Computer science,Static analysis,Constraint satisfaction problem,Real-time computing,Heuristics,Software,Pattern matching,Scalability | Conference |
Citations | PageRank | References |
0 | 0.34 | 7 |
Authors | ||
3 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sun Ding | 1 | 5 | 3.85 |
| Hee Beng Kuan Tan | 2 | 489 | 45.05 |
| Lwin Khin Shar | 3 | 180 | 14.56 |