{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:06:53Z","timestamp":1699834013771},"reference-count":6,"publisher":"Wiley","issue":"3","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":10740,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1977,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>The theory of formal languages is applied to the systematic top\u2010down design of file processing programs. A methodology is described which leads to well structured programs for a large class of data processing problems. The method leads to more reliable programs because it is easier to check the method steps than an intuitive program. The method and its limitations are illustrated by the design process for some data processing programs. The limitations of the method are explained as the result of a theorem about formal languages.<\/jats:p>","DOI":"10.1002\/spe.4380070309","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T12:34:58Z","timestamp":1163766898000},"page":"371-381","source":"Crossref","is-referenced-by-count":2,"title":["The systematic design of file\u2010processing programs"],"prefix":"10.1002","volume":"7","author":[{"given":"D.","family":"Coleman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","first-page":"36","volume-title":"Techniques of Program Structure and Design","author":"Yourdon E.","year":"1975"},{"key":"e_1_2_1_3_2","doi-asserted-by":"publisher","DOI":"10.1145\/356635.356640"},{"key":"e_1_2_1_4_2","volume-title":"Formal Languages and their Relation to Automata","author":"Hopcroft J.","year":"1969"},{"key":"e_1_2_1_5_2","volume-title":"Algorithms + Data Structures = Programs","author":"Wirth N.","year":"1976"},{"key":"e_1_2_1_6_2","first-page":"97","volume-title":"Mathematical Theory of Context\u2010free Languages","author":"Ginsburg S.","year":"1965"},{"key":"e_1_2_1_7_2","volume-title":"Principles of Program Design","author":"Jackson M. A.","year":"1975"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380070309","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380070309","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T10:17:53Z","timestamp":1699784273000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380070309"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,6]]},"references-count":6,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1977,6]]}},"alternative-id":["10.1002\/spe.4380070309"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380070309","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1977,6]]}}}