{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T22:56:57Z","timestamp":1725490617711},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540733676"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-73368-3_45","type":"book-chapter","created":{"date-parts":[[2007,8,29]],"date-time":"2007-08-29T18:29:34Z","timestamp":1188412174000},"page":"420-432","source":"Crossref","is-referenced-by-count":19,"title":["Automated Assumption Generation for Compositional Verification"],"prefix":"10.1007","author":[{"given":"Anubhav","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kenneth L.","family":"McMillan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zhaohui","family":"Fu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"45_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"548","DOI":"10.1007\/11513988_52","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2005","unstructured":"Alur, R., Madhusudan, P., Nam, W.: Parametric temporal logic for model measuring. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 548\u2013562. Springer, Heidelberg (2005)"},{"key":"45_CR2","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D. Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Information and Computation\u00a075, 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"45_CR3","series-title":"Lecture Notes in Computer Science","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J. Cobleigh","year":"2003","unstructured":"Cobleigh, J., Giannakopoulou, D., Pasareanu, C.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) ETAPS 2003 and TACAS 2003. LNCS, vol.\u00a02619, Springer, Heidelberg (2003)"},{"key":"45_CR4","first-page":"302","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Information and Computation\u00a037, 302\u2013320 (1978)","journal-title":"Information and Computation"},{"key":"45_CR5","volume-title":"Synthesis of FSMs: Functional Optimization","author":"T. Kam","year":"1997","unstructured":"Kam, T., Villa, T., Brayton, R., Sangiovanni-Vincentelli, A.L.: Synthesis of FSMs: Functional Optimization. Kluwer Academic Publishers, Boston (1997)"},{"key":"45_CR6","unstructured":"McMillan, K.L.: Cadence SMV. Cadence Berkeley Labs, CA"},{"key":"45_CR7","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4615-3190-6","volume-title":"Symbolic Model Checking","author":"K.L. McMillan","year":"1993","unstructured":"McMillan, K.L.: Symbolic Model Checking. Kluwer Academic Publishers, Boston (1993)"},{"key":"45_CR8","unstructured":"Mitchell, T.M.: Machine Learning. WCB\/McGraw-Hill (1997)"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Oliveira, A.L., Marques Silva, J.P.: Efficient search techniques for the inference of minimum size finite automata. In: Proceedings of the Symposium on String Processing and Information Retrieval (SPIRE), pp. 81\u201389 (1998)","DOI":"10.1109\/SPIRE.1998.712986"},{"key":"45_CR10","doi-asserted-by":"publisher","first-page":"1099","DOI":"10.1109\/T-C.1973.223655","volume":"C-22","author":"C.F. Pfleeger","year":"1973","unstructured":"Pfleeger, C.F.: State reduction in incompletely specified finite state machines. IEEE Transactions on Computers\u00a0C-22, 1099\u20131102 (1973)","journal-title":"IEEE Transactions on Computers"},{"key":"45_CR11","first-page":"482","volume-title":"Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD)","author":"J.M. Pena","year":"1998","unstructured":"Pena, J.M., Oliveira, A.L.: A new algorithm for the reduction of incompletely specified finite state machines. In: Jorge, M. (ed.) Proceedings of the IEEE\/ACM International Conference on Computer-Aided Design (ICCAD), pp. 482\u2013489. ACM Press, New York, NY, USA (1998)"},{"key":"45_CR12","doi-asserted-by":"crossref","unstructured":"Quinlan, J.R.: Induction of decision trees. Machine Learning (1986)","DOI":"10.1007\/BF00116251"},{"key":"45_CR13","first-page":"411","volume-title":"Proceedings of the ACM Symposium on Theory of Computing (STOC)","author":"R.L. Rivest","year":"1989","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. In: Proceedings of the ACM Symposium on Theory of Computing (STOC), pp. 411\u2013420. ACM Press, New York, NY, USA (1989)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-73368-3_45.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T06:08:37Z","timestamp":1619503717000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-73368-3_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540733676"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-73368-3_45","relation":{},"subject":[]}}