{"id":"https://openalex.org/W2408061912","doi":"https://doi.org/10.1145/2889160.2891042","title":"Maximally stateless model checking for concurrent bugs under relaxed memory models","display_name":"Maximally stateless model checking for concurrent bugs under relaxed memory models","publication_year":2016,"publication_date":"2016-05-14","ids":{"openalex":"https://openalex.org/W2408061912","doi":"https://doi.org/10.1145/2889160.2891042","mag":"2408061912"},"language":"en","primary_location":{"id":"doi:10.1145/2889160.2891042","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2889160.2891042","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th International Conference on Software Engineering Companion","raw_type":"proceedings-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/A5104069950","display_name":"Alan Huang","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Alan Huang","raw_affiliation_strings":["Texas A&M University"],"affiliations":[{"raw_affiliation_string":"Texas A&M University","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5104069950"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2613,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.77938687,"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":"686","last_page":"688"},"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9997000098228455,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9988999962806702,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8397053480148315},{"id":"https://openalex.org/keywords/memory-model","display_name":"Memory model","score":0.766403317451477},{"id":"https://openalex.org/keywords/stateless-protocol","display_name":"Stateless protocol","score":0.7363213300704956},{"id":"https://openalex.org/keywords/consistency-model","display_name":"Consistency model","score":0.7170113325119019},{"id":"https://openalex.org/keywords/sequential-consistency","display_name":"Sequential consistency","score":0.6971093416213989},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.6662448644638062},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.6546595096588135},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.5779725313186646},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.5446473956108093},{"id":"https://openalex.org/keywords/concurrent-data-structure","display_name":"Concurrent data structure","score":0.5122105479240417},{"id":"https://openalex.org/keywords/concurrency","display_name":"Concurrency","score":0.4561462104320526},{"id":"https://openalex.org/keywords/linearizability","display_name":"Linearizability","score":0.4172772765159607},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3715008497238159},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2930246591567993},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.09691622853279114}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8397053480148315},{"id":"https://openalex.org/C12186640","wikidata":"https://www.wikidata.org/wiki/Q6815743","display_name":"Memory model","level":3,"score":0.766403317451477},{"id":"https://openalex.org/C103613024","wikidata":"https://www.wikidata.org/wiki/Q230924","display_name":"Stateless protocol","level":3,"score":0.7363213300704956},{"id":"https://openalex.org/C37279795","wikidata":"https://www.wikidata.org/wiki/Q2492305","display_name":"Consistency model","level":3,"score":0.7170113325119019},{"id":"https://openalex.org/C82029504","wikidata":"https://www.wikidata.org/wiki/Q4373882","display_name":"Sequential consistency","level":4,"score":0.6971093416213989},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.6662448644638062},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.6546595096588135},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.5779725313186646},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.5446473956108093},{"id":"https://openalex.org/C203222032","wikidata":"https://www.wikidata.org/wiki/Q5159104","display_name":"Concurrent data structure","level":3,"score":0.5122105479240417},{"id":"https://openalex.org/C193702766","wikidata":"https://www.wikidata.org/wiki/Q1414548","display_name":"Concurrency","level":2,"score":0.4561462104320526},{"id":"https://openalex.org/C20528329","wikidata":"https://www.wikidata.org/wiki/Q513932","display_name":"Linearizability","level":3,"score":0.4172772765159607},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3715008497238159},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2930246591567993},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.09691622853279114}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2889160.2891042","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2889160.2891042","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 38th International Conference on Software Engineering Companion","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1525350307","https://openalex.org/W1877513498","https://openalex.org/W1887412317","https://openalex.org/W1971332773","https://openalex.org/W2024875714","https://openalex.org/W2036316394","https://openalex.org/W2051016152","https://openalex.org/W2054739713","https://openalex.org/W2065675749","https://openalex.org/W2169870841","https://openalex.org/W2998259759","https://openalex.org/W4251305355"],"related_works":["https://openalex.org/W2114925953","https://openalex.org/W1524796877","https://openalex.org/W4293643739","https://openalex.org/W1739259251","https://openalex.org/W4298289311","https://openalex.org/W3037400639","https://openalex.org/W4300963581","https://openalex.org/W2481004494","https://openalex.org/W136533073","https://openalex.org/W2408061912"],"abstract_inverted_index":{"Shared-memory":[0],"multiprocessor":[1],"architectures":[2],"are":[3],"now":[4],"ubiq-uitous.":[5],"To":[6],"achieve":[7],"higher":[8],"performance,":[9],"the":[10,13,36,51,57,60,65,70,73,79,88,103,111,124,146],"constraints":[11],"on":[12],"memory":[14,39,77,122,138],"models":[15],"become":[16],"weaker.":[17],"This":[18],"makes":[19],"it":[20,45],"more":[21,83],"challenging":[22,47],"to":[23,49,136],"verify":[24,50],"concurrent":[25,54],"programs.":[26],"It":[27],"is":[28,35,46,82,96],"known":[29],"that":[30],"sequential":[31],"consistency":[32],"(SC)":[33],"[7]":[34],"most":[37],"intuitive":[38],"model.":[40],"However,":[41],"even":[42,97],"for":[43,110],"SC,":[44],"enough":[48],"correctness":[52],"of":[53,59,67,72,105],"programs,":[55],"because":[56,85],"number":[58,66],"interleavings":[61],"grows":[62],"exponentially":[63],"with":[64],"threads":[68],"and":[69,94,117,129],"size":[71],"program.":[74],"For":[75,108],"relaxed":[76],"models,":[78,123],"verification":[80],"problem":[81],"tough":[84],"operations":[86,104],"from":[87],"same":[89],"thread":[90],"can":[91,141],"be":[92,142],"re-ordered":[93,143],"there":[95],"no":[98],"globally":[99],"consistent":[100],"order":[101,125],"among":[102],"different":[106,137],"threads.":[107],"example,":[109],"Total":[112],"Store":[113,119],"Order":[114,120],"(TSO)":[115],"[9]":[116],"Partial":[118],"(PSO)":[121],"between":[126],"a":[127,130,134],"write":[128,135],"following":[131],"read":[132],"or":[133],"locations":[139],"[2]":[140],"non-deterministically":[144],"in":[145],"store":[147],"buffer.":[148]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}