{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,5]],"date-time":"2022-04-05T15:44:51Z","timestamp":1649173491933},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1989,6,1]],"date-time":"1989-06-01T00:00:00Z","timestamp":612662400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1989,6]]},"DOI":"10.1007\/bf01952678","type":"journal-article","created":{"date-parts":[[2005,7,29]],"date-time":"2005-07-29T03:27:25Z","timestamp":1122607645000},"page":"227-238","source":"Crossref","is-referenced-by-count":0,"title":["Automatically replacing indices into parallel arrays with pointers to records"],"prefix":"10.1007","volume":"29","author":[{"given":"Matti O.","family":"Jokinen","sequence":"first","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"BF01952678_CR1","doi-asserted-by":"crossref","first-page":"199","DOI":"10.1145\/356914.356917","volume":"15","author":"H. Partsch","year":"1983","unstructured":"H. Partsch and R. Steinbr\u00fcggen,Program transformation systems, ACM Computing Surveys15, 3, 199\u2013236 (1983).","journal-title":"ACM Computing Surveys"},{"key":"BF01952678_CR2","unstructured":"M. S. Feather,A survey and classification of some program transformation approaches and techniques, USC\/Information Sciences Institute (1986)."},{"issue":"6","key":"BF01952678_CR3","doi-asserted-by":"crossref","first-page":"138","DOI":"10.1145\/872738.807153","volume":"12","author":"A. Prudom","year":"1977","unstructured":"A. Prudom and M. A. Hennell,Some problems concerning the automatic translation of Fortran to Algol 68, SIGPLAN Notices12, 6, 138\u2013143 (1977).","journal-title":"SIGPLAN Notices"},{"issue":"7","key":"BF01952678_CR4","doi-asserted-by":"crossref","first-page":"717","DOI":"10.1002\/spe.4380110708","volume":"11","author":"R. A. Freak","year":"1981","unstructured":"R. A. Freak,A Fortran to Pascal translator, Software \u2014 Practice & Experience11, 7, 717\u2013732 (1981).","journal-title":"Software \u2014 Practice & Experience"},{"key":"BF01952678_CR5","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1137\/0204011","volume":"4","author":"E. A. Ashcroft","year":"1975","unstructured":"E. A. Ashcroft and Z. Manna,Translating program schemas to while-schemas, SIAM, J. Comput.4, 2, 125-146 (1975).","journal-title":"SIAM, J. Comput."},{"key":"BF01952678_CR6","doi-asserted-by":"crossref","first-page":"181","DOI":"10.1147\/rd.192.0181","volume":"19","author":"G. Urschler","year":"1975","unstructured":"G. Urschler,Automatic structuring of programs, IBM J. Res. Develop.19, 181\u2013194 (1975).","journal-title":"IBM J. Res. Develop."},{"key":"BF01952678_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"180","DOI":"10.1007\/3-540-07854-1_172","volume-title":"Mathematical Foundations of Programming","author":"E. S. Bainbridge","year":"1976","unstructured":"E. S. Bainbridge,Minimal while programs, Mathematical Foundations of Programming, Lecture Notes in Computer Science45, 180\u2013186, Springer-Verlag, Berlin (1976)."},{"issue":"1","key":"BF01952678_CR8","doi-asserted-by":"crossref","first-page":"98","DOI":"10.1145\/321992.321999","volume":"24","author":"B. S. Baker","year":"1977","unstructured":"B. S. Baker,An algorithm for structuring flowgraphs, J. ACM24, 1, 98\u2013120 (1977).","journal-title":"J. ACM"},{"issue":"2","key":"BF01952678_CR9","doi-asserted-by":"crossref","first-page":"161","DOI":"10.1093\/comjnl\/21.2.161","volume":"21","author":"M. H. Williams","year":"1978","unstructured":"M. H. Williams and H. L. Ossher,Conversion of unstructured flow diagrams to structured form, The Computer Journal21, 2, 161\u2013167 (1978).","journal-title":"The Computer Journal"},{"issue":"2","key":"BF01952678_CR10","doi-asserted-by":"crossref","first-page":"268","DOI":"10.1137\/0211021","volume":"11","author":"J. Keohane","year":"1982","unstructured":"J. Keohane, J. C. Cherniavsky and P. B. Henderson,On transforming control structures, SIAM J. Comput.11, 2, 268\u2013286 (1982).","journal-title":"SIAM J. Comput."},{"issue":"3","key":"BF01952678_CR11","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1093\/comjnl\/25.3.379","volume":"25","author":"G. Ouslman","year":"1982","unstructured":"G. Ouslman,Unraveling unstructured programs, The Computer Journal25, 3, 379\u2013387 (1982).","journal-title":"The Computer Journal"},{"key":"BF01952678_CR12","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1007\/3-540-15198-2_18","volume":"185","author":"U. Lichtblau","year":"1985","unstructured":"U. Lichtblau,Decompilation of control structures by means of graph transformations, Mathematical Foundations of Software Development, Proc. Conf. on Trees and Algebras in Programming, Berlin, Lecture Notes in Computer Science185, 284\u2013297, Springer-Verlag (1985).","journal-title":"Proc. Conf. on Trees and Algebras in Programming, Berlin, Lecture Notes in Computer Science"},{"key":"BF01952678_CR13","unstructured":"L. Ramshaw,Eliminating go to's while preserving program structure, Digital Systems Research Center (1985)."},{"key":"BF01952678_CR14","unstructured":"N. D. Jones and S. S. Muchnick,Binding time optimization in proramming languages: Some thoughts toward the design of an ideal language, 3rd ACM Symp. on Principles of Programming Languages, 77\u201394, Atlanta, Georgia (1976)."},{"issue":"3","key":"BF01952678_CR15","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/390017.808314","volume":"12","author":"P. Cousot","year":"1977","unstructured":"P. Cousot and R. Cousot,Static determination of dynamic properties of generalized type unions, Proc. ACM Conf. on Language Design for Reliable Software, SIGPLAN Notices12, 3, 77\u201394 (1977).","journal-title":"Proc. ACM Conf. on Language Design for Reliable Software, SIGPLAN Notices"},{"key":"BF01952678_CR16","doi-asserted-by":"crossref","unstructured":"P. Cousot and R. Cousot,Abstract interpretation: A unified lattice model for static analysis of programs by construction of approximation fixpoints, 4th ACM Symp. on Principles of Programming Languages, 238\u2013252 (1977).","DOI":"10.1145\/512950.512973"},{"issue":"1","key":"BF01952678_CR17","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1145\/322169.322181","volume":"27","author":"M. A. Kaplan","year":"1980","unstructured":"M. A. Kaplan and J. D. Ullman,A scheme for the automatic inference of variable types, J. ACM27, 1, 128\u2013145 (1980).","journal-title":"J. ACM"},{"key":"BF01952678_CR18","first-page":"102","volume-title":"Program Flow Analysis: Theory and Applications","author":"N. D. Jones","year":"1981","unstructured":"N. D. Jones and S. S. Muchnick,Flow-analysis and optimization of LISP-like structures, inProgram Flow Analysis: Theory and Applications, 102\u2013131, N. D. Jones and S. S. Muchnick (editors), Prentice-Hall, Englewood Cliffs, New Jersey (1981)."},{"issue":"2","key":"BF01952678_CR19","doi-asserted-by":"crossref","first-page":"126","DOI":"10.1145\/357133.357135","volume":"3","author":"E. Schonberg","year":"1981","unstructured":"E. Schonberg, J. T. Schwartz and M. Sharir,An automatic technique for selection of data representation in SETL programs, ACM Trans. Prog. Lang. Sys.3, 2, 126\u2013143 (1981).","journal-title":"ACM Trans. Prog. Lang. Sys."},{"key":"BF01952678_CR20","unstructured":"G. Weiss and E. Schonberg,Typefinding recursive structures: A data-flow analysis in the presence of infinite type sets, Proc. IEEE Int. Conf. on Computer Languages, 170\u2013181, Washington D.C. (1986)."},{"key":"BF01952678_CR21","unstructured":"Specification for Compuer Programming Language Pascal, report BS6192: 1982, British Standards Institution (1982)."}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01952678.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01952678\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01952678","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,13]],"date-time":"2019-05-13T13:14:26Z","timestamp":1557753266000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01952678"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,6]]},"references-count":21,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,6]]}},"alternative-id":["BF01952678"],"URL":"https:\/\/doi.org\/10.1007\/bf01952678","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1989,6]]}}}