{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:21:50Z","timestamp":1742390510884},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540272311"},{"type":"electronic","value":"9783540316862"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11513988_51","type":"book-chapter","created":{"date-parts":[[2010,3,12]],"date-time":"2010-03-12T13:33:28Z","timestamp":1268400808000},"page":"534-547","source":"Crossref","is-referenced-by-count":39,"title":["Automated Assume-Guarantee Reasoning for Simulation Conformance"],"prefix":"10.1007","author":[{"given":"Sagar","family":"Chaki","sequence":"first","affiliation":[]},{"given":"Edmund","family":"Clarke","sequence":"additional","affiliation":[]},{"given":"Nishant","family":"Sinha","sequence":"additional","affiliation":[]},{"given":"Prasanna","family":"Thati","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"51_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Cern\u00fd, P., Madhusudan, P., Nam, W.: Synthesis of interface specifications for java classes. In: POPL, pp. 98\u2013109 (2005)","DOI":"10.1145\/1047659.1040314"},{"issue":"2","key":"51_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(2), 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"51_CR3","unstructured":"Barringer, H., Giannakopoulou, D., Pasareanu, C.S.: Proof rules for automated compositional verification. In: Proc. of the 2nd Workshop on SAVCBS (2003)"},{"key":"51_CR4","unstructured":"Bernard, M., de la Higuera, C.: Gift: Grammatical inference for terms. In: International Conference on Inductive Logic Programming (1999)"},{"key":"51_CR5","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"187","DOI":"10.1007\/BFb0054075","volume-title":"Grammatical Inference","author":"R.C. Carrasco","year":"1998","unstructured":"Carrasco, R.C., Oncina, J., Calera-Rubio, J.: Stochastic inference of regular tree languages. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol.\u00a01433, pp. 187\u2013198. Springer, Heidelberg (1998)"},{"key":"51_CR6","doi-asserted-by":"crossref","unstructured":"Chaki, S., Clarke, E., Groce, A., Ouaknine, J., Strichman, O., Yorav, K.: Efficient verification of sequential and concurrent C programs. FMSD\u00a025(2\u20133) (2004)","DOI":"10.1023\/B:FORM.0000040026.56959.91"},{"key":"51_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"164","DOI":"10.1007\/11513988_18","volume-title":"Computer Aided Verification","author":"S. Chaki","year":"2005","unstructured":"Chaki, S., Ivers, J., Sharygina, N., Wallnau, K.: The comFoRT reasoning framework. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 164\u2013169. Springer, Heidelberg (2005)"},{"key":"51_CR8","doi-asserted-by":"crossref","unstructured":"Clarke, E., Long, D., McMillan, K.: Compositional model checking. In: LICS (1989)","DOI":"10.1109\/LICS.1989.39190"},{"key":"51_CR9","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Proc. of CAV (2000)","DOI":"10.1007\/10722167_15"},{"issue":"5","key":"51_CR10","doi-asserted-by":"publisher","first-page":"1512","DOI":"10.1145\/186025.186051","volume":"16","author":"E.M. Clarke","year":"1994","unstructured":"Clarke, E.M., Grumberg, O., Long, D.E.: Model checking and abstraction. ACM Transactions on Programming Languages and System (TOPLAS)\u00a016(5), 1512\u20131542 (1994)","journal-title":"ACM Transactions on Programming Languages and System (TOPLAS)"},{"key":"51_CR11","volume-title":"Model Checking","author":"E.M. Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (2000)"},{"key":"51_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/3-540-36577-X_24","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"J.M. Cobleigh","year":"2003","unstructured":"Cobleigh, J.M., Giannakopoulou, D., P\u0103s\u0103reanu, C.S.: Learning assumptions for compositional verification. In: Garavel, H., Hatcliff, J. (eds.) TACAS 2003. LNCS, vol.\u00a02619, pp. 331\u2013346. Springer, Heidelberg (2003)"},{"key":"51_CR13","unstructured":"Comon, H., Dauchet, M., Gilleron, R., Jacquemard, F., Lugiez, D., Tison, S., Tommasi, M.: Tree Automata Techniques and Applications, ch.1 (2002), available at http:\/\/www.grappa.univ-lille3.fr\/tata"},{"key":"51_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-45007-6_22","volume-title":"Developments in Language Theory","author":"F. Drewes","year":"2003","unstructured":"Drewes, F., Hogberg, J.: Learning a regular tree language. In: \u00c9sik, Z., F\u00fcl\u00f6p, Z. (eds.) DLT 2003. LNCS, vol.\u00a02710, pp. 279\u2013291. Springer, Heidelberg (2003)"},{"key":"51_CR15","doi-asserted-by":"crossref","unstructured":"Ernst, M.D., Cockrell, J., Griswold, W.G., Notkin, D.: Dynamically discovering likely program invariants to support program evolution. In: Proc. of ICSE (1999)","DOI":"10.1145\/302405.302467"},{"key":"51_CR16","unstructured":"Garc\u00eda, P., Oncina, J.: Inference of recognizable tree sets. Technical Report II\/47\/1993, Dept. de Sistemas Inform\u00e1ticos y Computaci\u00f3n, Universidad Polit\u00e9cnica de Valencia (1993)"},{"key":"51_CR17","doi-asserted-by":"crossref","unstructured":"Gold, E.M.: Language identification in the limit. Information and Control\u00a010(5) (1967)","DOI":"10.1016\/S0019-9958(67)91165-5"},{"issue":"3","key":"51_CR18","doi-asserted-by":"publisher","first-page":"302","DOI":"10.1016\/S0019-9958(78)90562-4","volume":"37","author":"E.M. Gold","year":"1978","unstructured":"Gold, E.M.: Complexity of automaton identification from given data. Information and Control\u00a037(3), 302\u2013320 (1978)","journal-title":"Information and Control"},{"key":"51_CR19","doi-asserted-by":"crossref","unstructured":"Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. Tools and Algorithms for Construction and Analysis of Systems, 357\u2013370 (2002)","DOI":"10.1007\/3-540-46002-0_25"},{"key":"51_CR20","unstructured":"Habermehl, P., Vojnar, T.: Regular model checking using inference of regular languages. In: Proc. of INFINITY 2004 (2004)"},{"key":"51_CR21","series-title":"Advances in Structural and Syntactic Pattern Recognition","volume-title":"Identifying regular languages in polynomial time.","author":"P. Garc\u00eda","year":"1992","unstructured":"Garc\u00eda, P., Oncina, J.: Identifying regular languages in polynomial time. Advances in Structural and Syntactic Pattern Recognition. World Scientific Publishing, Singapore (1992)"},{"key":"51_CR22","doi-asserted-by":"crossref","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black box checking. In: FORTE\/PSTV (1999)","DOI":"10.1007\/978-0-387-35578-8_13"},{"key":"51_CR23","doi-asserted-by":"crossref","unstructured":"Pnueli, A.: In transition from global to modular temporal reasoning about programs. Logics and models of concurrent systems, 123\u2013144 (1985)","DOI":"10.1007\/978-3-642-82453-1_5"},{"issue":"2","key":"51_CR24","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"R.L. Rivest","year":"1993","unstructured":"Rivest, R.L., Schapire, R.E.: Inference of finite automata using homing sequences. Information and Computation\u00a0103(2), 299\u2013347 (1993)","journal-title":"Information and Computation"},{"issue":"2-3","key":"51_CR25","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1016\/0304-3975(90)90017-C","volume":"76","author":"Y. Sakakibara","year":"1990","unstructured":"Sakakibara, Y.: Learning context-free grammars from structural data in polynomial time. Theoretical Computer Science (TCS)\u00a076(2-3), 223\u2013242 (1990)","journal-title":"Theoretical Computer Science (TCS)"}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11513988_51.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T20:05:14Z","timestamp":1605643514000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11513988_51"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540272311","9783540316862"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/11513988_51","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}