{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,10,23]],"date-time":"2023-10-23T15:46:34Z","timestamp":1698075994338},"reference-count":23,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2000,1,1]],"date-time":"2000-01-01T00:00:00Z","timestamp":946684800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Information and Software Technology"],"published-print":{"date-parts":[[2000,1]]},"DOI":"10.1016\/s0950-5849(99)00052-x","type":"journal-article","created":{"date-parts":[[2002,7,25]],"date-time":"2002-07-25T15:07:29Z","timestamp":1027609649000},"page":"17-25","source":"Crossref","is-referenced-by-count":17,"title":["An optimal representative set selection method"],"prefix":"10.1016","volume":"42","author":[{"given":"J.G.","family":"Lee","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"C.G.","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/S0950-5849(99)00052-X_BIB1","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1016\/S0164-1212(96)00169-0","article-title":"An enhanced zero\u2013one optimal path set selection method","volume":"39","author":"Chung","year":"1997","journal-title":"Journal of Systems and Software"},{"issue":"5-6","key":"10.1016\/S0950-5849(99)00052-X_BIB2","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1016\/S0950-5849(98)00050-0","article-title":"A new heuristic for test suite reduction","volume":"40","author":"Chen","year":"1998","journal-title":"Information and Software Technology"},{"issue":"9","key":"10.1016\/S0950-5849(99)00052-X_BIB3","doi-asserted-by":"crossref","first-page":"900","DOI":"10.1109\/32.92910","article-title":"Constraint-based automatic test data generation","volume":"17","author":"DeMillo","year":"1991","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0950-5849(99)00052-X_BIB4","doi-asserted-by":"crossref","first-page":"29","DOI":"10.1002\/stvr.4370030104","article-title":"Employing static information in the generation of test cases","volume":"3","author":"Gupta","year":"1993","journal-title":"Software Testing, Verification and Reliability"},{"issue":"8","key":"10.1016\/S0950-5849(99)00052-X_BIB5","doi-asserted-by":"crossref","first-page":"870","DOI":"10.1109\/32.57624","article-title":"Automated software test data generation","volume":"16","author":"Korel","year":"1990","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"4","key":"10.1016\/S0950-5849(99)00052-X_BIB6","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1109\/TSE.1976.233835","article-title":"On the automated generation of program test data","volume":"2","author":"Ramamoorthy","year":"1976","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"10.1016\/S0950-5849(99)00052-X_BIB7","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1109\/32.48939","article-title":"Automated test case generation for programs specified by relational algebra queries","volume":"16","author":"Tsai","year":"1990","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"3","key":"10.1016\/S0950-5849(99)00052-X_BIB8","doi-asserted-by":"crossref","first-page":"270","DOI":"10.1145\/152388.152391","article-title":"A methodology for controlling the size of a test suite","volume":"2","author":"Harrold","year":"1993","journal-title":"ACM Transactions on Software Engineering and Methodology"},{"key":"10.1016\/S0950-5849(99)00052-X_BIB9","series-title":"Computer and intractability, a guide to the theory of NP-completeness","author":"Garey","year":"1979"},{"key":"10.1016\/S0950-5849(99)00052-X_BIB10","series-title":"Introduction to algorithms","author":"Cormen","year":"1990"},{"issue":"3","key":"10.1016\/S0950-5849(99)00052-X_BIB11","doi-asserted-by":"crossref","first-page":"256","DOI":"10.1016\/S0022-0000(74)80044-9","article-title":"Approximation algorithms for combinatorial problems","volume":"9","author":"Johnson","year":"1974","journal-title":"Journal of Computer and System Sciences"},{"key":"10.1016\/S0950-5849(99)00052-X_BIB12","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0164-1212(89)90062-9","article-title":"A generalized optimal path selection model for structural testing","volume":"July","author":"Wang","year":"1989","journal-title":"Journal of Systems and Software"},{"issue":"5","key":"10.1016\/S0950-5849(99)00052-X_BIB13","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1109\/TSE.1979.234213","article-title":"On path cover problems in digraphs and applications to program testing","volume":"SE-5","author":"Ntafos","year":"1979","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0950-5849(99)00052-X_BIB14","unstructured":"J.C. Lin, C.G. Chung, S.C. Lo, On path selection model for structural program testing, Proceedings of the Fifth IASTED International Symposium, 1989, pp. 69\u201372."},{"key":"10.1016\/S0950-5849(99)00052-X_BIB15","first-page":"618","article-title":"Zero\u2013one integer programming model in path selection problem of structural testing","volume":"November","author":"Lin","year":"1989","journal-title":"IEEE Proceeding COMPSAC 89"},{"key":"10.1016\/S0950-5849(99)00052-X_BIB16","unstructured":"B. Beizer, Software testing techniques, Data System Analysts Inc., Pennsanken, New Jersey, 1984."},{"key":"10.1016\/S0950-5849(99)00052-X_BIB17","first-page":"192","article-title":"Application of program graphs and software development and testing","volume":"August","author":"Schneidewind","year":"1979","journal-title":"IEEE Transactions on Software Engineering"},{"issue":"4","key":"10.1016\/S0950-5849(99)00052-X_BIB18","doi-asserted-by":"crossref","first-page":"308","DOI":"10.1109\/TSE.1976.233837","article-title":"Complexity measure","volume":"SE-2","author":"McCabe","year":"1976","journal-title":"IEEE Transactions on Software Engineering"},{"key":"10.1016\/S0950-5849(99)00052-X_BIB19","series-title":"Zero\u2013one integer programming","author":"Syslo","year":"1983"},{"key":"10.1016\/S0950-5849(99)00052-X_BIB20","series-title":"Introduction to operations research","author":"Hillier","year":"1990"},{"key":"10.1016\/S0950-5849(99)00052-X_BIB21","series-title":"User's manual for linear, integer, and quadratic programming with lindo release 5.0","author":"Schrage","year":"1991"},{"key":"10.1016\/S0950-5849(99)00052-X_BIB22","first-page":"421","article-title":"A test case selection method for the validation of software maintenance modifications","volume":"November","author":"Fischer","year":"1977","journal-title":"IEEE Proceeding COMPSAC77"},{"key":"10.1016\/S0950-5849(99)00052-X_BIB23","series-title":"A methodology for re-testing modified software, Proceeding of National Telecommunication Conference","author":"Fischer","year":"1981"}],"container-title":["Information and Software Technology"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S095058499900052X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S095058499900052X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,27]],"date-time":"2019-04-27T14:52:45Z","timestamp":1556376765000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S095058499900052X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2000,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2000,1]]}},"alternative-id":["S095058499900052X"],"URL":"https:\/\/doi.org\/10.1016\/s0950-5849(99)00052-x","relation":{},"ISSN":["0950-5849"],"issn-type":[{"value":"0950-5849","type":"print"}],"subject":[],"published":{"date-parts":[[2000,1]]}}}