{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T20:12:11Z","timestamp":1672258331201},"reference-count":18,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1985,8,1]],"date-time":"1985-08-01T00:00:00Z","timestamp":491702400000},"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":["Journal of Systems and Software"],"published-print":{"date-parts":[[1985,8]]},"DOI":"10.1016\/0164-1212(85)90020-2","type":"journal-article","created":{"date-parts":[[2003,8,8]],"date-time":"2003-08-08T04:49:55Z","timestamp":1060318195000},"page":"193-202","source":"Crossref","is-referenced-by-count":1,"title":["An optimistic implementation of the stack-heap"],"prefix":"10.1016","volume":"5","author":[{"given":"Jean R.Stephenson","family":"Blair","sequence":"first","affiliation":[]},{"given":"Phil","family":"Kearns","sequence":"additional","affiliation":[]},{"given":"Mary Lou","family":"Soffa","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0164-1212(85)90020-2_BIB1","year":"1982","journal-title":"Reference manual for the Ada programming language"},{"key":"10.1016\/0164-1212(85)90020-2_BIB2","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1007\/BF00975882","article-title":"Time Required for Reference Count Management in Retention Block-Structured Languages","volume":"7","author":"Berry","year":"1978","journal-title":"Intern. J. Computer Information Sci."},{"key":"10.1016\/0164-1212(85)90020-2_BIB3","article-title":"The Contraction of Control Implementations","author":"Coon","year":"1982"},{"key":"10.1016\/0164-1212(85)90020-2_BIB4","article-title":"SIMULA-67: Common Base Language","author":"Dahl","year":"1968"},{"key":"10.1016\/0164-1212(85)90020-2_BIB5","first-page":"155","article-title":"A Performance Analysis of the Implementation of Addressing Methods in Block-Structured Languages","volume":"C-31","author":"DePrycker","year":"1982","journal-title":"IEEETC"},{"key":"10.1016\/0164-1212(85)90020-2_BIB6","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1109\/MC.1979.1658691","article-title":"Architectural Efficiency Measures: an Overview of Three Studies","volume":"10","author":"Dietz","year":"1979","journal-title":"COMP"},{"key":"10.1016\/0164-1212(85)90020-2_BIB7","doi-asserted-by":"crossref","first-page":"24","DOI":"10.1109\/C-M.1977.217523","article-title":"Measurement and Evaluation of Alternative Computer Architectures","volume":"10","author":"Fuller","year":"1977","journal-title":"COMP"},{"key":"10.1016\/0164-1212(85)90020-2_BIB8","series-title":"The ICON Programming Language","author":"Griswold","year":"1983"},{"key":"10.1016\/0164-1212(85)90020-2_BIB9","series-title":"1985 International Ada Conference","first-page":"164","article-title":"The Efficiency of Storage Management Schemes for Ada Programs","author":"Gupta","year":"1985"},{"key":"10.1016\/0164-1212(85)90020-2_BIB10","first-page":"89","article-title":"Performance Evaluation of Control Implementations","volume":"SE-8","author":"Kearns","year":"1982","journal-title":"IEEETSE"},{"key":"10.1016\/0164-1212(85)90020-2_BIB11","first-page":"221","article-title":"The Implementation of Retention in a Coroutine Environment","volume":"19","author":"Kearns","year":"1983","journal-title":"ACTA"},{"key":"10.1016\/0164-1212(85)90020-2_BIB12","series-title":"IEEE Computer Society 1984 Conference on Ada Applications and Environments","first-page":"33","article-title":"An Efficient Evaluation Stack for Ada Tasking Programs","author":"Kearns","year":"1984"},{"key":"10.1016\/0164-1212(85)90020-2_BIB13","article-title":"Coroutine Pascal: A Case Study in Separable Control","author":"Lemon","year":"1976"},{"key":"10.1016\/0164-1212(85)90020-2_BIB14","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1145\/357139.357143","article-title":"Referencing and Retention in Block-Structured Coroutines","volume":"3","author":"Lindstrom","year":"1981","journal-title":"TOPLAS"},{"key":"10.1016\/0164-1212(85)90020-2_BIB15","series-title":"PROC 8th ARCH","first-page":"443","article-title":"RISC 1: A Reduced Instruction Set VLSI Computer","author":"Patterson","year":"1981"},{"key":"10.1016\/0164-1212(85)90020-2_BIB16","first-page":"189","article-title":"Coroutine Behavior and Implementation","volume":"10","author":"Pauli","year":"1980","journal-title":"SP&E"},{"key":"10.1016\/0164-1212(85)90020-2_BIB17","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1007\/BF00978377","article-title":"On the Efficient Implementation of Retention Block-Structured Languages","volume":"10","author":"Di Santo","year":"1981","journal-title":"Intern. J. Computer Information Sci."},{"key":"10.1016\/0164-1212(85)90020-2_BIB18","article-title":"From PLANNER to CONNIVER: A Genetic Approach","volume":"vol. 41","author":"Sussman","year":"1972"}],"container-title":["Journal of Systems and Software"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0164121285900202?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0164121285900202?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T02:54:57Z","timestamp":1552618497000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0164121285900202"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,8]]},"references-count":18,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1985,8]]}},"alternative-id":["0164121285900202"],"URL":"https:\/\/doi.org\/10.1016\/0164-1212(85)90020-2","relation":{},"ISSN":["0164-1212"],"issn-type":[{"value":"0164-1212","type":"print"}],"subject":[],"published":{"date-parts":[[1985,8]]}}}