{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:12:57Z","timestamp":1699834377599},"reference-count":8,"publisher":"Wiley","issue":"4","license":[{"start":{"date-parts":[[2006,10,27]],"date-time":"2006-10-27T00:00:00Z","timestamp":1161907200000},"content-version":"vor","delay-in-days":10710,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1977,7]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Although overlaying code segments is a very old technique, there is very little literature <jats:sup>68<\/jats:sup> on what the ground rules are, what the options are and how to select an overlay structure. As a result, the facilities provided by most linkage editors are much poorer than they need be. In this paper we define the problem, give an algorithm for obtaining \u2018minimal\u2019 overlay structures and describe the surrounding commands and environment that are necessary to turn this algorithm into a practical tool.<\/jats:p>","DOI":"10.1002\/spe.4380070408","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T12:37:20Z","timestamp":1163767040000},"page":"493-500","source":"Crossref","is-referenced-by-count":2,"title":["Designing overlay structures"],"prefix":"10.1002","volume":"7","author":[{"given":"W. Morven","family":"Gentleman","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"J. Ian","family":"Munro","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","unstructured":"ANSI Standard Fortran USAS X3.9 1966."},{"key":"e_1_2_1_3_2","doi-asserted-by":"crossref","unstructured":"D. P.BovetandG.Estrin \u2018On static memory allocation in computer systems\u2019 IEEE Trans on Computers 492\u2013503.","DOI":"10.1109\/T-C.1970.222966"},{"key":"e_1_2_1_4_2","volume-title":"Introduction to Sequencing and Scheduling","author":"Baker K. R.","year":"1974"},{"key":"e_1_2_1_5_2","unstructured":"IBM System\/360 Operating System \u2018Linkage Editor and Loader\u2019 IBM SRL Form C28\u20106538\u20108 9th ed. (1969)."},{"key":"e_1_2_1_6_2","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4684-2001-2_9"},{"key":"e_1_2_1_7_2","doi-asserted-by":"publisher","DOI":"10.1145\/362896.362923"},{"key":"e_1_2_1_8_2","doi-asserted-by":"publisher","DOI":"10.1145\/361405.361407"},{"key":"e_1_2_1_9_2","doi-asserted-by":"publisher","DOI":"10.1145\/363626.363629"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380070408","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380070408","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T10:18:22Z","timestamp":1699784302000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380070408"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1977,7]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1977,7]]}},"alternative-id":["10.1002\/spe.4380070408"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380070408","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,7]]}}}