%0 Conference Paper %1 Shahbaz2012 %A Shahbaz, Muzammil %A McMinn, Phil %A Stevenson, Mark %B International Conference on Quality Software (QSIC 2012) %D 2012 %I IEEE %K natural_language identifier %P 79--88 %T Automated Discovery of Valid Test Strings using Dynamic Regular Expressions Collation and Natural Language Processing %X Classic approaches to test input generation -- such as dynamic symbolic execution and search-based testing -- are commonly driven by a test adequacy criterion such as branch coverage. However, there is no guarantee that these techniques will generate meaningful and realistic inputs, particularly in the case of string test data. Also, these techniques have trouble handling path conditions involving string operations that are inherently complex in nature. This paper presents a novel approach of finding valid values by collating suitable regular expressions dynamically that validate the format of the string values, such as an email address. The regular expressions are found using web searches that are driven by the identifiers appearing in the program, for example a string parameter called email Address. The identifier names are processed through natural language processing techniques to tailor the web queries. Once a regular expression has been found, a secondary web search is performed for strings matching the regular expression. An empirical study is performed on case studies involving String input validation code from 10 open source projects. Compared to other approaches, the precision of generating valid strings is significantly improved by employing regular expressions and natural language processing techniques.

@inproceedings{Shahbaz2012, abstract = {Classic approaches to test input generation -- such as dynamic symbolic execution and search-based testing -- are commonly driven by a test adequacy criterion such as branch coverage. However, there is no guarantee that these techniques will generate meaningful and realistic inputs, particularly in the case of string test data. Also, these techniques have trouble handling path conditions involving string operations that are inherently complex in nature. This paper presents a novel approach of finding valid values by collating suitable regular expressions dynamically that validate the format of the string values, such as an email address. The regular expressions are found using web searches that are driven by the identifiers appearing in the program, for example a string parameter called email Address. The identifier names are processed through natural language processing techniques to tailor the web queries. Once a regular expression has been found, a secondary web search is performed for strings matching the regular expression. An empirical study is performed on case studies involving String input validation code from 10 open source projects. Compared to other approaches, the precision of generating valid strings is significantly improved by employing regular expressions and natural language processing techniques.}, added-at = {2012-10-23T20:35:12.000+0200}, author = {Shahbaz, Muzammil and McMinn, Phil and Stevenson, Mark}, biburl = {https://www.bibsonomy.org/bibtex/2eae32922a6e8d73b58932894b0d20fe8/sjbutler}, booktitle = {International Conference on Quality Software (QSIC 2012)}, file = {:Shahbaz 2012 Automated discovery of valid test strings.pdf:PDF}, interhash = {5e5baeed6dd6fd5f94a977a8b60b2e8b}, intrahash = {eae32922a6e8d73b58932894b0d20fe8}, keywords = {natural_language identifier}, location = {Xi'an, China}, month = {27--29 August}, pages = {79--88}, publisher = {IEEE}, timestamp = {2012-10-23T20:35:12.000+0200}, title = {Automated Discovery of Valid Test Strings using Dynamic Regular Expressions Collation and Natural Language Processing}, year = 2012 }