{"id":"https://openalex.org/W2114314195","doi":"https://doi.org/10.1145/2642937.2643016","title":"Automatic verification of interactions in asynchronous systems with unbounded buffers","display_name":"Automatic verification of interactions in asynchronous systems with unbounded buffers","publication_year":2014,"publication_date":"2014-09-15","ids":{"openalex":"https://openalex.org/W2114314195","doi":"https://doi.org/10.1145/2642937.2643016","mag":"2114314195"},"language":"en","primary_location":{"id":"doi:10.1145/2642937.2643016","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2642937.2643016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering","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/A5103063258","display_name":"Samik Basu","orcid":"https://orcid.org/0000-0002-3757-2227"},"institutions":[{"id":"https://openalex.org/I173911158","display_name":"Iowa State University","ror":"https://ror.org/04rswrd78","country_code":"US","type":"education","lineage":["https://openalex.org/I173911158"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Samik Basu","raw_affiliation_strings":["Iowa State University, Ames, IA, USA","Iowa state university, Ames, IA, USA"],"affiliations":[{"raw_affiliation_string":"Iowa State University, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]},{"raw_affiliation_string":"Iowa state university, Ames, IA, USA","institution_ids":["https://openalex.org/I173911158"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039991493","display_name":"Tevfik Bultan","orcid":"https://orcid.org/0000-0003-2993-1215"},"institutions":[{"id":"https://openalex.org/I154570441","display_name":"University of California, Santa Barbara","ror":"https://ror.org/02t274463","country_code":"US","type":"education","lineage":["https://openalex.org/I154570441"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Tevfik Bultan","raw_affiliation_strings":["University of California at Santa Barbara, Santa Barbara, CA, USA",", University of California at Santa Barbara, Santa Barbara, CA, USA"],"affiliations":[{"raw_affiliation_string":"University of California at Santa Barbara, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]},{"raw_affiliation_string":", University of California at Santa Barbara, Santa Barbara, CA, USA","institution_ids":["https://openalex.org/I154570441"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5103063258"],"corresponding_institution_ids":["https://openalex.org/I173911158"],"apc_list":null,"apc_paid":null,"fwci":3.2047,"has_fulltext":false,"cited_by_count":15,"citation_normalized_percentile":{"value":0.92227872,"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":"743","last_page":"754"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9998999834060669,"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.9998999834060669,"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/T10772","display_name":"Distributed systems and fault tolerance","score":0.9994999766349792,"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/T10126","display_name":"Logic, programming, and type systems","score":0.9958999752998352,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.849159836769104},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.814480185508728},{"id":"https://openalex.org/keywords/undecidable-problem","display_name":"Undecidable problem","score":0.7860827445983887},{"id":"https://openalex.org/keywords/decidability","display_name":"Decidability","score":0.774909257888794},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6672770380973816},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6125462055206299},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5246774554252625},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4658668041229248},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.4640461802482605},{"id":"https://openalex.org/keywords/model-checking","display_name":"Model checking","score":0.44242122769355774},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.41192591190338135},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.1532662808895111},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.13732987642288208}],"concepts":[{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.849159836769104},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.814480185508728},{"id":"https://openalex.org/C192034797","wikidata":"https://www.wikidata.org/wiki/Q3502995","display_name":"Undecidable problem","level":3,"score":0.7860827445983887},{"id":"https://openalex.org/C153269930","wikidata":"https://www.wikidata.org/wiki/Q430001","display_name":"Decidability","level":2,"score":0.774909257888794},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6672770380973816},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6125462055206299},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5246774554252625},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4658668041229248},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.4640461802482605},{"id":"https://openalex.org/C110251889","wikidata":"https://www.wikidata.org/wiki/Q1569697","display_name":"Model checking","level":2,"score":0.44242122769355774},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41192591190338135},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.1532662808895111},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.13732987642288208},{"id":"https://openalex.org/C54355233","wikidata":"https://www.wikidata.org/wiki/Q7162","display_name":"Genetics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/2642937.2643016","is_oa":false,"landing_page_url":"https://doi.org/10.1145/2642937.2643016","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 29th ACM/IEEE International Conference on Automated Software Engineering","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G7944991751","display_name":null,"funder_award_id":"CCF-1116836","funder_id":"https://openalex.org/F4320337387","funder_display_name":"Division of Computing and Communication Foundations"}],"funders":[{"id":"https://openalex.org/F4320337387","display_name":"Division of Computing and Communication Foundations","ror":"https://ror.org/01mng8331"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":24,"referenced_works":["https://openalex.org/W17260705","https://openalex.org/W68069235","https://openalex.org/W89384568","https://openalex.org/W1480434155","https://openalex.org/W1547234535","https://openalex.org/W1559665648","https://openalex.org/W1615690992","https://openalex.org/W1784055113","https://openalex.org/W1823865466","https://openalex.org/W1842117537","https://openalex.org/W1943502734","https://openalex.org/W1968720074","https://openalex.org/W2025970201","https://openalex.org/W2027901440","https://openalex.org/W2040008220","https://openalex.org/W2040105559","https://openalex.org/W2063156356","https://openalex.org/W2111291256","https://openalex.org/W2128433357","https://openalex.org/W2137186143","https://openalex.org/W2144531585","https://openalex.org/W2340735175","https://openalex.org/W2913459036","https://openalex.org/W6684644128"],"related_works":["https://openalex.org/W2972379433","https://openalex.org/W2989332944","https://openalex.org/W2021891065","https://openalex.org/W2583549044","https://openalex.org/W2119045600","https://openalex.org/W2584984136","https://openalex.org/W2170336571","https://openalex.org/W2962928105","https://openalex.org/W2020140696","https://openalex.org/W1485718948"],"abstract_inverted_index":{"Asynchronous":[0],"communication":[1],"requires":[2],"message":[3],"queues":[4,29,113],"to":[5,12,120],"store":[6],"the":[7,25,66,71,81,101,143,150,154],"messages":[8,75],"that":[9,76,117,129],"are":[10,77,84],"yet":[11],"be":[13,133,158],"consumed.":[14],"Verification":[15],"of":[16,27,74,93,138],"interactions":[17,122],"in":[18,80,87],"asynchronously":[19,41,94,108],"communicating":[20,42,95,109],"systems":[21,43,110],"is":[22,118],"challenging":[23],"since":[24],"sizes":[26,156],"these":[28],"can":[30,132,157],"grow":[31],"arbitrarily":[32],"large":[33],"during":[34],"execution.":[35],"In":[36,57,97],"fact,":[37],"behavioral":[38],"models":[39],"for":[40,90],"typically":[44],"have":[45],"infinite":[46],"state":[47],"spaces,":[48],"which":[49,107],"makes":[50],"many":[51],"analysis":[52],"and":[53,103],"verification":[54,89],"problems":[55],"undecidable.":[56],"this":[58,130],"paper,":[59],"we":[60,99,147],"show":[61,128,148],"that,":[62,149],"focusing":[63],"only":[64],"on":[65,142,153],"interaction":[67,115],"behavior":[68,116],"(modeled":[69],"as":[70],"global":[72],"sequence":[73],"sent,":[78],"recorded":[79],"order":[82],"they":[83],"sent)":[85],"results":[86],"decidable":[88],"a":[91,139],"class":[92],"systems.":[96],"particular,":[98],"present":[100],"necessary":[102],"sufficient":[104],"condition":[105,131],"under":[106],"with":[111],"unbounded":[112],"exhibit":[114],"equivalent":[119],"their":[121],"over":[123],"finitely":[124],"bounded":[125],"queues.":[126],"We":[127],"automatically":[134,159],"checked,":[135],"ensuring":[136],"existence":[137],"finite":[140,151],"bound":[141,152],"queue":[144,155],"sizes,":[145],"and,":[146],"computed.":[160]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":3},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":3}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}