{"id":"https://openalex.org/W2963563308","doi":"https://doi.org/10.23919/fmcad.2017.8102243","title":"Safety verification of phaser programs","display_name":"Safety verification of phaser programs","publication_year":2017,"publication_date":"2017-10-01","ids":{"openalex":"https://openalex.org/W2963563308","doi":"https://doi.org/10.23919/fmcad.2017.8102243","mag":"2963563308"},"language":"en","primary_location":{"id":"doi:10.23919/fmcad.2017.8102243","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2017.8102243","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Formal Methods in Computer Aided Design (FMCAD)","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/A5056522239","display_name":"Zeinab Ganjei","orcid":null},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Zeinab Ganjei","raw_affiliation_strings":["Dept. of computer and information science, Link\u00f6ping University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of computer and information science, Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5087431438","display_name":"Ahmed Rezine","orcid":"https://orcid.org/0000-0002-0440-4753"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Ahmed Rezine","raw_affiliation_strings":["Dept. of computer and information science, Link\u00f6ping University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of computer and information science, Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5001844771","display_name":"Petru Eles","orcid":"https://orcid.org/0000-0001-8621-3346"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Petru Eles","raw_affiliation_strings":["Dept. of computer and information science, Link\u00f6ping University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of computer and information science, Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5003372884","display_name":"Zebo Peng","orcid":"https://orcid.org/0000-0002-5137-565X"},"institutions":[{"id":"https://openalex.org/I102134673","display_name":"Link\u00f6ping University","ror":"https://ror.org/05ynxx418","country_code":"SE","type":"education","lineage":["https://openalex.org/I102134673"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Zebo Peng","raw_affiliation_strings":["Dept. of computer and information science, Link\u00f6ping University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Dept. of computer and information science, Link\u00f6ping University, Sweden","institution_ids":["https://openalex.org/I102134673"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I102134673"],"apc_list":null,"apc_paid":null,"fwci":0.659,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.76200206,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"abs 1708 2801","issue":null,"first_page":"68","last_page":"75"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9998000264167786,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9997000098228455,"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.9995999932289124,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8694708347320557},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8311082124710083},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.5646620988845825},{"id":"https://openalex.org/keywords/deadlock","display_name":"Deadlock","score":0.5396392941474915},{"id":"https://openalex.org/keywords/synchronization","display_name":"Synchronization (alternating current)","score":0.504590630531311},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.49442172050476074},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4856890141963959},{"id":"https://openalex.org/keywords/assertion","display_name":"Assertion","score":0.48040392994880676},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.46362805366516113},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.46353602409362793},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.4576709270477295},{"id":"https://openalex.org/keywords/intersection","display_name":"Intersection (aeronautics)","score":0.4168529808521271},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.40153104066848755},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.23938772082328796},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.11094310879707336}],"concepts":[{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8694708347320557},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8311082124710083},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.5646620988845825},{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.5396392941474915},{"id":"https://openalex.org/C2778562939","wikidata":"https://www.wikidata.org/wiki/Q1298791","display_name":"Synchronization (alternating current)","level":3,"score":0.504590630531311},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.49442172050476074},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4856890141963959},{"id":"https://openalex.org/C40422974","wikidata":"https://www.wikidata.org/wiki/Q741248","display_name":"Assertion","level":2,"score":0.48040392994880676},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.46362805366516113},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.46353602409362793},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.4576709270477295},{"id":"https://openalex.org/C64543145","wikidata":"https://www.wikidata.org/wiki/Q162942","display_name":"Intersection (aeronautics)","level":2,"score":0.4168529808521271},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40153104066848755},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.23938772082328796},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.11094310879707336},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.0},{"id":"https://openalex.org/C127162648","wikidata":"https://www.wikidata.org/wiki/Q16858953","display_name":"Channel (broadcasting)","level":2,"score":0.0},{"id":"https://openalex.org/C146978453","wikidata":"https://www.wikidata.org/wiki/Q3798668","display_name":"Aerospace engineering","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.23919/fmcad.2017.8102243","is_oa":false,"landing_page_url":"https://doi.org/10.23919/fmcad.2017.8102243","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2017 Formal Methods in Computer Aided Design (FMCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Peace, Justice and strong institutions","score":0.8100000023841858,"id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W39961119","https://openalex.org/W1592314966","https://openalex.org/W1970787534","https://openalex.org/W1977899806","https://openalex.org/W2014528727","https://openalex.org/W2022530540","https://openalex.org/W2040060046","https://openalex.org/W2053840901","https://openalex.org/W2067953737","https://openalex.org/W2103560923","https://openalex.org/W2109065830","https://openalex.org/W2124682870","https://openalex.org/W2744328300","https://openalex.org/W2963563308","https://openalex.org/W3021255478","https://openalex.org/W4242946001"],"related_works":["https://openalex.org/W2529513861","https://openalex.org/W4361186044","https://openalex.org/W2388344305","https://openalex.org/W2884574904","https://openalex.org/W3138980809","https://openalex.org/W4253760428","https://openalex.org/W2949627086","https://openalex.org/W1596041124","https://openalex.org/W2047831585","https://openalex.org/W1571571632"],"abstract_inverted_index":{"We":[0,123,147,163,182],"address":[1],"the":[2,71,111],"problem":[3],"of":[4,13,27,46,70,113,119,142],"statically":[5],"checking":[6,134,176],"control":[7,135],"state":[8],"reachability":[9,23,136,152,178],"(as":[10,24],"in":[11,25,77,105,110],"possibility":[12],"assertion":[14],"violations,":[15],"race":[16],"conditions":[17],"or":[18,62,68],"runtime":[19,42,94],"errors)":[20],"and":[21,44,53,91,121,145,161],"plain":[22,151,177],"deadlock-freedom)":[26],"phaser":[28],"programs.":[29],"Phasers":[30,84],"are":[31,75],"a":[32,172],"modern":[33,78],"non-trivial":[34],"synchronization":[35,64],"construct":[36],"that":[37,130],"supports":[38],"dynamic":[39],"parallelism":[40],"with":[41,187],"registration":[43],"deregistration":[45],"spawned":[47],"tasks.":[48,73],"They":[49],"allow":[50],"for":[51,137,156,175],"collective":[52],"point-to-point":[54],"synchronizations.":[55],"For":[56],"instance,":[57],"phasers":[58],"can":[59],"enforce":[60],"barriers":[61],"producer-consumer":[63],"schemes":[65],"among":[66],"all":[67],"subsets":[69],"running":[72],"Implementations":[74],"found":[76],"languages":[79],"such":[80],"as":[81],"Habanero":[82],"Java.":[83],"essentially":[85],"associate":[86],"phases":[87,102],"to":[88,96,167],"individual":[89],"tasks":[90,120,144,160],"use":[92],"their":[93],"values":[95],"restrict":[97],"possible":[98],"concurrent":[99],"executions.":[100],"Unbounded":[101],"may":[103],"result":[104],"infinite":[106],"transition":[107],"systems":[108],"even":[109,155],"case":[112],"programs":[114,138,157],"only":[115],"creating":[116],"finite":[117],"numbers":[118,141],"phasers.":[122,146,162],"introduce":[124],"an":[125],"exact":[126],"gap-order":[127],"based":[128],"procedure":[129,170],"always":[131],"terminates":[132],"when":[133],"generating":[139,158],"bounded":[140],"coexisting":[143],"also":[148],"show":[149],"verifying":[150],"is":[153],"undecidable":[154],"few":[159],"then":[164],"explain":[165],"how":[166],"turn":[168],"our":[169,188],"into":[171],"sound":[173],"analysis":[174],"(including":[179],"deadlock":[180],"freedom).":[181],"report":[183],"on":[184],"preliminary":[185],"experiments":[186],"open":[189],"source":[190],"tool.":[191]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1}],"updated_date":"2026-06-26T08:34:08.712188","created_date":"2025-10-10T00:00:00"}