{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T14:29:12Z","timestamp":1742394552481},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540462194"},{"type":"electronic","value":"9783540462200"}],"license":[{"start":{"date-parts":[[2006,1,1]],"date-time":"2006-01-01T00:00:00Z","timestamp":1136073600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2006]]},"DOI":"10.1007\/11888116_30","type":"book-chapter","created":{"date-parts":[[2006,10,3]],"date-time":"2006-10-03T14:06:43Z","timestamp":1159884403000},"page":"420-435","source":"Crossref","is-referenced-by-count":15,"title":["Grey-Box Checking"],"prefix":"10.1007","author":[{"given":"Edith","family":"Elkind","sequence":"first","affiliation":[]},{"given":"Blaise","family":"Genest","sequence":"additional","affiliation":[]},{"given":"Doron","family":"Peled","sequence":"additional","affiliation":[]},{"given":"Hongyang","family":"Qu","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"30_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","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.: Symbolic Compositional Verification by Learning Assumptions. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol.\u00a03576, pp. 548\u2013562. Springer, Heidelberg (2005)"},{"key":"30_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":"30_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"280","DOI":"10.1007\/10722167_23","volume-title":"Computer Aided Verification","author":"R. Alur","year":"2000","unstructured":"Alur, R., Grosu, R., McDougall, M.: Efficient Reachability Analysis of Hierarchical Reactive Machines. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol.\u00a01855, pp. 280\u2013295. Springer, Heidelberg (2000)"},{"key":"30_CR4","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"30_CR5","first-page":"353","volume-title":"LICS 1989","author":"E. Clarke","year":"1989","unstructured":"Clarke, E., Long, D., McMillan, K.: Compositional Model Checking. In: LICS 1989, pp. 353\u2013362. IEEE, Los Alamitos (1989)"},{"key":"30_CR6","doi-asserted-by":"publisher","first-page":"178","DOI":"10.1109\/TSE.1978.231496","volume":"SE-4","author":"T.S. Chow","year":"1978","unstructured":"Chow, T.S.: Testing software design modeled by finite-states machines. IEEE transactions on software engineering\u00a0SE-4, 178\u2013187 (1978)","journal-title":"IEEE transactions on software engineering"},{"key":"30_CR7","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":"30_CR8","unstructured":"Elkind, E., Genest, B., Peled, D., Qu, H.: Grey-Box Checking. Internal Report, Available at: \n                    \n                      http:\/\/www.crans.org\/~genest\/EGPQ.ps"},{"key":"30_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/3-540-46002-0_25","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A. Groce","year":"2002","unstructured":"Groce, A., Peled, D.A., Yannakakis, M.: Adaptive Model Checking. In: Katoen, J.-P., Stevens, P. (eds.) TACAS 2002. LNCS, vol.\u00a02280, pp. 357\u2013370. Springer, Heidelberg (2002)"},{"key":"30_CR10","series-title":"Lecture Notes in Computer Science","first-page":"279","volume-title":"Proceedings of Advances in Petri Nets, 1986","author":"A. Mazurkiewicz","year":"1987","unstructured":"Mazurkiewicz, A.: Trace Semantics. In: Honnef, B. Proceedings of Advances in Petri Nets, 1986. LNCS, pp. 279\u2013324. Springer, Heidelberg (1987)"},{"key":"30_CR11","unstructured":"Ochmanski, E.: Languages and Automata. In: Diekert, V., Rozenberg, G. (eds.) The Book of Traces, pp. 167\u2013204. World Scientific, Singapore"},{"key":"30_CR12","doi-asserted-by":"crossref","unstructured":"Peled, D., Vardi, M., Yannakakis, M.: Black Box Checking. In: FORTE\/PSTV 1999 (1999)","DOI":"10.1007\/978-0-387-35578-8_13"},{"issue":"2","key":"30_CR13","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"R. Rivest","year":"1993","unstructured":"Rivest, R., Schapire, R.: Inference of Finite Automata Using Homing Sequences. Information and Computation\u00a0103(2), 299\u2013347 (1993)","journal-title":"Information and Computation"},{"key":"30_CR14","first-page":"98","volume":"4","author":"M.P. Vasilevskii","year":"1973","unstructured":"Vasilevskii, M.P.: Failure diagnosis of automata. Kibertetika\u00a04, 98\u2013108 (1973)","journal-title":"Kibertetika"},{"key":"30_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"461","DOI":"10.1007\/978-3-540-31980-1_30","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"W. Weimer","year":"2005","unstructured":"Weimer, W., Necula, G.C.: Mining Temporal Specifications for Error Detection. In: Halbwachs, N., Zuck, L.D. (eds.) TACAS 2005. LNCS, vol.\u00a03440, pp. 461\u2013476. Springer, Heidelberg (2005)"},{"key":"30_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"170","DOI":"10.1007\/11759744_12","volume-title":"Formal Approaches to Software Testing","author":"G. Xie","year":"2006","unstructured":"Xie, G., Dang, Z.: Testing Systems of Concurrent Black-Boxes\u2014An Automata-Theoretic and Decompositional Approach. In: Grieskamp, W., Weise, C. (eds.) FATES 2005. LNCS, vol.\u00a03997, pp. 170\u2013186. Springer, Heidelberg (2006)"}],"container-title":["Lecture Notes in Computer Science","Formal Techniques for Networked and Distributed Systems - FORTE 2006"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11888116_30","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,13]],"date-time":"2019-03-13T23:29:30Z","timestamp":1552519770000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11888116_30"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2006]]},"ISBN":["9783540462194","9783540462200"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/11888116_30","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2006]]}}}