SUSHI: A Test Generator for Programs with Complex Structured Inputs
Random and search-based test generators yield realistic test cases based on program APIs, but often miss structural test objectives that depend on non-trivial data structure instances; Whereas symbolic execution can precisely characterise those dependencies but does not compute method sequences to instantiate them. We present SUSHI, a high-coverage test case generator for programs with complex structured inputs. SUSHI leverages symbolic execution to generate path conditions that precisely describe the relationship between program paths and input data structures, and converts the path conditions into the tness functions of search-based test generation problems. A solution for the search problem is a legal method sequence that instantiates the structured inputs to exercise the program paths identied by the path condition. Our experiments indicate that SUSHI can distinctively complement current automatic test generation tools.
Wed 30 May Times are displayed in time zone: (GMT+02:00) Amsterdam, Berlin, Bern, Rome, Stockholm, Vienna change
|11:00 - 11:30|
|11:30 - 12:00|
Antonia BertolinoCNR-ISTI, Antonello CalabròCNR-ISTI, Guglielmo De AngelisCNR-IASI, CNR-ISTI, Micael Gallego, Boni García, Francisco GortázarUniversidad Rey Juan CarlosDOI Pre-print Media Attached
|12:00 - 12:30|
Pietro BraioneUniversity of Milano-Bicocca, Giovanni DenaroUniversity of Milano-Bicocca, Italy, Andrea MattavelliImperial College London, Mauro PezzeUniversità della Svizzera italiana (USI) and Università degli Studi di Milano BicoccaPre-print