{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,18]],"date-time":"2025-11-18T23:14:08Z","timestamp":1763507648236},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2008,3,8]],"date-time":"2008-03-08T00:00:00Z","timestamp":1204934400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Form Methods Syst Des"],"published-print":{"date-parts":[[2008,6]]},"DOI":"10.1007\/s10703-008-0050-0","type":"journal-article","created":{"date-parts":[[2008,3,7]],"date-time":"2008-03-07T14:35:37Z","timestamp":1204900537000},"page":"285-301","source":"Crossref","is-referenced-by-count":40,"title":["Automated assumption generation for compositional verification"],"prefix":"10.1007","volume":"32","author":[{"given":"Anubhav","family":"Gupta","sequence":"first","affiliation":[]},{"given":"K. L.","family":"McMillan","sequence":"additional","affiliation":[]},{"given":"Zhaohui","family":"Fu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2008,3,8]]},"reference":[{"key":"50_CR1","doi-asserted-by":"crossref","unstructured":"Alur R, Madhusudan P, Nam W (2005) Symbolic compositional verification by learning assumptions. In: Proceedings of the international conference on computer aided verification (CAV), pp\u00a0548\u2013562","DOI":"10.1007\/11513988_52"},{"key":"50_CR2","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin D (1987) Learning regular sets from queries and counterexamples. Inf Comput 75:87\u2013106","journal-title":"Inf Comput"},{"key":"50_CR3","doi-asserted-by":"crossref","unstructured":"Biere A, Cimatti A, Clarke E, Zhu Y (1999) Symbolic model checking without BDDs. In: Tools and algorithms for the construction and analysis of systems (TACAS\u201999), LNCS","DOI":"10.21236\/ADA360973"},{"key":"50_CR4","doi-asserted-by":"crossref","unstructured":"Cobleigh J, Giannakopoulou D, Pasareanu C (2003) Learning assumptions for compositional verification. In: Proceedings of the 9th international conference on tools and algorithms for the construction and analysis of systems (TACAS)","DOI":"10.1007\/3-540-36577-X_24"},{"key":"50_CR5","doi-asserted-by":"crossref","unstructured":"Chaki S, Strichman O (2007) Optimized l*-based assume-guarantee reasoning. In: TACAS, pp\u00a0276\u2013291","DOI":"10.1007\/978-3-540-71209-1_22"},{"key":"50_CR6","first-page":"302","volume":"37","author":"EM Gold","year":"1978","unstructured":"Gold EM (1978) Complexity of automaton identification from given data. Inf Comput 37:302\u2013320","journal-title":"Inf Comput"},{"key":"50_CR7","volume-title":"Synthesis of FSMs: functional optimization","author":"T Kam","year":"1997","unstructured":"Kam T, Villa T, Brayton R, Sangiovanni-Vincentelli AL (1997) Synthesis of FSMs: functional optimization. Kluwer Academic, Dordrecht"},{"key":"50_CR8","unstructured":"McMillan KL Cadence SMV. Cadence Berkeley Labs, CA"},{"key":"50_CR9","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic model checking","author":"KL McMillan","year":"1993","unstructured":"McMillan KL (1993) Symbolic model checking. Kluwer Academic, Boston"},{"key":"50_CR10","volume-title":"Machine learning","author":"TM Mitchell","year":"1997","unstructured":"Mitchell TM (1997) Machine learning. WCB\/McGraw-Hill, New York"},{"key":"50_CR11","doi-asserted-by":"crossref","unstructured":"Oliveira AL, Marques Silva JP (1998) Efficient search techniques for the inference of minimum size finite automata. In: Proceedings of the symposium on string processing and information retrieval (SPIRE), pp\u00a081\u201389","DOI":"10.1109\/SPIRE.1998.712986"},{"issue":"11","key":"50_CR12","doi-asserted-by":"crossref","first-page":"1619","DOI":"10.1109\/43.806807","volume":"18","author":"JM Pena","year":"1999","unstructured":"Pena JM, Oliveira AL (1999) A new algorithm for exact reduction of incompletely specified finite state machines. IEEE Trans CAD Integr Circuits Syst 18(11):1619\u20131632","journal-title":"IEEE Trans CAD Integr Circuits Syst"},{"key":"50_CR13","doi-asserted-by":"crossref","first-page":"1099","DOI":"10.1109\/T-C.1973.223655","volume":"C-22","author":"CF Pfleeger","year":"1973","unstructured":"Pfleeger CF (1973) State reduction in incompletely specified finite state machines. IEEE Trans Comput C-22:1099\u20131102","journal-title":"IEEE Trans Comput"},{"key":"50_CR14","doi-asserted-by":"crossref","unstructured":"Quinlan JR (1986) Induction of decision trees. Mach Learn","DOI":"10.1007\/BF00116251"},{"key":"50_CR15","first-page":"411","volume-title":"Proceedings of the ACM symposium on theory of computing (STOC)","author":"RL Rivest","year":"1989","unstructured":"Rivest RL, Schapire RE (1989) Inference of finite automata using homing sequences. In: Proceedings of the ACM symposium on theory of computing (STOC). ACM Press, New York, pp\u00a0411\u2013420"},{"key":"50_CR16","doi-asserted-by":"crossref","unstructured":"Sinha N, Clarke EM (2007) Sat-based compositional verification using lazy learning. In: CAV, pp\u00a039\u201354","DOI":"10.1007\/978-3-540-73368-3_8"}],"container-title":["Formal Methods in System Design"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-008-0050-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10703-008-0050-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10703-008-0050-0","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T22:01:03Z","timestamp":1559253663000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10703-008-0050-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,3,8]]},"references-count":16,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,6]]}},"alternative-id":["50"],"URL":"https:\/\/doi.org\/10.1007\/s10703-008-0050-0","relation":{},"ISSN":["0925-9856","1572-8102"],"issn-type":[{"value":"0925-9856","type":"print"},{"value":"1572-8102","type":"electronic"}],"subject":[],"published":{"date-parts":[[2008,3,8]]}}}