{"id":"https://openalex.org/W2118713304","doi":"https://doi.org/10.1145/1146238.1146250","title":"Breaking up is hard to do","display_name":"Breaking up is hard to do","publication_year":2006,"publication_date":"2006-07-21","ids":{"openalex":"https://openalex.org/W2118713304","doi":"https://doi.org/10.1145/1146238.1146250","mag":"2118713304"},"language":"en","primary_location":{"id":"doi:10.1145/1146238.1146250","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1146238.1146250","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 international symposium on Software testing and analysis","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/A5052906385","display_name":"Jamieson M. Cobleigh","orcid":null},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jamieson M. Cobleigh","raw_affiliation_strings":["University of Massachusetts, Amherst, MA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts, Amherst, MA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5109931927","display_name":"George S. Avrunin","orcid":null},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"George S. Avrunin","raw_affiliation_strings":["University of Massachusetts, Amherst, MA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts, Amherst, MA","institution_ids":["https://openalex.org/I24603500"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5111987936","display_name":"Lori A. Clarke","orcid":null},"institutions":[{"id":"https://openalex.org/I24603500","display_name":"University of Massachusetts Amherst","ror":"https://ror.org/0072zz521","country_code":"US","type":"education","lineage":["https://openalex.org/I24603500"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Lori A. Clarke","raw_affiliation_strings":["University of Massachusetts, Amherst, MA"],"affiliations":[{"raw_affiliation_string":"University of Massachusetts, Amherst, MA","institution_ids":["https://openalex.org/I24603500"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5052906385"],"corresponding_institution_ids":["https://openalex.org/I24603500"],"apc_list":null,"apc_paid":null,"fwci":7.5217,"has_fulltext":false,"cited_by_count":44,"citation_normalized_percentile":{"value":0.97872439,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":98},"biblio":{"volume":null,"issue":null,"first_page":"97","last_page":"108"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.9994999766349792,"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/T11424","display_name":"Security and Verification in Computing","score":0.9943000078201294,"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.9933000206947327,"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.7462959289550781},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6640494465827942},{"id":"https://openalex.org/keywords/non-monotonic-logic","display_name":"Non-monotonic logic","score":0.49012622237205505},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.48284775018692017},{"id":"https://openalex.org/keywords/automated-reasoning","display_name":"Automated reasoning","score":0.4706788659095764},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.4331778883934021},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4144909977912903},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2368772029876709},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.1813281774520874}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7462959289550781},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6640494465827942},{"id":"https://openalex.org/C159032336","wikidata":"https://www.wikidata.org/wiki/Q2488768","display_name":"Non-monotonic logic","level":2,"score":0.49012622237205505},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.48284775018692017},{"id":"https://openalex.org/C195344581","wikidata":"https://www.wikidata.org/wiki/Q2555318","display_name":"Automated reasoning","level":2,"score":0.4706788659095764},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.4331778883934021},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4144909977912903},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2368772029876709},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.1813281774520874}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1146238.1146250","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1146238.1146250","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2006 international symposium on Software testing and analysis","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":52,"referenced_works":["https://openalex.org/W80370608","https://openalex.org/W1484105275","https://openalex.org/W1488659932","https://openalex.org/W1489391022","https://openalex.org/W1503170978","https://openalex.org/W1503973138","https://openalex.org/W1508602846","https://openalex.org/W1524354295","https://openalex.org/W1527992925","https://openalex.org/W1529652113","https://openalex.org/W1545438004","https://openalex.org/W1562915062","https://openalex.org/W1590437595","https://openalex.org/W1605985842","https://openalex.org/W1799055964","https://openalex.org/W1969454562","https://openalex.org/W1974986814","https://openalex.org/W1977380916","https://openalex.org/W1989445634","https://openalex.org/W1990148003","https://openalex.org/W1995736448","https://openalex.org/W1996158062","https://openalex.org/W1996486194","https://openalex.org/W1998296117","https://openalex.org/W2014096115","https://openalex.org/W2036267700","https://openalex.org/W2039549168","https://openalex.org/W2047375390","https://openalex.org/W2060910670","https://openalex.org/W2098039922","https://openalex.org/W2098996654","https://openalex.org/W2105180288","https://openalex.org/W2115309705","https://openalex.org/W2117779697","https://openalex.org/W2118713304","https://openalex.org/W2120521925","https://openalex.org/W2122933424","https://openalex.org/W2130025446","https://openalex.org/W2130851407","https://openalex.org/W2135274583","https://openalex.org/W2135642703","https://openalex.org/W2140606869","https://openalex.org/W2142002041","https://openalex.org/W2147593930","https://openalex.org/W2169073289","https://openalex.org/W2169134334","https://openalex.org/W2169653992","https://openalex.org/W2502788415","https://openalex.org/W2507913385","https://openalex.org/W6603259056","https://openalex.org/W6633574760","https://openalex.org/W6666126596"],"related_works":["https://openalex.org/W1557741300","https://openalex.org/W3149102545","https://openalex.org/W2567893123","https://openalex.org/W1540904030","https://openalex.org/W1885715326","https://openalex.org/W1660287273","https://openalex.org/W3148272738","https://openalex.org/W1999970925","https://openalex.org/W45155459","https://openalex.org/W2020153579"],"abstract_inverted_index":{"Finite-state":[0],"verification":[1,98],"techniques":[2],"are":[3],"often":[4],"hampered":[5],"by":[6],"the":[7,69,76,79,127],"stateexplosion":[8],"problem.":[9],"One":[10],"proposed":[11],"approach":[12],"for":[13,53],"addressing":[14],"this":[15,46],"problem":[16],"is":[17],"assume-guarantee":[18,24,37,89,130],"reasoning.":[19,131],"Using":[20],"recent":[21],"advances":[22],"in":[23,100],"reasoning":[25,38,90,104],"that":[26],"automatically":[27],"generate":[28],"assumptions,":[29],"we":[30,48,74],"undertook":[31],"a":[32,54,85,112],"study":[33],"to":[34],"determine":[35],"if":[36],"provides":[39],"an":[40],"advantage":[41],"over":[42],"monolithic":[43,97,117],"verification.":[44,118],"In":[45,83],"study,":[47],"considered":[49],"all":[50],"two-way":[51],"decompositions":[52,77],"set":[55],"of":[56,71,129],"systems":[57,80,95,111],"and":[58,65],"properties,":[59],"using":[60],"two":[61],"different":[62],"verifiers,":[63],"FLAVERS":[64],"LTSA.":[66],"By":[67],"increasing":[68],"number":[70],"repeated":[72],"tasks,":[73],"evaluated":[75],"as":[78],"were":[81],"scaled.":[82],"only":[84,106],"few":[86,113],"cases":[87],"could":[88,105],"verify":[91,107],"properties":[92,109],"on":[93,110],"larger":[94,115],"than":[96,116],"and,":[99],"these":[101,108],"cases,":[102],"assumeguarantee":[103],"sizes":[114],"This":[119],"discouraging":[120],"result,":[121],"although":[122],"preliminary,":[123],"raises":[124],"doubts":[125],"about":[126],"usefulness":[128]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2023,"cited_by_count":1},{"year":2021,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2015,"cited_by_count":4},{"year":2014,"cited_by_count":2},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}
