{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T20:11:25Z","timestamp":1774987885344,"version":"3.50.1"},"reference-count":14,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009,11]]},"DOI":"10.1109\/fmcad.2009.5351134","type":"proceedings-article","created":{"date-parts":[[2009,12,11]],"date-time":"2009-12-11T13:55:16Z","timestamp":1260539716000},"page":"116-119","source":"Crossref","is-referenced-by-count":6,"title":["Data mining based decomposition for assume-guarantee reasoning"],"prefix":"10.1109","author":[{"given":"He","family":"Zhu","sequence":"first","affiliation":[]},{"given":"Fei","family":"He","sequence":"additional","affiliation":[]},{"given":"William N. N.","family":"Hung","sequence":"additional","affiliation":[]},{"given":"Xiaoyu","family":"Song","sequence":"additional","affiliation":[]},{"given":"Ming","family":"Gu","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"13","year":"0"},{"key":"14","article-title":"Proof rules for automated compositional verification","author":"barringer","year":"2003","journal-title":"Workshop on the Specification and Verification of Component-Based Systems"},{"key":"11","article-title":"Efficient implementations of apriori and eclat","author":"borgelt","year":"2003","journal-title":"Proc ICDM Workshop Frequent Itemset Mining Implementations"},{"key":"12","year":"0","journal-title":"NuSMV examples The collection"},{"key":"3","first-page":"521","article-title":"You assume, we guarantee: Methodology and case studies","author":"henzinger","year":"1998","journal-title":"Proc Workshop Computer Aided Verification (CAV)"},{"key":"2","first-page":"321332","article-title":"Specification and design of (parallel) programs","author":"jones","year":"1983","journal-title":"Proceedings of the IFIP 9th World Congress"},{"key":"1","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-82453-1_5"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/170035.170072"},{"key":"7","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1007\/3-540-45657-0_29","article-title":"NuSMV Version 2: An OpenSource Tool for Symbolic Model Checking","author":"cimatti","year":"2002","journal-title":"Proc Workshop Computer Aided Verification (CAV)"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1007\/11901914_15"},{"key":"5","doi-asserted-by":"crossref","DOI":"10.1007\/3-540-36577-X_24","article-title":"Learning assumptions for compositional verification","author":"cobleigh","year":"2003","journal-title":"Tools and Algorithms for the Construction and Analysis of Systems (TACAS)"},{"key":"4","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1007\/10722167_14","article-title":"On the completeness of compositional reasoning","author":"namjoshi","year":"2000","journal-title":"Proc Workshop Computer Aided Verification (CAV)"},{"key":"9","doi-asserted-by":"publisher","DOI":"10.1109\/92.748202"},{"key":"8","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-73368-3_8"}],"event":{"name":"2009 Formal Methods in Computer-Aided Design (FMCAD)","location":"Austin, TX, USA","start":{"date-parts":[[2009,11,15]]},"end":{"date-parts":[[2009,11,18]]}},"container-title":["2009 Formal Methods in Computer-Aided Design"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5344684\/5351113\/05351134.pdf?arnumber=5351134","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,6,18]],"date-time":"2017-06-18T22:43:28Z","timestamp":1497825808000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5351134\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,11]]},"references-count":14,"URL":"https:\/\/doi.org\/10.1109\/fmcad.2009.5351134","relation":{},"subject":[],"published":{"date-parts":[[2009,11]]}}}