{"id":"https://openalex.org/W4210272827","doi":"https://doi.org/10.1145/2070337.2070351","title":"Stack safe parallel recursion with paraffin","display_name":"Stack safe parallel recursion with paraffin","publication_year":2011,"publication_date":"2011-11-06","ids":{"openalex":"https://openalex.org/W4210272827","doi":"https://doi.org/10.1145/2070337.2070351"},"language":"en","primary_location":{"id":"doi:10.1145/2070337.2070351","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2070337.2070351","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM annual international conference on Special interest group on the ada programming language","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5042160264","display_name":"Bradley S. Moore","orcid":"https://orcid.org/0000-0002-4652-1253"},"institutions":[{"id":"https://openalex.org/I4210098945","display_name":"General Dynamics (Canada)","ror":"https://ror.org/0113m2308","country_code":"CA","type":"company","lineage":["https://openalex.org/I1343953105","https://openalex.org/I4210098945"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"Bradley J. Moore","raw_affiliation_strings":["General Dynamics Canada, Calgary, AB, Canada"],"affiliations":[{"raw_affiliation_string":"General Dynamics Canada, Calgary, AB, Canada","institution_ids":["https://openalex.org/I4210098945"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5042160264"],"corresponding_institution_ids":["https://openalex.org/I4210098945"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.38140689,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"27","last_page":"34"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9987000226974487,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.9872000217437744,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11005","display_name":"Radiation Effects in Electronics","score":0.9614999890327454,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/stack","display_name":"Stack (abstract data type)","score":0.9018243551254272},{"id":"https://openalex.org/keywords/call-stack","display_name":"Call stack","score":0.8733969926834106},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.8082756996154785},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7577279806137085},{"id":"https://openalex.org/keywords/subroutine","display_name":"Subroutine","score":0.7558640241622925},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6035022139549255},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.46031662821769714},{"id":"https://openalex.org/keywords/parallelism","display_name":"Parallelism (grammar)","score":0.43543633818626404},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3593626320362091}],"concepts":[{"id":"https://openalex.org/C9395851","wikidata":"https://www.wikidata.org/wiki/Q177929","display_name":"Stack (abstract data type)","level":2,"score":0.9018243551254272},{"id":"https://openalex.org/C119024030","wikidata":"https://www.wikidata.org/wiki/Q759899","display_name":"Call stack","level":3,"score":0.8733969926834106},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.8082756996154785},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7577279806137085},{"id":"https://openalex.org/C96147967","wikidata":"https://www.wikidata.org/wiki/Q190686","display_name":"Subroutine","level":2,"score":0.7558640241622925},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6035022139549255},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.46031662821769714},{"id":"https://openalex.org/C2781172179","wikidata":"https://www.wikidata.org/wiki/Q853109","display_name":"Parallelism (grammar)","level":2,"score":0.43543633818626404},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3593626320362091}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2070337.2070351","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2070337.2070351","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2011 ACM annual international conference on Special interest group on the ada programming language","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":3,"referenced_works":["https://openalex.org/W2082766671","https://openalex.org/W2172013743","https://openalex.org/W4245725014"],"related_works":["https://openalex.org/W2087972928","https://openalex.org/W3015514077","https://openalex.org/W2779721357","https://openalex.org/W1527172253","https://openalex.org/W4285328187","https://openalex.org/W3036335961","https://openalex.org/W2364824163","https://openalex.org/W1968278738","https://openalex.org/W3125263037","https://openalex.org/W4313648465"],"abstract_inverted_index":{"Recursion":[0],"is":[1,39,55,75],"a":[2,7,13,28,43,59,76,95,134,159],"programming":[3],"technique":[4,98,135],"in":[5,66],"which":[6],"solution":[8],"can":[9,23,82],"be":[10,24,112],"expressed":[11,25],"by":[12],"subroutine":[14],"invoking":[15],"itself":[16],"either":[17],"directly":[18],"or":[19],"indirectly.":[20],"Many":[21],"problems":[22],"simply":[26],"using":[27,37,133,186],"recursive":[29,60,88,107,167],"approach,":[30],"however":[31],"one":[32,47],"of":[33,36,78,91,125],"the":[34,92,106,120,123,166,174,187],"drawbacks":[35],"recursion":[38],"that":[40,81,105],"it":[41,146],"requires":[42],"stack,":[44],"and":[45,87,129,177],"often":[46,64,71],"does":[48],"not":[49],"know":[50],"how":[51,165],"much":[52],"stack":[53,117,127,131,141],"space":[54,128],"needed":[56],"to":[57,85,114,137,148,172,181],"obtain":[58],"result.":[61],"Stack":[62],"overflow":[63,132],"results":[65,185],"spectacular":[67],"failure":[68],"with":[69,153],"strange,":[70],"unrepeatable":[72],"behaviour.":[73],"Paraffin":[74,150],"suite":[77],"generic":[79],"units":[80],"add":[83],"parallelism":[84],"iterative":[86],"problems.":[89],"Some":[90],"generics":[93,121],"involve":[94],"load":[96,138],"balancing":[97],"described":[99],"as":[100],"\"work-seeking\".":[101],"It":[102],"was":[103,170],"found":[104],"work":[108],"seeking":[109],"algorithm":[110,169],"could":[111],"extended":[113,171],"also":[115,144],"provide":[116,173],"safety":[118,142],"whereby":[119],"monitor":[122],"amount":[124],"remaining":[126],"avoid":[130],"similar":[136],"balancing.":[139],"The":[140],"feature":[143],"makes":[145],"attractive":[147],"consider":[149],"for":[151,156],"use":[152],"code":[154],"destined":[155],"execution":[157],"on":[158,180],"single":[160],"core.":[161],"This":[162],"paper":[163],"describes":[164],"work-seeking":[168],"stack-safety":[175],"feature,":[176],"then":[178],"goes":[179],"report":[182],"some":[183],"performance":[184],"generics.":[188]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}