[1] Arlt S,Sch F M.Joogie:Infeasible code detection for Java[A].Proceedings of CAV'12[C].Berlin:Springer,2012.767-773.
[2] Ding Sun,Zhang Hongyu,Tan H B K.Detection of infeasible paths:Approaches and challenges[A].Proceedings of the 7th International Conference on Evaluation of Novel Approaches to Software Engineering[C].Berlin:Springer,2013.64-78.
[3] Gong Dun Wei,Yao Xiang Juan.Automatic detection of infeasible paths in software testing[J].IET Software,2010,4(5):361-370.
[4] Zhuang Xiao Tong,Zhang Tao,Pande S.Using branch correlation to identify infeasible paths for anomaly detection[A].Pro- ceedings of the 39th Annual IEEE/ACM International Symposium on Microarchitecture[C].Washington,DC:IEEE Computer Society,2006.113-122.
[5] Suhendra V,Mitra T,Roychoudhury A,et al.Efficient detection and exploitation of infeasible paths for software timing analysis[A].Proceedings of the 43rd Annual Design Automation Conference[C].New York:ACM,2006.358-363.
[6] Delahaye M,Botella B,Gotlieb A.Explanation-based generalization of infeasible path[A].Proceedings of the 3th International Conference on Software Testing,Verification and Validation[C].Los Alamitos:IEEE,2010.215-224.
[7] Jaffar J,Murali V,Navas J,et al.TRACER:A symbolic execution tool for verification[A].Proceedings of CAV'12[C].Berlin:Springer,2012.758-766.
[8] Tomb A,Flanagan C.Detecting inconsistencies via universal reachability Analysis[A].Proceedings of ISSTA'12[C].New York:ACM,2012.287-297.
[9] Hermadi I,Lokan C,Sarker R.Dynamic stopping criteria for search-based test data generation for path testing[J].Information and Software Technology,2014,56(4):395-407.
[10] Ghiduk A S.Automatic generation of basis test paths using variable length genetic algorithm[J].Information Processing Letters,2014,114(6):304-316.
[11] Tonella P,Tiella R,Nguyen C D.Interpolated N-grams for model based testing[A].Proceedings of ICSE'14[C].New York:ACM,2014.10-21.
[12] Ngo M N,Tan H B K.Heuristics-based infeasible path detection for dynamic test data generation[J].Information and Software Technology,2008,50(7):641-655. |