2015 IEEE/ACM 10th International Workshop on Automation of Software Test (AST) (2015)
May 23, 2015 to May 24, 2015
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/AST.2015.21
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.
Testing, Accuracy, Training, Prototypes, Software, Scalability, Pattern matching
S. Ding, H. B. Tan and L. K. Shar, "Mining Patterns of Unsatisfiable Constraints to Detect Infeasible Paths," 2015 IEEE/ACM 10th International Workshop on Automation of Software Test (AST), Florence, Italy, 2015, pp. 65-69.