{"id":"https://openalex.org/W7170136606","doi":"https://doi.org/10.1007/978-3-032-32519-8_6","title":"On the\u00a0Verification Problem of\u00a0Remote Direct Memory Access Programs","display_name":"On the\u00a0Verification Problem of\u00a0Remote Direct Memory Access Programs","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7170136606","doi":"https://doi.org/10.1007/978-3-032-32519-8_6"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-032-32519-8_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-32519-8_6","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-32519-8_6.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-32519-8_6.pdf","any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5002478680","display_name":"Parosh Aziz Abdulla","orcid":"https://orcid.org/0000-0001-6832-6611"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]},{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Parosh Aziz Abdulla","raw_affiliation_strings":["M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden","Uppsala University, Uppsala, Sweden"],"raw_orcid":"https://orcid.org/0000-0001-6832-6611","affiliations":[{"raw_affiliation_string":"M\u00e4lardalen University, V\u00e4ster\u00e5s, Sweden","institution_ids":["https://openalex.org/I82509713"]},{"raw_affiliation_string":"Uppsala University, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5047278328","display_name":"Mohamed Faouzi Atig","orcid":"https://orcid.org/0000-0001-8229-3481"},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":false,"raw_author_name":"Mohamed Faouzi Atig","raw_affiliation_strings":["Uppsala University, Uppsala, Sweden"],"raw_orcid":"https://orcid.org/0000-0001-8229-3481","affiliations":[{"raw_affiliation_string":"Uppsala University, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103030366","display_name":"R. Govind","orcid":"https://orcid.org/0000-0002-1634-5893"},"institutions":[{"id":"https://openalex.org/I59611059","display_name":"Institute of Mathematical Sciences","ror":"https://ror.org/05078rg59","country_code":"IN","type":"facility","lineage":["https://openalex.org/I59611059"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Govind Rajanbabu","raw_affiliation_strings":["The Institute of Mathematical Sciences (IMSc), Chennai, India"],"raw_orcid":"https://orcid.org/0000-0002-1634-5893","affiliations":[{"raw_affiliation_string":"The Institute of Mathematical Sciences (IMSc), Chennai, India","institution_ids":["https://openalex.org/I59611059"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5008674563","display_name":"Stephan Spengler","orcid":null},"institutions":[{"id":"https://openalex.org/I123387679","display_name":"Uppsala University","ror":"https://ror.org/048a87296","country_code":"SE","type":"education","lineage":["https://openalex.org/I123387679"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Stephan Spengler","raw_affiliation_strings":["Uppsala University, Uppsala, Sweden"],"raw_orcid":"https://orcid.org/0009-0009-5722-8843","affiliations":[{"raw_affiliation_string":"Uppsala University, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5008674563"],"corresponding_institution_ids":["https://openalex.org/I123387679"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":null,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"113","last_page":"135"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":null,"topics":[],"keywords":[{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.8665000200271606},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7254999876022339},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.6811000108718872},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5936999917030334},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5708000063896179},{"id":"https://openalex.org/keywords/sequential-consistency","display_name":"Sequential consistency","score":0.4918999969959259},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.42320001125335693},{"id":"https://openalex.org/keywords/pspace","display_name":"PSPACE","score":0.39149999618530273},{"id":"https://openalex.org/keywords/leverage","display_name":"Leverage (statistics)","score":0.3840999901294708}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8827000260353088},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.8665000200271606},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7254999876022339},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.6811000108718872},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5936999917030334},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5708000063896179},{"id":"https://openalex.org/C82029504","wikidata":"https://www.wikidata.org/wiki/Q4373882","display_name":"Sequential consistency","level":4,"score":0.4918999969959259},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4652000069618225},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.42320001125335693},{"id":"https://openalex.org/C197685441","wikidata":"https://www.wikidata.org/wiki/Q500716","display_name":"PSPACE","level":3,"score":0.39149999618530273},{"id":"https://openalex.org/C153083717","wikidata":"https://www.wikidata.org/wiki/Q6535263","display_name":"Leverage (statistics)","level":2,"score":0.3840999901294708},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3824000060558319},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.359499990940094},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.33320000767707825},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3158999979496002},{"id":"https://openalex.org/C130795937","wikidata":"https://www.wikidata.org/wiki/Q2561570","display_name":"Remote direct memory access","level":2,"score":0.30970001220703125},{"id":"https://openalex.org/C115988155","wikidata":"https://www.wikidata.org/wiki/Q3262192","display_name":"Decision problem","level":2,"score":0.30720001459121704},{"id":"https://openalex.org/C148230440","wikidata":"https://www.wikidata.org/wiki/Q1172264","display_name":"Datalog","level":2,"score":0.29660001397132874},{"id":"https://openalex.org/C56049555","wikidata":"https://www.wikidata.org/wiki/Q1276570","display_name":"EXPTIME","level":4,"score":0.29179999232292175},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2890999913215637},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.2867000102996826},{"id":"https://openalex.org/C22927095","wikidata":"https://www.wikidata.org/wiki/Q1784206","display_name":"Stateful firewall","level":3,"score":0.28380000591278076},{"id":"https://openalex.org/C3309909","wikidata":"https://www.wikidata.org/wiki/Q864155","display_name":"Binary decision diagram","level":2,"score":0.27480000257492065},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.2662999927997589},{"id":"https://openalex.org/C12186640","wikidata":"https://www.wikidata.org/wiki/Q6815743","display_name":"Memory model","level":3,"score":0.2619999945163727},{"id":"https://openalex.org/C34339311","wikidata":"https://www.wikidata.org/wiki/Q1050390","display_name":"C dynamic memory allocation","level":4,"score":0.257099986076355},{"id":"https://openalex.org/C105122174","wikidata":"https://www.wikidata.org/wiki/Q322202","display_name":"Garbage collection","level":3,"score":0.25450000166893005},{"id":"https://openalex.org/C122377713","wikidata":"https://www.wikidata.org/wiki/Q4422799","display_name":"Weak consistency","level":4,"score":0.25290000438690186}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1007/978-3-032-32519-8_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-32519-8_6","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-32519-8_6.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"}],"best_oa_location":{"id":"doi:10.1007/978-3-032-32519-8_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-032-32519-8_6","pdf_url":"https://link.springer.com/content/pdf/10.1007/978-3-032-32519-8_6.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7170136606.pdf","grobid_xml":"https://content.openalex.org/works/W7170136606.grobid-xml"},"referenced_works_count":24,"referenced_works":["https://openalex.org/W123460966","https://openalex.org/W149053240","https://openalex.org/W610090706","https://openalex.org/W1843585894","https://openalex.org/W1913137593","https://openalex.org/W1971332773","https://openalex.org/W1996760951","https://openalex.org/W2003227046","https://openalex.org/W2017315323","https://openalex.org/W2055081868","https://openalex.org/W2116976042","https://openalex.org/W2123601779","https://openalex.org/W2248727051","https://openalex.org/W2538440724","https://openalex.org/W2546693429","https://openalex.org/W2955045321","https://openalex.org/W3116914099","https://openalex.org/W3120705195","https://openalex.org/W4226367879","https://openalex.org/W4236206315","https://openalex.org/W4393954400","https://openalex.org/W4399872369","https://openalex.org/W4403223577","https://openalex.org/W4409970715"],"related_works":[],"abstract_inverted_index":{"Abstract":[0],"Remote":[1],"Direct":[2],"Memory":[3],"Access":[4],"(RDMA)":[5],"is":[6,36,61,100],"a":[7,67,81,107,119,123,134,157],"technology":[8],"that":[9,21,59,97,114,137,171],"allows":[10],"direct":[11],"memory":[12,16],"access":[13],"from":[14],"the":[15,49,71,84,88,153,162],"of":[17,22,70,122,164,173],"one":[18],"computer":[19,42],"into":[20],"another":[23],"without":[24],"involving":[25],"either":[26],"one\u2019s":[27],"operating":[28],"system.":[29],"This":[30],"enables":[31],"high-throughput,":[32],"low-latency":[33],"networking,":[34],"which":[35,78],"especially":[37],"useful":[38],"in":[39,63,142,152,161],"massively":[40],"parallel":[41],"clusters.":[43],"In":[44],"this":[45,98,129],"paper,":[46],"we":[47,168],"study":[48],"reachability":[50,60,141],"and":[51,90,95,156],"robustness":[52,111,139],"problems":[53],"for":[54,66,110],"RDMA":[55,89],"programs.":[56],"We":[57,73,126],"show":[58,170],"undecidable":[62],"general,":[64],"even":[65],"restricted":[68],"fragment":[69],"model.":[72],"then":[74,127],"focus":[75],"on":[76],"robustness,":[77],"asks":[79],"whether":[80],"program":[82,117],"exhibits":[83],"same":[85],"behaviours":[86],"under":[87],"sequential":[91],"consistency":[92],"(SC)":[93],"semantics,":[94],"prove":[96],"problem":[99],"decidable.":[101],"Our":[102],"central":[103],"technical":[104],"result":[105],"establishes":[106],"normal":[108,130],"form":[109,131],"violations,":[112],"showing":[113],"any":[115],"non-robust":[116],"admits":[118],"violating":[120],"execution":[121],"specific":[124],"form.":[125],"leverage":[128],"to":[132,140],"obtain":[133],"decision":[135],"procedure":[136],"reduces":[138],"finite-state":[143],"programs":[144],"with":[145],"counters,":[146],"yielding":[147],"an":[148],"ExpSpace":[149],"upper":[150,159],"bound":[151,160],"general":[154],"case,":[155],"PSpace":[158],"absence":[163],"poll":[165],"operations.":[166],"Finally,":[167],"also":[169],"both":[172],"these":[174],"bounds":[175],"are":[176],"optimal.":[177]},"counts_by_year":[],"updated_date":"2026-07-25T05:54:39.514286","created_date":"2026-07-24T00:00:00"}
