{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T00:26:35Z","timestamp":1648859195486},"reference-count":12,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1983,8,1]],"date-time":"1983-08-01T00:00:00Z","timestamp":428544000000},"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 Sciences"],"published-print":{"date-parts":[[1983,8]]},"DOI":"10.1016\/0020-0255(83)90002-6","type":"journal-article","created":{"date-parts":[[2003,6,30]],"date-time":"2003-06-30T17:28:37Z","timestamp":1056994117000},"page":"107-123","source":"Crossref","is-referenced-by-count":2,"title":["A formal methodology using attributed grammars for multiprocessing-system software development II. Validation"],"prefix":"10.1016","volume":"30","author":[{"given":"P.M.","family":"Lu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S.S.","family":"Yau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"W.","family":"Hong","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0020-0255(83)90002-6_BIB1","series-title":"Debugging Techniques in Large Systems","article-title":"Top down programming in large systems","author":"Mills","year":"1971"},{"issue":"2","key":"10.1016\/0020-0255(83)90002-6_BIB2","doi-asserted-by":"crossref","first-page":"162","DOI":"10.1109\/TSE.1980.230467","article-title":"Functional program testing","volume":"SE-6","author":"Howden","year":"1980","journal-title":"IEEE Trans. Software Engrg."},{"key":"10.1016\/0020-0255(83)90002-6_BIB3","series-title":"Proceedings of the Second International Conference on Software Engineering","first-page":"629","article-title":"atlas\u2014an automated software testing system","author":"Jessop","year":"1976"},{"issue":"5","key":"10.1016\/0020-0255(83)90002-6_BIB4","doi-asserted-by":"crossref","first-page":"279","DOI":"10.1145\/358855.358863","article-title":"Conversion of decision tables to efficient sequential testing procedures","volume":"23","author":"Sethi","year":"1980","journal-title":"Comm. ACM"},{"issue":"3","key":"10.1016\/0020-0255(83)90002-6_BIB5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1145\/356674.356677","article-title":"An introduction to proving the correctness of programs","volume":"8","author":"Hantler","year":"1976","journal-title":"ACM Comput. Surveys"},{"issue":"11","key":"10.1016\/0020-0255(83)90002-6_BIB6","doi-asserted-by":"crossref","first-page":"1331","DOI":"10.1109\/T-C.1971.223135","article-title":"Proving programs to be correct","volume":"C\u2013C20","author":"King","year":"1971","journal-title":"IEEE Trans. Comput."},{"key":"10.1016\/0020-0255(83)90002-6_BIB7","series-title":"Current Trends in Programming Methodology, Vol. 2, Program Validation","first-page":"173","article-title":"Proof techniques for hierarchically structured programs","author":"Robinson","year":"1977"},{"issue":"4","key":"10.1016\/0020-0255(83)90002-6_BIB8","doi-asserted-by":"crossref","first-page":"51","DOI":"10.1109\/C-M.1978.218139","article-title":"Applications of symbolic execution to program testing","volume":"11","author":"Darringer","year":"1978","journal-title":"IEEE Comput."},{"key":"10.1016\/0020-0255(83)90002-6_BIB9","series-title":"Ph.D. Thesis","article-title":"A systematic approach to the development and validation of software for critical applications","author":"Ho","year":"1978"},{"issue":"7","key":"10.1016\/0020-0255(83)90002-6_BIB10","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/360248.360252","article-title":"Symbolic execution and program testing","volume":"19","author":"King","year":"1976","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0255(83)90002-6_BIB11","unstructured":"A. Aho and J. Ullman, The Theory of Parsing, Translation, and Compiling, Volume 1: Parsing, Prentice-Hall."},{"issue":"12","key":"10.1016\/0020-0255(83)90002-6_BIB12","doi-asserted-by":"crossref","first-page":"697","DOI":"10.1145\/361227.361231","article-title":"The intrinsically exponential complexity of the circularity problem for attributed grammar","volume":"18","author":"Jazayeri","year":"1975","journal-title":"Comm. ACM"}],"container-title":["Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025583900026?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020025583900026?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,18]],"date-time":"2019-03-18T12:53:37Z","timestamp":1552913617000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020025583900026"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,8]]},"references-count":12,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,8]]}},"alternative-id":["0020025583900026"],"URL":"https:\/\/doi.org\/10.1016\/0020-0255(83)90002-6","relation":{},"ISSN":["0020-0255"],"issn-type":[{"value":"0020-0255","type":"print"}],"subject":[],"published":{"date-parts":[[1983,8]]}}}