DMCA
Hybrid concolic testing
Cached
Download Links
| Citations: | 137 - 7 self |
BibTeX
@MISC{Majumdar_hybridconcolic,
author = {Rupak Majumdar and et al.},
title = {Hybrid concolic testing},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We present hybrid concolic testing, an algorithm that interleaves random testing with concolic execution to obtain both a deep and a wide exploration of program state space. Our algorithm generates test inputs automatically by interleaving random testing until saturation with bounded exhaustive symbolic exploration of program points. It thus combines the ability of random search to reach deep program states quickly together with the ability of concolic testing to explore states in a neighborhood exhaustively. We have implemented our algorithm on top of CUTE and applied it to obtain better branch coverage for an editor implementation (VIM 5.7, 150K lines of code) as well as a data structure implementation in C. Our experiments suggest that hybrid concolic testing can handle large programs and provide, for the same testing budget, almost 4 × the branch coverage than random testing and almost 2 × that of concolic testing.
Keyphrases
branch coverage hybrid concolic testing bounded exhaustive symbolic exploration editor implementation wide exploration test input program point large program random search deep program state concolic execution concolic testing random testing testing budget data structure implementation program state space
