{"id":"https://openalex.org/W4214858758","doi":"https://doi.org/10.1145/2103656.2103681","title":"Analysis of recursively parallel programs","display_name":"Analysis of recursively parallel programs","publication_year":2012,"publication_date":"2012-01-24","ids":{"openalex":"https://openalex.org/W4214858758","doi":"https://doi.org/10.1145/2103656.2103681"},"language":"en","primary_location":{"id":"doi:10.1145/2103656.2103681","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2103656.2103681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"},"type":"preprint","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/A5045477471","display_name":"Ahmed Bouajjani","orcid":"https://orcid.org/0000-0002-2060-3592"},"institutions":[{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":true,"raw_author_name":"Ahmed Bouajjani","raw_affiliation_strings":["Universit\u00e9 Paris Diderot, Paris, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris Diderot, Paris, France","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061209906","display_name":"Michael Emmi","orcid":"https://orcid.org/0009-0002-6283-5890"},"institutions":[{"id":"https://openalex.org/I169173203","display_name":"D\u00e9l\u00e9gation Paris 7","ror":"https://ror.org/00bw5n526","country_code":"FR","type":"government","lineage":["https://openalex.org/I154526488","https://openalex.org/I169173203"]},{"id":"https://openalex.org/I204730241","display_name":"Universit\u00e9 Paris Cit\u00e9","ror":"https://ror.org/05f82e368","country_code":"FR","type":"education","lineage":["https://openalex.org/I204730241"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Michael Emmi","raw_affiliation_strings":["Universit\u00e9 Paris Diderot, Paris, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris Diderot, Paris, France","institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5045477471"],"corresponding_institution_ids":["https://openalex.org/I169173203","https://openalex.org/I204730241"],"apc_list":null,"apc_paid":null,"fwci":1.34539522,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.83493458,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"203","last_page":"214"},"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.9998999834060669,"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.9998999834060669,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9990000128746033,"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/T10142","display_name":"Formal Methods in Verification","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.917525589466095},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.8266083002090454},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.803930401802063},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.720630407333374},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6920313239097595},{"id":"https://openalex.org/keywords/p","display_name":"P","score":0.583989679813385},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.5506736636161804},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5315924286842346},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.527011513710022},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4448108673095703},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.3827180564403534},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.3396325409412384},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.3185741901397705},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2644345760345459}],"concepts":[{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.917525589466095},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8266083002090454},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.803930401802063},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.720630407333374},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6920313239097595},{"id":"https://openalex.org/C134026603","wikidata":"https://www.wikidata.org/wiki/Q846354","display_name":"P","level":3,"score":0.583989679813385},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.5506736636161804},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5315924286842346},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.527011513710022},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4448108673095703},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.3827180564403534},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.3396325409412384},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.3185741901397705},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2644345760345459}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2103656.2103681","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2103656.2103681","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 39th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","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":26,"referenced_works":["https://openalex.org/W1563374799","https://openalex.org/W1605985842","https://openalex.org/W1678979457","https://openalex.org/W1967174286","https://openalex.org/W1983587324","https://openalex.org/W1995288535","https://openalex.org/W2031575609","https://openalex.org/W2039529128","https://openalex.org/W2055081868","https://openalex.org/W2060345611","https://openalex.org/W2079797513","https://openalex.org/W2080573945","https://openalex.org/W2087046173","https://openalex.org/W2087997226","https://openalex.org/W2101431901","https://openalex.org/W2109065830","https://openalex.org/W2114712579","https://openalex.org/W2145442181","https://openalex.org/W2147248565","https://openalex.org/W2156883715","https://openalex.org/W2184209356","https://openalex.org/W4211041421","https://openalex.org/W4230609379","https://openalex.org/W4242620488","https://openalex.org/W4301322018","https://openalex.org/W6650246241"],"related_works":["https://openalex.org/W2020140696","https://openalex.org/W2584984136","https://openalex.org/W2591956186","https://openalex.org/W1553002193","https://openalex.org/W1805200712","https://openalex.org/W1563786920","https://openalex.org/W1993478572","https://openalex.org/W2161984463","https://openalex.org/W2489809986","https://openalex.org/W2119045600"],"abstract_inverted_index":{"We":[0],"propose":[1,72],"a":[2,46],"general":[3],"formal":[4,33],"model":[5],"of":[6,54,64],"isolated":[7],"hierarchical":[8],"parallel":[9],"computations,":[10],"and":[11,28,71,85],"identify":[12],"several":[13],"fragments":[14],"to":[15,41],"match":[16],"the":[17,51,62,75],"concurrency":[18],"constructs":[19],"present":[20],"in":[21],"real-world":[22],"programming":[23],"languages":[24],"such":[25],"as":[26],"Cilk":[27],"X10.":[29],"By":[30],"associating":[31],"fundamental":[32],"models":[34],"(vector":[35],"addition":[36],"systems":[37],"with":[38,88],"recursive":[39,69,92],"transitions)":[40],"each":[42,58],"fragment,":[43],"we":[44,60],"provide":[45],"common":[47],"platform":[48],"for":[49,67,74,91],"exposing":[50],"relative":[52],"difficulties":[53],"algorithmic":[55],"reasoning.":[56],"For":[57],"case":[59],"measure":[61],"complexity":[63],"deciding":[65],"state-reachability":[66,90],"finite-data":[68],"programs,":[70],"algorithms":[73],"decidable":[76],"cases.":[77],"The":[78],"complexities":[79],"which":[80],"include":[81],"PTIME,":[82],"NP,":[83],"EXPSPACE,":[84],"2EXPTIME":[86],"contrast":[87],"undecidable":[89],"multi-threaded":[93],"programs.":[94]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2015,"cited_by_count":2},{"year":2013,"cited_by_count":2},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}