{"id":"https://openalex.org/W3137048298","doi":"https://doi.org/10.1145/3458593.3458595","title":"What is decidable under the TSO memory model?","display_name":"What is decidable under the TSO memory model?","publication_year":2020,"publication_date":"2020-10-01","ids":{"openalex":"https://openalex.org/W3137048298","doi":"https://doi.org/10.1145/3458593.3458595","mag":"3137048298"},"language":"en","primary_location":{"id":"doi:10.1145/3458593.3458595","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3458593.3458595","pdf_url":null,"source":{"id":"https://openalex.org/S4210221220","display_name":"ACM SIGLOG News","issn_l":"2372-3491","issn":["2372-3491"],"is_oa":false,"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":"ACM SIGLOG News","raw_type":"journal-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/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":true,"raw_author_name":"Mohamed Faouzi Atig","raw_affiliation_strings":["Uppsala University, Sweden"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Uppsala University, Sweden","institution_ids":["https://openalex.org/I123387679"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5047278328"],"corresponding_institution_ids":["https://openalex.org/I123387679"],"apc_list":null,"apc_paid":null,"fwci":0.1546,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.56599117,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":95},"biblio":{"volume":"7","issue":"4","first_page":"4","last_page":"19"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9997000098228455,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9991000294685364,"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.948835015296936},{"id":"https://openalex.org/keywords/liveness","display_name":"Liveness","score":0.891859769821167},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5885450839996338},{"id":"https://openalex.org/keywords/memory-model","display_name":"Memory model","score":0.49208730459213257},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.46441859006881714},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.40719643235206604},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.39493271708488464},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.36113303899765015},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.3372730612754822},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.16535764932632446},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.12430867552757263}],"concepts":[{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.948835015296936},{"id":"https://openalex.org/C15569618","wikidata":"https://www.wikidata.org/wiki/Q3561421","display_name":"Liveness","level":2,"score":0.891859769821167},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5885450839996338},{"id":"https://openalex.org/C12186640","wikidata":"https://www.wikidata.org/wiki/Q6815743","display_name":"Memory model","level":3,"score":0.49208730459213257},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.46441859006881714},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.40719643235206604},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.39493271708488464},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.36113303899765015},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3372730612754822},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.16535764932632446},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.12430867552757263}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3458593.3458595","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3458593.3458595","pdf_url":null,"source":{"id":"https://openalex.org/S4210221220","display_name":"ACM SIGLOG News","issn_l":"2372-3491","issn":["2372-3491"],"is_oa":false,"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":"ACM SIGLOG News","raw_type":"journal-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/11","display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W123460966","https://openalex.org/W149053240","https://openalex.org/W1525350307","https://openalex.org/W1624142974","https://openalex.org/W1967174286","https://openalex.org/W1971332773","https://openalex.org/W1987814265","https://openalex.org/W2054739713","https://openalex.org/W2085773946","https://openalex.org/W2121064036","https://openalex.org/W2123160677","https://openalex.org/W2123601779","https://openalex.org/W2480534701","https://openalex.org/W2490811891","https://openalex.org/W2501768731","https://openalex.org/W2505283763","https://openalex.org/W2546693429","https://openalex.org/W2766289313","https://openalex.org/W2996634758","https://openalex.org/W3009901397","https://openalex.org/W3100629122","https://openalex.org/W4247648311","https://openalex.org/W4251305355"],"related_works":["https://openalex.org/W2961758588","https://openalex.org/W3137048298","https://openalex.org/W3016701145","https://openalex.org/W2296248291","https://openalex.org/W4299446758","https://openalex.org/W4210984521","https://openalex.org/W1851153456","https://openalex.org/W4281769808","https://openalex.org/W2616106208","https://openalex.org/W2404201279"],"abstract_inverted_index":{"We":[0],"consider":[1],"the":[2,15,24,35],"verification":[3],"problem":[4,37],"of":[5,10],"safety":[6],"and":[7,31],"liveness":[8],"properties":[9],"finite-state":[11],"programs":[12],"running":[13],"under":[14],"Total":[16],"Store":[17],"Ordering":[18],"(TSO)":[19],"memory":[20],"model.We":[21],"first":[22],"review":[23],"decidability/complexity":[25],"results":[26],"regarding":[27],"these":[28],"two":[29],"problems":[30],"then":[32],"show":[33],"that":[34],"termination":[36],"is":[38],"decidable.":[39]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2024,"cited_by_count":1},{"year":2023,"cited_by_count":1}],"updated_date":"2026-05-21T06:26:12.895304","created_date":"2025-10-10T00:00:00"}