Incremental state-space exploration for programs with dynamically allocated data Export

@inproceedings{citeulike:5997916, abstract = {We present a novel technique that speeds up state-space exploration (SSE) for evolving programs with dynamically allocated data. SSE is the essence of explicit-state model checking and an increasingly popular method for automating test generation. Traditional, non-incremental SSE takes one version of a program and systematically explores the states reachable during the program's executions to find property violations. Incremental SSE considers several versions that arise during program evolution: reusing the results of SSE for one version can speed up SSE for the next version, since state spaces of consecutive program versions can have significant similarities. We have implemented our technique in two model checkers: Java PathFinder and the J-Sim state-space explorer. The experimental results on 24 program evolutions and exploration changes show that for non-initial runs our technique speeds up SSE in 22 cases from 6.43\% to 68.62\% (with median of 42.29\%) and slows down SSE in only two cases for -4.71\% and -4.81\%.}, address = {New York, NY, USA}, author = {Lauterburg, Steven and Sobeih, Ahmed and Marinov, Darko and Viswanathan, Mahesh}, booktitle = {ICSE '08: Proceedings of the 30th international conference on Software engineering}, citeulike-article-id = {5997916}, citeulike-linkout-0 = {http://portal.acm.org/citation.cfm?id=1368128}, citeulike-linkout-1 = {http://dx.doi.org/10.1145/1368088.1368128}, doi = {10.1145/1368088.1368128}, isbn = {978-1-60558-079-1}, keywords = {model-check, sw-engr}, location = {Leipzig, Germany}, pages = {291--300}, posted-at = {2009-10-23 14:35:51}, priority = {2}, publisher = {ACM}, title = {Incremental state-space exploration for programs with dynamically allocated data}, url = {http://dx.doi.org/10.1145/1368088.1368128}, year = {2008} }

TY - CONF ID - citeulike:5997916 L3 - citeulike-article-id:5997916 N2 - We present a novel technique that speeds up state-space exploration (SSE) for evolving programs with dynamically allocated data. SSE is the essence of explicit-state model checking and an increasingly popular method for automating test generation. Traditional, non-incremental SSE takes one version of a program and systematically explores the states reachable during the program's executions to find property violations. Incremental SSE considers several versions that arise during program evolution: reusing the results of SSE for one version can speed up SSE for the next version, since state spaces of consecutive program versions can have significant similarities. We have implemented our technique in two model checkers: Java PathFinder and the J-Sim state-space explorer. The experimental results on 24 program evolutions and exploration changes show that for non-initial runs our technique speeds up SSE in 22 cases from 6.43% to 68.62% (with median of 42.29%) and slows down SSE in only two cases for -4.71% and -4.81%. CY - Leipzig, Germany SN - 978-1-60558-079-1 AD - New York, NY, USA EP - 300 TI - Incremental state-space exploration for programs with dynamically allocated data PB - ACM T2 - ICSE '08: Proceedings of the 30th international conference on Software engineering SP - 291 KW - model-check KW - sw-engr AU - Lauterburg, Steven AU - Sobeih, Ahmed AU - Marinov, Darko AU - Viswanathan, Mahesh PY - 2008/// UR - http://dx.doi.org/10.1145/1368088.1368128 ER -