{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,3]],"date-time":"2025-07-03T17:23:33Z","timestamp":1751563413847},"reference-count":16,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":10424,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1985]]},"DOI":"10.1016\/0304-3975(85)90090-8","type":"journal-article","created":{"date-parts":[[2003,5,13]],"date-time":"2003-05-13T04:04:58Z","timestamp":1052798698000},"page":"151-181","source":"Crossref","is-referenced-by-count":13,"special_numbering":"C","title":["A contribution to the theory of program testing"],"prefix":"10.1016","volume":"37","author":[{"given":"Luc","family":"Boug\u00e9","sequence":"first","affiliation":[]}],"member":"78","reference":[{"issue":"2","key":"10.1016\/0304-3975(85)90090-8_BIB1","doi-asserted-by":"crossref","first-page":"159","DOI":"10.1145\/356876.356879","article-title":"Validation, verification and testing of computer software","volume":"14","author":"Adrion","year":"1982","journal-title":"ACM Comput. Surveys"},{"key":"10.1016\/0304-3975(85)90090-8_BIB2","article-title":"Mod\u00e9lisation de la notion de test de programmes; application \u00e0 la production de jeux de test","author":"Boug\u00e9","year":"1982"},{"key":"10.1016\/0304-3975(85)90090-8_BIB3","doi-asserted-by":"crossref","DOI":"10.7146\/dpb.v12i160.7434","article-title":"A proposition for a theory of testing: an abstract approach to the testing process","author":"Boug\u00e9","year":"1983"},{"key":"10.1016\/0304-3975(85)90090-8_BIB4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/3-540-15199-0_17","article-title":"Application of PROLOG to test sets generation from algebraic specifications","volume":"186","author":"Boug\u00e9","year":"1985"},{"key":"10.1016\/0304-3975(85)90090-8_BIB5","series-title":"Computer Program Testing","first-page":"129","article-title":"Mutation analysis: ideas, examples, problems and prospects","author":"Budd","year":"1981"},{"key":"10.1016\/0304-3975(85)90090-8_BIB6","series-title":"Software Verification and Validation; Realistic Project Approaches","author":"Deutsch","year":"1982"},{"issue":"5","key":"10.1016\/0304-3975(85)90090-8_BIB7","doi-asserted-by":"crossref","DOI":"10.1145\/359488.359495","article-title":"Test data as an aid in proving program correctness","volume":"21","author":"Geller","year":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0304-3975(85)90090-8_BIB8","series-title":"Computing Systems Reliability","first-page":"66","article-title":"Program validation","author":"Gerhart","year":"1979"},{"issue":"6","key":"10.1016\/0304-3975(85)90090-8_BIB9","doi-asserted-by":"crossref","first-page":"495","DOI":"10.1145\/390016.808473","article-title":"Toward a theory of test data selection","volume":"10","author":"Goodenough","year":"1975","journal-title":"SIGPLAN Notices"},{"issue":"21","key":"10.1016\/0304-3975(85)90090-8_BIB10","doi-asserted-by":"crossref","first-page":"686","DOI":"10.1109\/TSE.1983.235433","article-title":"A mathematical framework for the investigation of testing","volume":"SE-9","author":"Gourlay","year":"1983","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0304-3975(85)90090-8_BIB11","series-title":"Proc. 5th Internat. Conf. Software Engrg.","first-page":"235","article-title":"Completeness criteria for testing elementary program functions","author":"Howden","year":"1981"},{"key":"10.1016\/0304-3975(85)90090-8_BIB12","article-title":"Tutorial: Software testing and validation techniques","author":"Miller","year":"1978","journal-title":"IEEE Catalog No. EH0 138-8"},{"key":"10.1016\/0304-3975(85)90090-8_BIB13","series-title":"Mathematical Logic","author":"Shoenfield","year":"1967"},{"key":"10.1016\/0304-3975(85)90090-8_BIB14","first-page":"44","article-title":"The oracle assumption of program testing","volume":"1","author":"Weyuker","year":"1980"},{"issue":"3","key":"10.1016\/0304-3975(85)90090-8_BIB15","doi-asserted-by":"crossref","first-page":"236","DOI":"10.1109\/TSE.1980.234485","article-title":"Theories of program testing and the application to revealing subdomains","volume":"SE-6","author":"Weyuker","year":"1980","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0304-3975(85)90090-8_BIB16","series-title":"Computer Program Testing","first-page":"103","article-title":"A domain strategy for computer program testing","author":"White","year":"1981"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900908?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397585900908?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,21]],"date-time":"2019-03-21T12:52:44Z","timestamp":1553172764000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397585900908"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985]]},"references-count":16,"alternative-id":["0304397585900908"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(85)90090-8","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1985]]}}}