Fast Loop Boundary Coverage Testing in Symbolic Execution

Yi Wang; Tong Hai Jiang; Jun Dong

doi:10.4028/www.scientific.net/AMR.718-720.2314

Paper Titles

Fast Pedestrian Detection Based on GPU+CPU
p.2291

Improved SURF Descriptor Based on Triangle Partition
p.2296

Research on Clone Algorithm Applied in Edge Detection of Retinal Vessels
p.2302

An Algorithm of Schatten ρ-Norm Regularized Least Squares Problems for Video Restoration
p.2308

Fast Loop Boundary Coverage Testing in Symbolic Execution
p.2314

Research on the Image Detection of Moving Objects in Natural Environment
p.2318

Research on the Relationship between Projection Number and Image Noise Level in FBP Reconstruction
p.2324

An Improved Mean Shift Algorithm for Vehicle Tracking
p.2329

Moving Target Tracking Using Sparse Optical Flow Method
p.2335

HomeAdvanced Materials ResearchAdvanced Materials Research Vols. 718-720Fast Loop Boundary Coverage Testing in Symbolic...

Fast Loop Boundary Coverage Testing in Symbolic Execution

Abstract:

Symbolic execution is a promising approach for software analyzing and testing, but it still suffers from scalability issues, in which a significant challenge is how to handle loop caused path explosion. This paper proposes a new approach to mitigate the scalability problem brought by loops in symbolic execution. By reusing the previously calculated results captured from satisfiability verification process, we implement a fast loop boundary coverage test strategy which can eliminate a large number of redundant paths and unnecessary solver invocations. Experimental results on Symbolic (Java) PathFinder show that our strategy can greatly improve the efficiency of testing for programs having loops.

You might also be interested in these eBooks

View Preview

Info:

Periodical:

Advanced Materials Research (Volumes 718-720)

Pages:

2314-2317

DOI:

https://doi.org/10.4028/www.scientific.net/AMR.718-720.2314

Citation:

Cite this paper

Online since:

July 2013

Authors:

Yi Wang, Tong Hai Jiang, Jun Dong

Keywords:

Loop Coverage, Software Testing, Symbolic Execution

Export:

RIS, BibTeX

Price:

Permissions CCC:

Request Permissions

Permissions PLS:

Request Permissions

Сopyright:

Citation:

References

[1] J. C. King. Symbolic Execution and Program Testing. Communications of the ACM, Vol. 19 (1976) No.7, p.385–394.

DOI: 10.1145/360248.360252

Google Scholar

[2] C. Cadar, P. Godefroid, S. Khurshid, C. S. Păsăreanu, K. Sen, N. Tillmann, and W. Visser. Symbolic execution for software testing in practice: preliminary assessment. In the 33th ICSE(2011), pp.1066-1071.

DOI: 10.1145/1985793.1985995

Google Scholar

[3] Y. Zhang, Z. Chen, and J. Wang. Speculative symbolic execution. In ISSRE (2012), to appear. (http://arxiv.org/abs/1205.4951).

Google Scholar

[4] N. Williams, B. Marre, P. Mouy and M. Roger. PathCrawler: Automatic Generation of Path Tests by Combining Static and Dynamic Analysis. In the 5th EDCC, Vol.3463 (2005), pp.281-292.

DOI: 10.1007/11408901_21

Google Scholar

[5] C. S. Păsăreanu and N. Rungta. Symbolic PathFinder: Symbolic Execution of Java Bytecode. In ASE(2010), pp.179-180.

DOI: 10.1145/1858996.1859035

Google Scholar

[6] S. Anand, C. S. Păsăreanu, W. Visser. Symbolic Execution with Abstraction. STTT, vol.11 (2009) No.1, pp.53-67.

Google Scholar

[7] G. Lee, J. Morris, K. Parker, G. A Bundell, P. Lam. Using symbolic execution to guide test generation. STVR, Vol.15 (2005) No.1, pp.41-61.

DOI: 10.1002/stvr.309

Google Scholar

[8] C. Cadar, D. Dunbar, D. Engler. KLEE: Unassisted and Automatic Generation of High-Coverage Tests for Complex Systems Programs, In the 8th OSDI (2008), pp.209-224.

Google Scholar