{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T00:06:38Z","timestamp":1699833998866},"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":11349,"URL":"http:\/\/onlinelibrary.wiley.com\/termsAndConditions#vor"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Softw Pract Exp"],"published-print":{"date-parts":[[1975,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A recent revival of interest in measuring program execution behaviour has led to a number of distinct approaches. Arguments are given for a fairly simple method of modifying FORTRAN source code to collect frequency counts. No symbol table is necessary and only a single reserved name is introduced into the source.<\/jats:p>","DOI":"10.1002\/spe.4380050405","type":"journal-article","created":{"date-parts":[[2006,11,17]],"date-time":"2006-11-17T13:54:44Z","timestamp":1163771684000},"page":"347-358","source":"Crossref","is-referenced-by-count":1,"title":["Simple transforms for instrumenting fortran decks"],"prefix":"10.1002","volume":"5","author":[{"given":"Gordon","family":"Lyon","sequence":"first","affiliation":[]},{"given":"Rona B.","family":"Stillman","sequence":"additional","affiliation":[]}],"member":"311","published-online":{"date-parts":[[2006,10,27]]},"reference":[{"key":"e_1_2_1_2_2","doi-asserted-by":"publisher","DOI":"10.1145\/1216456.1216458"},{"key":"e_1_2_1_3_2","first-page":"313","article-title":"Optimal measurement points for program frequency counts","volume":"13","author":"Knuth D. E.","year":"1973","journal-title":"B. I. T."},{"key":"e_1_2_1_4_2","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380030203"},{"key":"e_1_2_1_5_2","unstructured":"American National Standards Institute FORTRAN X0. 3.9\u20131966.(Available in the U. K. from the British Standards Institute.)"},{"key":"e_1_2_1_6_2","unstructured":"R. H.Hoffmann.Automated Verification System User's Guide TRW Note No. 72\u2013FMT\u20138 Project Apollo Task MSC\/TRW A\u2013527 1972."},{"key":"e_1_2_1_7_2","first-page":"107","volume-title":"Compiler Optimization","author":"Ingalls D.","year":"1972"},{"key":"e_1_2_1_8_2","doi-asserted-by":"crossref","unstructured":"G. E.Lyon.Static Language Analysis. National Bureau of Standards (U. S.) Technical Note 797 1973.","DOI":"10.6028\/NBS.TN.797"},{"key":"e_1_2_1_9_2","doi-asserted-by":"crossref","unstructured":"L. G.Stucki. \u2018A prototype automatic program testing tool\u2019 Proc. Fall Joint Comput. Conf.\/ Anaheim California 1972.","DOI":"10.1145\/1480083.1480106"}],"container-title":["Software: Practice and Experience"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.wiley.com\/onlinelibrary\/tdm\/v1\/articles\/10.1002%2Fspe.4380050405","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/pdf\/10.1002\/spe.4380050405","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,12]],"date-time":"2023-11-12T05:54:34Z","timestamp":1699768474000},"score":1,"resource":{"primary":{"URL":"https:\/\/onlinelibrary.wiley.com\/doi\/10.1002\/spe.4380050405"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1975,10]]},"references-count":8,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1975,10]]}},"alternative-id":["10.1002\/spe.4380050405"],"URL":"https:\/\/doi.org\/10.1002\/spe.4380050405","archive":["Portico"],"relation":{},"ISSN":["0038-0644","1097-024X"],"issn-type":[{"value":"0038-0644","type":"print"},{"value":"1097-024X","type":"electronic"}],"subject":[],"published":{"date-parts":[[1975,10]]}}}