{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,26]],"date-time":"2023-10-26T13:11:26Z","timestamp":1698325886148},"reference-count":17,"publisher":"Wiley","issue":"2","license":[{"start":{"date-parts":[[2006,10,31]],"date-time":"2006-10-31T00:00:00Z","timestamp":1162252800000},"content-version":"vor","delay-in-days":4900,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Software Testing Verif &amp; Rel"],"published-print":{"date-parts":[[1993,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The utilization is described of a data flow path selection criterion in a symbolic execution system. The system automatically generates a subset of program paths according to a certain control flow criterion. This subset is called the ZOT\u2010subset, since it requires paths that traverse loops zero, one and two times. Experience indicates that traversing this subset of program paths is enough to cover most control flow and data flow components of the program. The problem with the ZOT\u2010subset is that it might contain, for large programs, a large number of paths. The number of paths in this subset can be reduced by concentrating on executable paths that cover vital components of programs such as data flow components. This object is achieved by employing a data flow path selection criterion in the system. The system symbolically executes the paths of the ZOT\u2010subset, and creates a system of branch conditions for each one. The user determines infeasible paths by checking the consistency of each system of conditions. The system selects feasible paths from the ZOT\u2010subset that cover the data flow criterion. Solving the systems of conditions of the selected paths provides the user with test data to fulfil the given data flow criterion.<\/jats:p>","DOI":"10.1002\/stvr.4370030205","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T15:58:37Z","timestamp":1163779117000},"page":"101-112","source":"Crossref","is-referenced-by-count":6,"title":["Using symbolic execution and data flow criteria to aid test data selection"],"prefix":"10.1002","volume":"3","author":[{"given":"Moheb R.","family":"Girgis","sequence":"first","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,31]]},"reference":[{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/360018.360025"},{"key":"e_1_2_1_3_1","doi-asserted-by":"crossref","unstructured":"Boyer R. S. Elspas B.andLevitt K. N.(1975) \u2018SELECT\u2014a formal system for testing and debugging programs by symbolic execution\u2019 Proceedings of the International Conference on Reliable Software pp.234\u2013245.","DOI":"10.1145\/390016.808445"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1976.233817"},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1049\/sej.1988.0029"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.6194"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1049\/sej.1992.0029"},{"key":"e_1_2_1_8_1","unstructured":"Girgis M. R.andWoodward M. R.(1985a ) \u2018An integrated system for program testing using weak mutation and data flow analysis\u2019 Technical Report 85\/1 Department of Computer Science University ofLiverpool U. K."},{"key":"e_1_2_1_9_1","unstructured":"Girgis M. R.andWoodward M. R.(1985b ) \u2018An integrated system for program testing using weak mutation and data flow analysis\u2019 Proceedings of Eighth International Conference on Software Engineering IEEE Computer Society pp.313\u2013319."},{"key":"e_1_2_1_10_1","unstructured":"Hedley D.andHennell M. A.(1985) \u2018The causes and effects of infeasible paths in computer programs\u2019 Proceedings of Eighth International Conference on Software Engineering IEEE Computer Society pp.259\u2013266."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1109\/T-C.1975.224259"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1977.231144"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1979.234184"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/30.1.63"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/360248.360252"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/52.1996"},{"key":"e_1_2_1_17_1","unstructured":"Rapps S.andWeyuker E. J.(1982) \u2018Data flow analysis techniques for test data selection\u2019 Proceedings of Sixth International Conference on Software Engineering IEEE Computer Society pp.272\u2013278."},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1985.232226"}],"container-title":["Software Testing, Verification and Reliability"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fstvr.4370030205","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/stvr.4370030205","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,10,25]],"date-time":"2023-10-25T09:21:26Z","timestamp":1698225686000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/stvr.4370030205"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1993,6]]},"references-count":17,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1993,6]]}},"alternative-id":["10.1002\/stvr.4370030205"],"URL":"https:\/\/doi.org\/10.1002\/stvr.4370030205","archive":["Portico"],"relation":{},"ISSN":["0960-0833","1099-1689"],"issn-type":[{"value":"0960-0833","type":"print"},{"value":"1099-1689","type":"electronic"}],"subject":[],"published":{"date-parts":[[1993,6]]}}}