{"id":"https://openalex.org/W4248180460","doi":"https://doi.org/10.1109/fmcad.2014.6987612","title":"Reduction for compositional verification of multi-threaded programs","display_name":"Reduction for compositional verification of multi-threaded programs","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W4248180460","doi":"https://doi.org/10.1109/fmcad.2014.6987612"},"language":"en","primary_location":{"id":"doi:10.1109/fmcad.2014.6987612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2014.6987612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","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/A5036625175","display_name":"Corneliu Popeea","orcid":null},"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":"Corneliu Popeea","raw_affiliation_strings":["Technische Universit\u00e4t, M\u00fcnchen"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t, M\u00fcnchen","institution_ids":["https://openalex.org/I62916508"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5044737952","display_name":"Andrey Rybalchenko","orcid":null},"institutions":[{"id":"https://openalex.org/I4210164937","display_name":"Microsoft Research (United Kingdom)","ror":"https://ror.org/05k87vq12","country_code":"GB","type":"company","lineage":["https://openalex.org/I1290206253","https://openalex.org/I4210164937"]},{"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","GB"],"is_corresponding":false,"raw_author_name":"Andrey Rybalchenko","raw_affiliation_strings":["Microsoft Research Cambridge and Technische Universit\u00e4t, M\u00fcnchen"],"affiliations":[{"raw_affiliation_string":"Microsoft Research Cambridge and Technische Universit\u00e4t, M\u00fcnchen","institution_ids":["https://openalex.org/I4210164937","https://openalex.org/I62916508"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5024053755","display_name":"Andreas Wilhelm","orcid":null},"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":false,"raw_author_name":"Andreas Wilhelm","raw_affiliation_strings":["Technische Universit\u00e4t, M\u00fcnchen"],"affiliations":[{"raw_affiliation_string":"Technische Universit\u00e4t, M\u00fcnchen","institution_ids":["https://openalex.org/I62916508"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5036625175"],"corresponding_institution_ids":["https://openalex.org/I62916508"],"apc_list":null,"apc_paid":null,"fwci":1.0682,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.80159801,"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":"187","last_page":"194"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998000264167786,"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.9998000264167786,"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.9994999766349792,"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9973000288009644,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"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.8139859437942505},{"id":"https://openalex.org/keywords/thread","display_name":"Thread (computing)","score":0.6686252355575562},{"id":"https://openalex.org/keywords/reduction","display_name":"Reduction (mathematics)","score":0.5927720069885254},{"id":"https://openalex.org/keywords/automation","display_name":"Automation","score":0.5749572515487671},{"id":"https://openalex.org/keywords/horn-clause","display_name":"Horn clause","score":0.5297271609306335},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.500866174697876},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.4584069550037384},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4453220069408417},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.41052109003067017},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.35845810174942017},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.12150734663009644},{"id":"https://openalex.org/keywords/logic-programming","display_name":"Logic programming","score":0.08810627460479736}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8139859437942505},{"id":"https://openalex.org/C138101251","wikidata":"https://www.wikidata.org/wiki/Q213092","display_name":"Thread (computing)","level":2,"score":0.6686252355575562},{"id":"https://openalex.org/C111335779","wikidata":"https://www.wikidata.org/wiki/Q3454686","display_name":"Reduction (mathematics)","level":2,"score":0.5927720069885254},{"id":"https://openalex.org/C115901376","wikidata":"https://www.wikidata.org/wiki/Q184199","display_name":"Automation","level":2,"score":0.5749572515487671},{"id":"https://openalex.org/C189790780","wikidata":"https://www.wikidata.org/wiki/Q933932","display_name":"Horn clause","level":3,"score":0.5297271609306335},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.500866174697876},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.4584069550037384},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4453220069408417},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.41052109003067017},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.35845810174942017},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.12150734663009644},{"id":"https://openalex.org/C128838566","wikidata":"https://www.wikidata.org/wiki/Q275603","display_name":"Logic programming","level":2,"score":0.08810627460479736},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.0},{"id":"https://openalex.org/C78519656","wikidata":"https://www.wikidata.org/wiki/Q101333","display_name":"Mechanical engineering","level":1,"score":0.0},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fmcad.2014.6987612","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2014.6987612","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2014 Formal Methods in Computer-Aided Design (FMCAD)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"display_name":"Peace, Justice and strong institutions","id":"https://metadata.un.org/sdg/16"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":27,"referenced_works":["https://openalex.org/W182717014","https://openalex.org/W190459065","https://openalex.org/W1547793878","https://openalex.org/W1565898282","https://openalex.org/W1566412221","https://openalex.org/W1568729458","https://openalex.org/W1964727056","https://openalex.org/W1973954352","https://openalex.org/W2039559802","https://openalex.org/W2072062729","https://openalex.org/W2080573945","https://openalex.org/W2082766667","https://openalex.org/W2090551028","https://openalex.org/W2125165081","https://openalex.org/W2145098440","https://openalex.org/W2155487709","https://openalex.org/W2158395308","https://openalex.org/W2158493209","https://openalex.org/W2164496154","https://openalex.org/W2169870841","https://openalex.org/W2172255864","https://openalex.org/W4235116491","https://openalex.org/W4236040576","https://openalex.org/W6632832244","https://openalex.org/W6633901605","https://openalex.org/W6681194197","https://openalex.org/W6683354071"],"related_works":["https://openalex.org/W4394650907","https://openalex.org/W4254119641","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W2576399385","https://openalex.org/W2963408011","https://openalex.org/W4236324517","https://openalex.org/W1586813864","https://openalex.org/W2184046398"],"abstract_inverted_index":{"Automated":[0],"verification":[1,76,103],"of":[2,8,13,31,38,63,66,70,77,91,105,129,137],"multi-threaded":[3,78,92],"programs":[4,79,93],"requires":[5],"keeping":[6],"track":[7],"a":[9],"very":[10],"large":[11],"number":[12],"possible":[14],"interactions":[15],"between":[16],"the":[17,28,61,64,74,127],"program":[18],"threads.":[19],"Different":[20],"reasoning":[21],"methods":[22],"have":[23],"been":[24,53],"proposed":[25],"that":[26,94,125],"alleviate":[27],"explicit":[29],"enumeration":[30],"all":[32],"thread":[33],"interleavings,":[34],"e.g.,":[35],"Lipton's":[36],"theory":[37,65],"reduction":[39,67],"or":[40],"Owicki-Gries":[41,98],"method":[42,107],"for":[43,68,73,87],"compositional":[44,100],"reasoning,":[45],"however":[46],"their":[47],"synergistic":[48],"interplay":[49],"has":[50],"not":[51],"yet":[52],"fully":[54],"explored.":[55],"In":[56],"this":[57],"paper":[58],"we":[59],"explore":[60],"applicability":[62],"pruning":[69],"equivalent":[71],"interleavings":[72],"automated":[75],"with":[80],"infinite-state":[81],"spaces.":[82],"We":[83,120],"propose":[84],"proof":[85],"rules":[86],"safety":[88],"and":[89],"termination":[90],"integrate":[95],"into":[96],"an":[97],"based":[99],"verifier.":[101],"The":[102],"conditions":[104],"our":[106,130],"are":[108],"Horn":[109,117],"clauses,":[110],"thus":[111],"facilitating":[112],"automation":[113],"by":[114],"using":[115],"off-the-shelf":[116],"clause":[118],"solvers.":[119],"present":[121],"preliminary":[122],"experimental":[123],"results":[124],"show":[126],"advantages":[128],"approach":[131],"when":[132],"compared":[133],"to":[134],"state-of-the-art":[135],"verifiers":[136],"C":[138],"programs.":[139]},"counts_by_year":[{"year":2024,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2},{"year":2016,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}