{"id":"https://openalex.org/W1999808671","doi":"https://doi.org/10.1145/2688500.2688520","title":"A parallel algorithm for global states enumeration in concurrent systems","display_name":"A parallel algorithm for global states enumeration in concurrent systems","publication_year":2015,"publication_date":"2015-01-24","ids":{"openalex":"https://openalex.org/W1999808671","doi":"https://doi.org/10.1145/2688500.2688520","mag":"1999808671"},"language":"en","primary_location":{"id":"doi:10.1145/2688500.2688520","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2688500.2688520","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","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/A5111475056","display_name":"Yen\u2010Jung Chang","orcid":null},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Yen-Jung Chang","raw_affiliation_strings":["University of Texas at Austin, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5061474994","display_name":"Vijay K. Garg","orcid":"https://orcid.org/0000-0002-5797-4389"},"institutions":[{"id":"https://openalex.org/I86519309","display_name":"The University of Texas at Austin","ror":"https://ror.org/00hj54h04","country_code":"US","type":"education","lineage":["https://openalex.org/I86519309"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Vijay K. Garg","raw_affiliation_strings":["University of Texas at Austin, USA"],"affiliations":[{"raw_affiliation_string":"University of Texas at Austin, USA","institution_ids":["https://openalex.org/I86519309"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5111475056"],"corresponding_institution_ids":["https://openalex.org/I86519309"],"apc_list":null,"apc_paid":null,"fwci":0.9985,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.7926861,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":96,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"140","last_page":"149"},"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.9998999834060669,"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.9998999834060669,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9976000189781189,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/enumeration","display_name":"Enumeration","score":0.8304636478424072},{"id":"https://openalex.org/keywords/predicate","display_name":"Predicate (mathematical logic)","score":0.8199607729911804},{"id":"https://openalex.org/keywords/nondeterministic-algorithm","display_name":"Nondeterministic algorithm","score":0.807269811630249},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7341451644897461},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.683149516582489},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5704935193061829},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3685555160045624},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.32953330874443054},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.2471262514591217},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1918874979019165},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.12065190076828003}],"concepts":[{"id":"https://openalex.org/C156340839","wikidata":"https://www.wikidata.org/wiki/Q2704791","display_name":"Enumeration","level":2,"score":0.8304636478424072},{"id":"https://openalex.org/C140146324","wikidata":"https://www.wikidata.org/wiki/Q1144319","display_name":"Predicate (mathematical logic)","level":2,"score":0.8199607729911804},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.807269811630249},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7341451644897461},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.683149516582489},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5704935193061829},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3685555160045624},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.32953330874443054},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2471262514591217},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1918874979019165},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.12065190076828003}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2688500.2688520","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2688500.2688520","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 20th ACM SIGPLAN Symposium on Principles and Practice of Parallel Programming","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G8482051504","display_name":null,"funder_award_id":"CNS-1346245","funder_id":"https://openalex.org/F4320306076","funder_display_name":"National Science Foundation"}],"funders":[{"id":"https://openalex.org/F4320306076","display_name":"National Science Foundation","ror":"https://ror.org/021nxhr62"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":31,"referenced_works":["https://openalex.org/W1520725880","https://openalex.org/W1578211237","https://openalex.org/W1652742168","https://openalex.org/W1711140305","https://openalex.org/W1977476643","https://openalex.org/W1983572666","https://openalex.org/W1993776407","https://openalex.org/W2002179840","https://openalex.org/W2010892521","https://openalex.org/W2036167043","https://openalex.org/W2049890507","https://openalex.org/W2052995544","https://openalex.org/W2070280587","https://openalex.org/W2100559484","https://openalex.org/W2104537058","https://openalex.org/W2111413199","https://openalex.org/W2128553025","https://openalex.org/W2131053137","https://openalex.org/W2135948849","https://openalex.org/W2153229512","https://openalex.org/W2159765571","https://openalex.org/W2159812975","https://openalex.org/W2159856414","https://openalex.org/W2160800498","https://openalex.org/W2164538023","https://openalex.org/W2167744164","https://openalex.org/W2171480813","https://openalex.org/W3137220996","https://openalex.org/W3145128584","https://openalex.org/W4285719527","https://openalex.org/W4372046852"],"related_works":["https://openalex.org/W108845024","https://openalex.org/W4300125793","https://openalex.org/W2578985712","https://openalex.org/W2406961474","https://openalex.org/W2143566611","https://openalex.org/W588267724","https://openalex.org/W2057205169","https://openalex.org/W4297743441","https://openalex.org/W2242035652","https://openalex.org/W1574120008"],"abstract_inverted_index":{"Verifying":[0],"the":[1,4,19,28,41,54,61,64,82,92,128,148],"correctness":[2],"of":[3,6,13,18,40,67,73,116,155],"executions":[5],"a":[7,98,153],"concurrent":[8],"program":[9],"is":[10,22,45,76,177],"difficult":[11],"because":[12,47],"its":[14],"nondeterministic":[15],"behavior.":[16],"One":[17,70],"verification":[20,187],"methods":[21],"predicate":[23,62,74,165,170],"detection,":[24,171],"which":[25,80],"predicts":[26],"whether":[27],"user":[29],"specified":[30],"condition":[31],"(predicate)":[32],"could":[33],"become":[34],"true":[35],"in":[36],"any":[37],"global":[38,65,77,83,137],"states":[39,66,78,84],"program.":[42],"The":[43],"method":[44],"predictive":[46],"it":[48],"generates":[49,81],"inferred":[50,68,86],"execution":[51,56],"paths":[52],"from":[53],"observed":[55],"path":[57],"and":[58,89,112,131,192],"then":[59],"checks":[60],"on":[63,85,97,175],"paths.":[69,87],"important":[71],"part":[72],"detection":[75],"enumeration,":[79],"Cooper":[88,191],"Marzullo":[90],"gave":[91],"first":[93,100,129],"enumeration":[94,195],"algorithm":[95],"based":[96,174],"breadth":[99],"strategy":[101],"(BFS).":[102],"Later,":[103],"many":[104],"algorithms":[105,151],"have":[106,161],"been":[107],"proposed":[108],"to":[109,179],"improve":[110],"space":[111],"time":[113],"complexity.":[114],"None":[115],"them,":[117],"however,":[118],"takes":[119],"parallelism":[120],"into":[121],"consideration.":[122],"In":[123],"this":[124],"paper,":[125],"we":[126],"present":[127],"parallel":[130],"online":[132,164],"algorithm,":[133],"named":[134],"ParaMount,":[135],"for":[136],"state":[138],"enumeration.":[139],"Our":[140],"experimental":[141],"results":[142],"show":[143],"that":[144,189],"ParaMount":[145,176],"speeds":[146],"up":[147],"existing":[149],"sequential":[150],"by":[152],"factor":[154],"6":[156],"with":[157],"8":[158],"threads.":[159],"We":[160],"implemented":[162],"an":[163],"detector":[166,173],"using":[167],"ParaMount.":[168],"For":[169],"our":[172],"10":[178],"50":[180],"times":[181],"faster":[182],"than":[183],"RV":[184],"runtime":[185],"(a":[186],"tool":[188],"uses":[190],"Marzullo\u2019s":[193],"BFS":[194],"algorithm).":[196]},"counts_by_year":[{"year":2017,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}