{"id":"https://openalex.org/W7119539407","doi":"https://doi.org/10.1145/3776680","title":"Parametrised Verification of Intel-x86 Programs","display_name":"Parametrised Verification of Intel-x86 Programs","publication_year":2026,"publication_date":"2026-01-08","ids":{"openalex":"https://openalex.org/W7119539407","doi":"https://doi.org/10.1145/3776680"},"language":"en","primary_location":{"id":"doi:10.1145/3776680","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776680","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"diamond","oa_url":"https://doi.org/10.1145/3776680","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5122359563","display_name":"Parosh Aziz Abdulla","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"]},{"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":true,"raw_author_name":"Parosh Aziz Abdulla","raw_affiliation_strings":["Malardalen University, Vasteras, Sweden","Uppsala University, Uppsala, Sweden"],"affiliations":[{"raw_affiliation_string":"Malardalen University, Vasteras, 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/A5112057969","display_name":"Mohamed Faouzi Atig","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":false,"raw_author_name":"Mohamed Faouzi Atig","raw_affiliation_strings":["Uppsala University, Uppsala, Sweden"],"affiliations":[{"raw_affiliation_string":"Uppsala University, Uppsala, Sweden","institution_ids":["https://openalex.org/I123387679"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122349236","display_name":"Ahmed Bouajjani","orcid":null},"institutions":[{"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":"Ahmed Bouajjani","raw_affiliation_strings":["Universit\u00e9 Paris Cit\u00e9, Paris, France"],"affiliations":[{"raw_affiliation_string":"Universit\u00e9 Paris Cit\u00e9, Paris, France","institution_ids":["https://openalex.org/I204730241"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5122356931","display_name":"K. Narayan Kumar","orcid":null},"institutions":[{"id":"https://openalex.org/I19149307","display_name":"Chennai Mathematical Institute","ror":"https://ror.org/04zp24820","country_code":"IN","type":"education","lineage":["https://openalex.org/I19149307"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"K. Narayan Kumar","raw_affiliation_strings":["Chennai Mathematical Institute, Chennai, India"],"affiliations":[{"raw_affiliation_string":"Chennai Mathematical Institute, Chennai, India","institution_ids":["https://openalex.org/I19149307"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5122347179","display_name":"Prakash Saivasan","orcid":null},"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":"Prakash Saivasan","raw_affiliation_strings":["Institute of Mathematical Sciences, Chennai, India"],"affiliations":[{"raw_affiliation_string":"Institute of Mathematical Sciences, Chennai, India","institution_ids":["https://openalex.org/I59611059"]}]}],"institutions":[],"countries_distinct_count":3,"institutions_distinct_count":5,"corresponding_author_ids":["https://openalex.org/A5122359563"],"corresponding_institution_ids":["https://openalex.org/I123387679","https://openalex.org/I82509713"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.07852349,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":"10","issue":"POPL","first_page":"1094","last_page":"1122"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.7186999917030334,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.7186999917030334,"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"}},{"id":"https://openalex.org/T10772","display_name":"Distributed systems and fault tolerance","score":0.06430000066757202,"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/T10126","display_name":"Logic, programming, and type systems","score":0.05130000039935112,"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/decidability","display_name":"Decidability","score":0.8167999982833862},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7315000295639038},{"id":"https://openalex.org/keywords/reachability","display_name":"Reachability","score":0.7276999950408936},{"id":"https://openalex.org/keywords/reachability-problem","display_name":"Reachability problem","score":0.6381999850273132},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.5224000215530396},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.5038999915122986},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.41589999198913574},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.3853999972343445}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.8167999982833862},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7315000295639038},{"id":"https://openalex.org/C136643341","wikidata":"https://www.wikidata.org/wiki/Q1361526","display_name":"Reachability","level":2,"score":0.7276999950408936},{"id":"https://openalex.org/C2777669093","wikidata":"https://www.wikidata.org/wiki/Q17141570","display_name":"Reachability problem","level":3,"score":0.6381999850273132},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5935999751091003},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.5224000215530396},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.5038999915122986},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.45210000872612},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.41589999198913574},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.38830000162124634},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.3853999972343445},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.3610999882221222},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3610000014305115},{"id":"https://openalex.org/C2780069185","wikidata":"https://www.wikidata.org/wiki/Q7977945","display_name":"Equivalence (formal languages)","level":2,"score":0.35409998893737793},{"id":"https://openalex.org/C112505250","wikidata":"https://www.wikidata.org/wiki/Q787116","display_name":"Automaton","level":2,"score":0.3416999876499176},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.33079999685287476},{"id":"https://openalex.org/C24858836","wikidata":"https://www.wikidata.org/wiki/Q844718","display_name":"Theory of computation","level":2,"score":0.325300008058548},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2971000075340271},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.29679998755455017},{"id":"https://openalex.org/C184596265","wikidata":"https://www.wikidata.org/wiki/Q2651576","display_name":"Model of computation","level":3,"score":0.2955999970436096},{"id":"https://openalex.org/C29248071","wikidata":"https://www.wikidata.org/wiki/Q163310","display_name":"Turing machine","level":3,"score":0.2669999897480011},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2630999982357025},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.25119999051094055}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3776680","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776680","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},{"id":"pmh:oai:DiVA.org:uu-581710","is_oa":true,"landing_page_url":"http://urn.kb.se/resolve?urn=urn:nbn:se:uu:diva-581710","pdf_url":"https://uu.diva-portal.org/smash/get/diva2:2044824/FULLTEXT01","source":{"id":"https://openalex.org/S4306402042","display_name":"Uppsala University Publications (Uppsala University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I123387679","host_organization_name":"Uppsala University","host_organization_lineage":["https://openalex.org/I123387679"],"host_organization_lineage_names":[],"type":"repository"},"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"doi:10.1145/3776680","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3776680","pdf_url":null,"source":{"id":"https://openalex.org/S4210216081","display_name":"Proceedings of the ACM on Programming Languages","issn_l":"2475-1421","issn":["2475-1421"],"is_oa":true,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319798","host_organization_name":"Association for Computing Machinery","host_organization_lineage":["https://openalex.org/P4310319798"],"host_organization_lineage_names":["Association for Computing Machinery"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the ACM on Programming Languages","raw_type":"journal-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G600942417","display_name":"CENTEANES : Toward Correct-By-Design Serverless Applications","funder_award_id":"ANR-24-CE25-5598","funder_id":"https://openalex.org/F4320320883","funder_display_name":"Agence Nationale de la Recherche"},{"id":"https://openalex.org/G7800732931","display_name":null,"funder_award_id":"Science","funder_id":"https://openalex.org/F4320334771","funder_display_name":"Science and Engineering Research Board"},{"id":"https://openalex.org/G8794033089","display_name":null,"funder_award_id":"MTR/2022/000312","funder_id":"https://openalex.org/F4320334771","funder_display_name":"Science and Engineering Research Board"}],"funders":[{"id":"https://openalex.org/F4320320883","display_name":"Agence Nationale de la Recherche","ror":"https://ror.org/00rbzpz17"},{"id":"https://openalex.org/F4320322581","display_name":"Vetenskapsr\u00e5det","ror":"https://ror.org/03zttf063"},{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":33,"referenced_works":["https://openalex.org/W123460966","https://openalex.org/W149053240","https://openalex.org/W178720230","https://openalex.org/W296433066","https://openalex.org/W1530843743","https://openalex.org/W1598893746","https://openalex.org/W1913137593","https://openalex.org/W1916487582","https://openalex.org/W1967174286","https://openalex.org/W1971332773","https://openalex.org/W2050591418","https://openalex.org/W2054739713","https://openalex.org/W2085773946","https://openalex.org/W2123910665","https://openalex.org/W2248727051","https://openalex.org/W2955045321","https://openalex.org/W2955964099","https://openalex.org/W2963088485","https://openalex.org/W3033481492","https://openalex.org/W3100629122","https://openalex.org/W3114431693","https://openalex.org/W3116914099","https://openalex.org/W3117953372","https://openalex.org/W3138980809","https://openalex.org/W3205860735","https://openalex.org/W4200188844","https://openalex.org/W4226367879","https://openalex.org/W4286210018","https://openalex.org/W4312720686","https://openalex.org/W4366725767","https://openalex.org/W4384471299","https://openalex.org/W4390604697","https://openalex.org/W4399872369"],"related_works":[],"abstract_inverted_index":{"We":[0,20,186],"address":[1],"the":[2,16,22,55,124,143,146,155,159,218,229],"reachability":[3,150,204],"problem":[4,71,151],"for":[5,26,74,90,114],"concurrent":[6],"programs":[7],"with":[8],"an":[9],"arbitrary":[10],"number":[11,125,160,183],"of":[12,100,119,126,145,152,161,231,233],"threads":[13,127,162],"running":[14],"over":[15],"Intel":[17,27],"x-86":[18,28],"architecture.":[19],"consider":[21],"formal":[23],"model":[24,38],"eTSO":[25,75,153],"defined":[29],"by":[30],"Raad":[31],"et":[32,66],"al.":[33,67],"in":[34,49,54,76,154,205],"POPL":[35],"2022.":[36],"This":[37,216],"takes":[39],"into":[40],"account":[41],"multiple":[42],"memory":[43,60],"types":[44],"and":[45,57,107,130,199],"non-temporal":[46],"writes,":[47],"combining":[48],"a":[50,164,197],"complex":[51,201],"way":[52],"features":[53],"TSO":[56,101,104],"PSO":[58,108,111],"weak":[59],"models.":[61],"In":[62,138],"PLDI":[63],"2024,":[64],"Abdulla":[65],"proved":[68],"that":[69,79,123,166,188,210,221],"this":[70,120,139,194],"is":[72,81,128,163,173,190,217],"undecidable":[73],"general,":[77],"but":[78],"it":[80,176,189],"decidable":[82],"under":[83],"k":[84,94,98,147],"-alternation":[85,148],"bounding":[86],"when":[87,158],"computations":[88],"have,":[89],"some":[91],"fixed":[92],"bound":[93],",":[95],"at":[96],"most":[97],"alternations":[99],"segments":[102,109],"(with":[103,110],"writes":[105,112],"only)":[106,113],"each":[115],"thread.":[116],"The":[117,171],"proof":[118,172],"result":[121],"assumes":[122],"fixed,":[129],"relies":[131],"crucially":[132],"on":[133,208],"referring":[134],"to":[135,179,192,203,227],"thread":[136,180],"identities.":[137],"paper,":[140],"we":[141],"prove":[142,228],"decidability":[144,230],"bounded":[149],"parametrized":[156],"setting":[157],"parameter":[165],"can":[167],"be":[168],"arbitrarily":[169],"high.":[170],"nontrivial":[174],"as":[175],"cannot":[177],"refer":[178],"identities,":[181],"their":[182],"being":[184],"unbounded.":[185],"show":[187],"possible":[191],"overcome":[193],"difficulty":[195],"using":[196],"novel":[198],"quite":[200],"reduction":[202],"well-structured":[206,223],"systems":[207,224],"domains":[209],"are":[211,225],"BQOs":[212],"(Better":[213],"Quasi":[214],"Orders).":[215],"first":[219],"time":[220],"BQO-based":[222],"used":[226],"verification":[232],"infinite":[234],"state":[235],"programs.":[236]},"counts_by_year":[],"updated_date":"2026-04-10T15:06:20.359241","created_date":"2026-01-09T00:00:00"}