{"id":"https://openalex.org/W4242620488","doi":"https://doi.org/10.1145/1926385.1926443","title":"Complexity of pattern-based verification for multithreaded programs","display_name":"Complexity of pattern-based verification for multithreaded programs","publication_year":2011,"publication_date":"2011-01-24","ids":{"openalex":"https://openalex.org/W4242620488","doi":"https://doi.org/10.1145/1926385.1926443"},"language":"en","primary_location":{"id":"doi:10.1145/1926385.1926443","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1926385.1926443","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 annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","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/A5090378914","display_name":"Javier Esparza","orcid":"https://orcid.org/0000-0001-9862-4919"},"institutions":[{"id":"https://openalex.org/I62916508","display_name":"Technical University of Munich","ror":"https://ror.org/02kkvpp62","country_code":"DE","type":"education","lineage":["https://openalex.org/I62916508"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Javier Esparza","raw_affiliation_strings":["Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t M\u00fcnchen, M\u00fcnchen, Germany","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5030085363","display_name":"Pierre Ganty","orcid":"https://orcid.org/0000-0002-3625-6003"},"institutions":[{"id":"https://openalex.org/I4210162154","display_name":"IMDEA Software","ror":"https://ror.org/04xvfkh51","country_code":"ES","type":"facility","lineage":["https://openalex.org/I105140100","https://openalex.org/I4210162154"]}],"countries":["ES"],"is_corresponding":false,"raw_author_name":"Pierre Ganty","raw_affiliation_strings":["The IMDEA Software Institute, Madrid, Spain"],"affiliations":[{"raw_affiliation_string":"The IMDEA Software Institute, Madrid, Spain","institution_ids":["https://openalex.org/I4210162154"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090378914"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":2.1969,"has_fulltext":false,"cited_by_count":17,"citation_normalized_percentile":{"value":0.8827721,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"499","last_page":"510"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994000196456909,"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.9994000196456909,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9987999796867371,"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"}},{"id":"https://openalex.org/T11567","display_name":"semigroups and automata theory","score":0.9987000226974487,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7859244346618652},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.6741745471954346},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6591812968254089},{"id":"https://openalex.org/keywords/regular-expression","display_name":"Regular expression","score":0.5694411993026733},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.5047346353530884},{"id":"https://openalex.org/keywords/alphabet","display_name":"Alphabet","score":0.4994239807128906},{"id":"https://openalex.org/keywords/pattern-matching","display_name":"Pattern matching","score":0.4830206334590912},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4237300157546997},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3862159848213196},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.38303351402282715},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.33536678552627563},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.332889199256897}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7859244346618652},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.6741745471954346},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6591812968254089},{"id":"https://openalex.org/C121329065","wikidata":"https://www.wikidata.org/wiki/Q185612","display_name":"Regular expression","level":2,"score":0.5694411993026733},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.5047346353530884},{"id":"https://openalex.org/C112876837","wikidata":"https://www.wikidata.org/wiki/Q837518","display_name":"Alphabet","level":2,"score":0.4994239807128906},{"id":"https://openalex.org/C68859911","wikidata":"https://www.wikidata.org/wiki/Q1503724","display_name":"Pattern matching","level":2,"score":0.4830206334590912},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4237300157546997},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3862159848213196},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.38303351402282715},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.33536678552627563},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.332889199256897},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1926385.1926443","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1926385.1926443","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 annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":30,"referenced_works":["https://openalex.org/W1485572331","https://openalex.org/W1493367105","https://openalex.org/W1496958170","https://openalex.org/W1525605957","https://openalex.org/W1554834491","https://openalex.org/W1587449012","https://openalex.org/W1598142426","https://openalex.org/W1603445208","https://openalex.org/W1630184508","https://openalex.org/W1939061729","https://openalex.org/W1964874178","https://openalex.org/W2002089154","https://openalex.org/W2011039300","https://openalex.org/W2050426366","https://openalex.org/W2060345611","https://openalex.org/W2071228820","https://openalex.org/W2082000355","https://openalex.org/W2082494602","https://openalex.org/W2102924625","https://openalex.org/W2114616381","https://openalex.org/W2143502475","https://openalex.org/W2148778089","https://openalex.org/W2156883715","https://openalex.org/W2157148396","https://openalex.org/W2157390113","https://openalex.org/W2162593546","https://openalex.org/W2912538643","https://openalex.org/W4247858957","https://openalex.org/W4301322018","https://openalex.org/W4302339081"],"related_works":["https://openalex.org/W1774017438","https://openalex.org/W2123199373","https://openalex.org/W4246925412","https://openalex.org/W2083577879","https://openalex.org/W4205780093","https://openalex.org/W2052853109","https://openalex.org/W2964091527","https://openalex.org/W2109464334","https://openalex.org/W2031647786","https://openalex.org/W2807616588"],"abstract_inverted_index":{"Pattern-based":[0],"verification":[1,51,78,98,146],"checks":[2],"the":[3,6,18,24,32,35,40,47,114,117,121,127,130,133,136,151,159,162,185,195,200,203],"correctness":[4],"of":[5,20,23,34,49,119,123,129,135,153,161,173,187,194,202],"program":[7,21,61],"executions":[8],"that":[9,96,141],"follow":[10],"a":[11,14,107],"given":[12,38],"pattern,":[13,196],"regular":[15,174],"expression":[16],"over":[17],"alphabet":[19,33],"transitions":[22],"form":[25],"w1*":[26],"...":[27],"wn*.":[28],"For":[29],"multithreaded":[30,54,83,92],"programs,":[31],"pattern":[36,163],"is":[37,79,99],"by":[39,67],"synchronization":[41],"operations":[42],"between":[43],"threads.":[44],"We":[45,104,138],"study":[46,113],"complexity":[48,115],"pattern-based":[50,97,145],"for":[52,73,81,90,101,144],"abstracted":[53,82,91],"programs":[55,84],"in":[56,60,110,116,150,184,199],"which,":[57],"as":[58],"usual":[59],"analysis,":[62],"conditions":[63],"have":[64],"been":[65],"replaced":[66],"nondeterminism":[68],"(the":[69],"technique":[70],"works":[71],"also":[72],"boolean":[74],"programs).":[75],"While":[76],"unrestricted":[77],"undecidable":[80],"with":[85],"recursive":[86],"procedures":[87,124,155,189],"and":[88,132,176,192],"PSPACE-complete":[89],"while-programs,":[93],"we":[94,112,179],"show":[95,140],"NP-complete":[100],"both":[102],"classes.":[103],"then":[105],"conduct":[106],"multiparameter":[108],"analysis":[109],"which":[111],"number":[118,122,152,186],"threads,":[120,154,188],"per":[125,156,190],"thread,":[126,157,191],"size":[128,134,160,193,201],"procedures,":[131],"pattern.":[137],"first":[139],"no":[142],"algorithm":[143,182],"can":[147],"be":[148],"polynomial":[149,198],"or":[158],"(unless":[164],"P=NP).":[165],"Then,":[166],"using":[167],"recent":[168],"results":[169],"about":[170],"Parikh":[171],"images":[172],"languages":[175],"semilinear":[177],"sets,":[178],"present":[180],"an":[181],"exponential":[183],"but":[197],"procedures.":[204]},"counts_by_year":[{"year":2024,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2},{"year":2014,"cited_by_count":1},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}