{"id":"https://openalex.org/W4245646415","doi":"https://doi.org/10.1109/fmcad.2014.6987608","title":"Infinite-state backward exploration of Boolean broadcast programs","display_name":"Infinite-state backward exploration of Boolean broadcast programs","publication_year":2014,"publication_date":"2014-10-01","ids":{"openalex":"https://openalex.org/W4245646415","doi":"https://doi.org/10.1109/fmcad.2014.6987608"},"language":"en","primary_location":{"id":"doi:10.1109/fmcad.2014.6987608","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2014.6987608","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/A5004774483","display_name":"Peizun Liu","orcid":"https://orcid.org/0000-0002-3583-457X"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Peizun Liu","raw_affiliation_strings":["Northeastern University, Boston, USA"],"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5002008766","display_name":"Thomas Wahl","orcid":"https://orcid.org/0000-0003-3643-5463"},"institutions":[{"id":"https://openalex.org/I12912129","display_name":"Northeastern University","ror":"https://ror.org/04t5xt781","country_code":"US","type":"education","lineage":["https://openalex.org/I12912129"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Thomas Wahl","raw_affiliation_strings":["Northeastern University, Boston, USA"],"affiliations":[{"raw_affiliation_string":"Northeastern University, Boston, USA","institution_ids":["https://openalex.org/I12912129"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5004774483"],"corresponding_institution_ids":["https://openalex.org/I12912129"],"apc_list":null,"apc_paid":null,"fwci":2.4541,"has_fulltext":false,"cited_by_count":9,"citation_normalized_percentile":{"value":0.91499928,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"155","last_page":"162"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9803000092506409,"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"}},"topics":[{"id":"https://openalex.org/T10682","display_name":"Quantum Computing Algorithms and Architecture","score":0.9803000092506409,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9771000146865845,"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/T12029","display_name":"DNA and Biological Computing","score":0.9458000063896179,"subfield":{"id":"https://openalex.org/subfields/1312","display_name":"Molecular Biology"},"field":{"id":"https://openalex.org/fields/13","display_name":"Biochemistry, Genetics and Molecular Biology"},"domain":{"id":"https://openalex.org/domains/1","display_name":"Life Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7299959659576416},{"id":"https://openalex.org/keywords/petri-net","display_name":"Petri net","score":0.7133392095565796},{"id":"https://openalex.org/keywords/predicate-abstraction","display_name":"Predicate abstraction","score":0.5435653924942017},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.5314710736274719},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4749974012374878},{"id":"https://openalex.org/keywords/boolean-expression","display_name":"Boolean expression","score":0.4549701511859894},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4532405734062195},{"id":"https://openalex.org/keywords/transition-system","display_name":"Transition system","score":0.4378434419631958},{"id":"https://openalex.org/keywords/boolean-function","display_name":"Boolean function","score":0.4298984110355377},{"id":"https://openalex.org/keywords/boolean-data-type","display_name":"Boolean data type","score":0.4209122061729431},{"id":"https://openalex.org/keywords/assertion","display_name":"Assertion","score":0.42036744952201843},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.41823461651802063},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4047064185142517},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.37403905391693115}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7299959659576416},{"id":"https://openalex.org/C38677869","wikidata":"https://www.wikidata.org/wiki/Q724168","display_name":"Petri net","level":2,"score":0.7133392095565796},{"id":"https://openalex.org/C2779907942","wikidata":"https://www.wikidata.org/wiki/Q7239630","display_name":"Predicate abstraction","level":3,"score":0.5435653924942017},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.5314710736274719},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4749974012374878},{"id":"https://openalex.org/C158465420","wikidata":"https://www.wikidata.org/wiki/Q1979515","display_name":"Boolean expression","level":3,"score":0.4549701511859894},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4532405734062195},{"id":"https://openalex.org/C2779167558","wikidata":"https://www.wikidata.org/wiki/Q176468","display_name":"Transition system","level":2,"score":0.4378434419631958},{"id":"https://openalex.org/C187455244","wikidata":"https://www.wikidata.org/wiki/Q942353","display_name":"Boolean function","level":2,"score":0.4298984110355377},{"id":"https://openalex.org/C7342684","wikidata":"https://www.wikidata.org/wiki/Q520777","display_name":"Boolean data type","level":2,"score":0.4209122061729431},{"id":"https://openalex.org/C40422974","wikidata":"https://www.wikidata.org/wiki/Q741248","display_name":"Assertion","level":2,"score":0.42036744952201843},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.41823461651802063},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4047064185142517},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.37403905391693115},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/fmcad.2014.6987608","is_oa":false,"landing_page_url":"https://doi.org/10.1109/fmcad.2014.6987608","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":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W80882812","https://openalex.org/W1505597832","https://openalex.org/W1508360721","https://openalex.org/W1556652046","https://openalex.org/W1810198311","https://openalex.org/W1855789069","https://openalex.org/W1947886897","https://openalex.org/W1964116449","https://openalex.org/W1991405126","https://openalex.org/W2050591418","https://openalex.org/W2106001218","https://openalex.org/W2123910665","https://openalex.org/W2129073086","https://openalex.org/W2136867104","https://openalex.org/W6630451340","https://openalex.org/W6638427233","https://openalex.org/W6638858265"],"related_works":["https://openalex.org/W4252281389","https://openalex.org/W1656403910","https://openalex.org/W3187430668","https://openalex.org/W3002978114","https://openalex.org/W3141532631","https://openalex.org/W2105443217","https://openalex.org/W1543389043","https://openalex.org/W2131164334","https://openalex.org/W1995041806","https://openalex.org/W2050201153"],"abstract_inverted_index":{"Assertion":[0],"checking":[1],"for":[2,34],"non-recursive":[3],"unbounded-thread":[4],"Boolean":[5,89,154],"programs":[6,155],"can":[7],"be":[8],"performed":[9],"in":[10,62,95,147],"principle":[11],"by":[12,157],"converting":[13],"the":[14,28,55,63,66,74,83,88,96,105,115,121,140,158],"program":[15],"into":[16],"an":[17,45],"infinite-state":[18],"transition":[19,123],"system":[20,29,58,124,136],"such":[21,102],"as":[22,54,103],"a":[23,31,77,111],"Petri":[24,78],"net":[25,79],"and":[26,37,80],"subjecting":[27],"to":[30,49,70,87],"coverability":[32,84,106],"check,":[33],"which":[35],"sound":[36],"complete":[38],"algorithms":[39],"exist.":[40],"Said":[41],"conversion":[42],"adds,":[43],"however,":[44],"additional":[46],"heavy":[47],"burden":[48],"these":[50],"already":[51],"expensive":[52],"algorithms,":[53],"number":[56],"of":[57,65,76,98,114,119],"states":[59,137],"is":[60,93,126,131],"exponential":[61],"size":[64],"program.":[67,90,116],"Our":[68],"solution":[69],"this":[71,152],"problem":[72],"avoids":[73],"construction":[75,125],"instead":[81],"applies":[82],"algorithm":[85,107],"directly":[86],"A":[91],"challenge":[92],"that,":[94],"presence":[97],"advanced":[99],"communication":[100],"primitives":[101],"broadcasts,":[104],"proceeds":[108],"backwards,":[109],"requiring":[110],"backward":[112],"execution":[113],"The":[117],"benefit":[118],"avoiding":[120],"up-front":[122],"that":[127],"\"what":[128],"you":[129,133],"see":[130],"what":[132],"pay\":":[134],"only":[135],"backward-reachable":[138],"from":[139],"target":[141],"state":[142],"are":[143],"generated,":[144],"often":[145],"resulting":[146],"dramatic":[148],"savings.":[149],"We":[150],"demonstrate":[151],"using":[153],"constructed":[156],"SatAbs":[159],"predicate":[160],"abstraction":[161],"engine.":[162]},"counts_by_year":[{"year":2021,"cited_by_count":1},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}