Cute: a concolic unit testing engine for c
By
In unit testing, a program is decomposed into units which are collections of functions. A part of unit can be tested by generating inputs for a single entry function. The entry function may contain pointer arguments, in which case the inputs to the unit are memory graphs. The paper addresses the problem of automating unit testing with memory graphs as inputs. The approach used builds on previous work combining symbolic and concrete execution, and more specifically, using such a combination to generate test inputs to explore all feasible execution paths. The current work develops a method to represent and track constraints that capture the behavior of a symbolic execution of a unit with memory graphs as inputs. Moreover, an efficient constraint solver is proposed to facilitate incremental generation of such test inputs. Finally, CUTE, a tool implementing the method is described together with the results of applying CUTE to real-world examples of C code.
BibTeX
@inproceedings{conf/sigsoft/SenMA05,
author = "Sen, Koushik and Marinov, Darko and Agha, Gul",
editor = "Wermelinger, Michel and Gall, Harald",
title = "CUTE: a concolic unit testing engine for C",
booktitle = "ESEC/SIGSOFT FSE",
crossref = "conf/sigsoft/2005",
ee = "http://doi.acm.org/10.1145/1081706.1081750",
keywords = "software engineering",
pages = "263-272",
year = "2005",
}
@proceedings{conf/sigsoft/2005,
editor = "Wermelinger, Michel and Gall, Harald",
title = "Proceedings of the 10th European Software Engineering
Conference held jointly with 13th ACM SIGSOFT International
Symposium on Foundations of Software Engineering, 2005, Lisbon,
Portugal, September 5-9, 2005",
isbn = "1-59593-014-0",
publisher = "ACM",
year = "2005",
}