Publication Type

Conference Proceeding Article

Version

acceptedVersion

Publication Date

5-2015

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.

Keywords

Infeasible paths, pattern mining, symbolic evaluation, static analysis, structural testing

Discipline

Databases and Information Systems | Data Storage Systems

Research Areas

Cybersecurity

Publication

Proceedings of the 2015 IEEE/ACM 10th International Workshop on Automation of Software Test, Florence, Italy, May 23-24

First Page

65

Last Page

69

ISBN

9781467370226

Identifier

10.1109/AST.2015.21

Publisher

ACM

City or Country

Italy

Additional URL

https://doi.org/10.1109/AST.2015.21

Share

COinS