Reference : Mining Patterns of Unsatisfiable Constraints to Detect Infeasible Paths
Scientific congresses, symposiums and conference proceedings : Paper published in a journal
Engineering, computing & technology : Computer science
http://hdl.handle.net/10993/22865
Mining Patterns of Unsatisfiable Constraints to Detect Infeasible Paths
English
DING, SUN mailto [Nanyang Technological University > Information Engineering, School of Electrical and Electronic Engineering]
TAN, HEE BENG KUAN mailto []
Shar, Lwin Khin mailto [University of Luxembourg > Interdisciplinary Centre for Security, Reliability and Trust (SNT) > >]
May-2015
Automation of Software Test (AST 2015)
Yes
No
International
10th International Workshop on Automation of Software Test in conjunction with 37th International Conference on Software Engineering
23-05-2015 to 24-05-2015
[en] infeasible paths ; pattern mining ; symbolic evaluation
[en] 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.
Researchers ; Professionals ; Students
http://hdl.handle.net/10993/22865

File(s) associated to this reference

Fulltext file(s):

FileCommentaryVersionSizeAccess
Limited access
AST-(camera-ready) Mining Patterns of Unsatisfiable Constraints to Detect Infeasible Paths.pdfAuthor preprint685.67 kBRequest a copy

Bookmark and Share SFX Query

All documents in ORBilu are protected by a user license.