{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,27]],"date-time":"2026-02-27T03:46:51Z","timestamp":1772164011688,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":9,"publisher":"ACM","license":[{"start":{"date-parts":[[2011,11,6]],"date-time":"2011-11-06T00:00:00Z","timestamp":1320537600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2011,11,6]]},"DOI":"10.1145\/2070337.2070351","type":"proceedings-article","created":{"date-parts":[[2011,11,21]],"date-time":"2011-11-21T14:55:03Z","timestamp":1321887303000},"page":"27-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["Stack safe parallel recursion with paraffin"],"prefix":"10.1145","author":[{"given":"Bradley J.","family":"Moore","sequence":"first","affiliation":[{"name":"General Dynamics Canada, Calgary, AB, Canada"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2011,11,6]]},"reference":[{"key":"e_1_3_2_1_1_1","series-title":"Sept 2011","volume-title":"http:\/\/sourceforge.net\/projects\/paraffin\/","author":"Moore B.","unstructured":"Moore B. , Paraffin , http:\/\/sourceforge.net\/projects\/paraffin\/ ( Sept 2011 ) Moore B., Paraffin, http:\/\/sourceforge.net\/projects\/paraffin\/ (Sept 2011)"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879063.1879078"},{"key":"e_1_3_2_1_3_1","volume":"32","author":"Moore B.","year":"2005","unstructured":"Moore B. , A comparison of work-sharing, work-seeking, and work-stealing parallelism strategies using Paraffin with Ada 2005 . Ada User Journal Volume 32 , Number 1, March 2011 Moore B., A comparison of work-sharing, work-seeking, and work-stealing parallelism strategies using Paraffin with Ada 2005. Ada User Journal Volume 32, Number 1, March 2011","journal-title":"Ada User Journal"},{"key":"e_1_3_2_1_4_1","volume-title":"ISBN 1--55860--253--4 Morgan Kaufmann Publishers","author":"Fox G.","year":"1994","unstructured":"Fox , G. , Williams , R. , Messina G. , Parallel Computing Works! , ISBN 1--55860--253--4 Morgan Kaufmann Publishers , Inc . 1994 Fox, G., Williams, R., Messina G., Parallel Computing Works!, ISBN 1--55860--253--4 Morgan Kaufmann Publishers, Inc. 1994"},{"key":"e_1_3_2_1_5_1","volume-title":"Consolidated Ada Reference Manual. LNCS 2219","author":"Taft S.T.","year":"2000","unstructured":"Taft , S.T. , Duff , R. A. , Brukardt , R.L. And Pl\u00f6dereder , E. Eds ( 2000 ). Consolidated Ada Reference Manual. LNCS 2219 , Springer-Verlag Taft, S.T., Duff, R. A., Brukardt, R.L. And Pl\u00f6dereder, E. Eds (2000). Consolidated Ada Reference Manual. LNCS 2219, Springer-Verlag"},{"key":"e_1_3_2_1_6_1","unstructured":"Walker J. Red Black Trees http:\/\/www.eternallyconfuzzled.com\/tuts\/datastructures\/jsw_tut_rbtree.aspx (Aug 2010)  Walker J. Red Black Trees http:\/\/www.eternallyconfuzzled.com\/tuts\/datastructures\/jsw_tut_rbtree.aspx (Aug 2010)"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1583991.1584017"},{"key":"e_1_3_2_1_8_1","volume-title":"Concurrent and Real-Time Programming in Ada","author":"Burns A.","year":"2007","unstructured":"Burns , A. , Wellings A. , Concurrent and Real-Time Programming in Ada , Cambridge University Press , 2007 Burns, A., Wellings A., Concurrent and Real-Time Programming in Ada, Cambridge University Press, 2007"},{"key":"e_1_3_2_1_9_1","series-title":"Sept 2010","volume-title":"Lawrence Livermore National Laboratory, https:\/\/computing.llnl.gov\/tutorials\/openMP\/#WorkSharing","author":"Barney Blaise","unstructured":"Barney Blaise , Lawrence Livermore National Laboratory, https:\/\/computing.llnl.gov\/tutorials\/openMP\/#WorkSharing ( Sept 2010 ) Barney Blaise, Lawrence Livermore National Laboratory, https:\/\/computing.llnl.gov\/tutorials\/openMP\/#WorkSharing (Sept 2010)"}],"event":{"name":"SIGAda '11: ACM SIGAda Annual International Conference","location":"Denver Colorado USA","acronym":"SIGAda '11","sponsor":["SIGAda ACM Special Interest Group on Ada Programming Language","SIGAPP ACM Special Interest Group on Applied Computing","SIGPLAN ACM Special Interest Group on Programming Languages","Ada Europe Ada Europe","SIGBED ACM Special Interest Group on Embedded Systems","SIGCAS ACM Special Interest Group on Computers and Society","SIGCSE ACM Special Interest Group on Computer Science Education"]},"container-title":["Proceedings of the 2011 ACM annual international conference on Special interest group on the ada programming language"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2070337.2070351","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2070337.2070351","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T05:54:52Z","timestamp":1750226092000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2070337.2070351"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011,11,6]]},"references-count":9,"alternative-id":["10.1145\/2070337.2070351","10.1145\/2070337"],"URL":"https:\/\/doi.org\/10.1145\/2070337.2070351","relation":{"is-identical-to":[{"id-type":"doi","id":"10.1145\/2070336.2070351","asserted-by":"object"}]},"subject":[],"published":{"date-parts":[[2011,11,6]]},"assertion":[{"value":"2011-11-06","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}