{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,5]],"date-time":"2026-02-05T11:35:57Z","timestamp":1770291357909,"version":"3.49.0"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642217678","type":"print"},{"value":"9783642217685","type":"electronic"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-21768-5_11","type":"book-chapter","created":{"date-parts":[[2011,6,27]],"date-time":"2011-06-27T13:18:53Z","timestamp":1309180733000},"page":"134-151","source":"Crossref","is-referenced-by-count":52,"title":["Incremental Learning-Based Testing for Reactive Systems"],"prefix":"10.1007","author":[{"given":"Karl","family":"Meinke","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Muddassar A.","family":"Sindhu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"1","key":"11_CR1","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1016\/S0019-9958(81)90090-5","volume":"51","author":"D. Angluin","year":"1981","unstructured":"Angluin, D.: A note on the number of queries needed to identify regular languages. Information and Control\u00a051(1), 76\u201387 (1981)","journal-title":"Information and Control"},{"issue":"1","key":"11_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(1), 87\u2013106 (1987)","journal-title":"Information and Computation"},{"key":"11_CR3","unstructured":"Bohlin, T., Jonsson, B.: Regular inference for communication protocol entities. Technical Report 2008-024, Dept. of Information Technology, Uppsala University (2008)"},{"key":"11_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"495","DOI":"10.1007\/3-540-48683-6_44","volume-title":"Computer Aided Verification","author":"A. Cimatti","year":"1999","unstructured":"Cimatti, A., Clarke, E., Giunchiglia, F., Roveri, M.: NUSMV: A new symbolic model verifier. In: Halbwachs, N., Peled, D.A. (eds.) CAV 1999. LNCS, vol.\u00a01633, pp. 495\u2013499. Springer, Heidelberg (1999)"},{"key":"11_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"265","DOI":"10.1007\/3-540-45657-0_20","volume-title":"Computer Aided Verification","author":"E. Clarke","year":"2002","unstructured":"Clarke, E., Gupta, A., Kukula, J., Strichman, O.: SAT based abstraction-refinement using ILP and machine learning techniques. In: Brinksma, E., Larsen, K.G. (eds.) CAV 2002. LNCS, vol.\u00a02404, p. 265. Springer, Heidelberg (2002)"},{"key":"11_CR6","volume-title":"Model Checking","author":"E.M. Clarke","year":"1999","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (1999)"},{"key":"11_CR7","series-title":"LNAI","volume-title":"Grammatical Inference: Learning Syntax from Sentences","author":"P. Dupont","year":"1996","unstructured":"Dupont, P.: Incremental regular inference. In: Miclet, L., de la Higuera, C. (eds.) ICGI 1996. LNCS (LNAI), vol.\u00a01147. Springer, Heidelberg (1996)"},{"issue":"5","key":"11_CR8","doi-asserted-by":"publisher","first-page":"729","DOI":"10.1093\/jigpal\/jzl007","volume":"14","author":"A. Groce","year":"2006","unstructured":"Groce, A., Peled, D., Yannakakis, M.: Adaptive model checking. Logic Journal of the IGPL\u00a014(5), 729\u2013744 (2006)","journal-title":"Logic Journal of the IGPL"},{"key":"11_CR9","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1145\/1007512.1007532","volume-title":"ISSTA 2004: Proceedings of the 2004 ACM SIGSOFT International Symposium on Software Testing and Analysis","author":"K. Meinke","year":"2004","unstructured":"Meinke, K.: Automated black-box testing of functional correctness using function approximation. In: ISSTA 2004: Proceedings of the 2004 ACM SIGSOFT International Symposium on Software Testing and Analysis, pp. 143\u2013153. ACM, New York (2004)"},{"key":"11_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"148","DOI":"10.1007\/978-3-642-15488-1_13","volume-title":"Proc. Tenth Int. Colloq. on Grammatical Inference (ICGI 2010)","author":"K. Meinke","year":"2010","unstructured":"Meinke, K.: Cge: A sequential learning algorithm for mealy automata. In: Sempere, J.M., Garc\u00eda, P. (eds.) ICGI 2010. LNCS, vol.\u00a06339, pp. 148\u2013162. Springer, Heidelberg (2010)"},{"key":"11_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1007\/978-3-642-16573-3_16","volume-title":"Testing Software and Systems","author":"K. Meinke","year":"2010","unstructured":"Meinke, K., Niu, F.: A learning-based approach to unit testing of numerical software. In: Petrenko, A., Sim\u00e3o, A., Maldonado, J.C. (eds.) ICTSS 2010. LNCS, vol.\u00a06435, pp. 221\u2013235. Springer, Heidelberg (2010)"},{"key":"11_CR12","unstructured":"Meinke, K., Sindhu, M.: Correctness and performance of an incremental learning algorithm for kripke structures. Technical report, School of Computer Science and Communication, Royal Institute of Technology, Stockholm (2010)"},{"key":"11_CR13","first-page":"189","volume-title":"Handbook of Logic in Computer Science","author":"K. Meinke","year":"1993","unstructured":"Meinke, K., Tucker, J.V.: Universal algebra. In: Handbook of Logic in Computer Science, 1st edn., pp. 189\u2013411. Oxford University Press, Oxford (1993)","edition":"1"},{"key":"11_CR14","unstructured":"Norton, D.A.: Algorithms for testing equivalence of finite state automata, with a grading tool for jflap. Technical report, Rochester Institute of Technology, Department of Computer Science (2009)"},{"key":"11_CR15","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"37","DOI":"10.1007\/BFb0054062","volume-title":"Grammatical Inference","author":"R.G. Parekh","year":"1998","unstructured":"Parekh, R.G., Nichitiu, C., Honavar, V.G.: A polynomial time incremental algorithm for regular grammar inference. In: Honavar, V.G., Slutzki, G. (eds.) ICGI 1998. LNCS (LNAI), vol.\u00a01433, p. 37. Springer, Heidelberg (1998)"},{"key":"11_CR16","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1007\/978-0-387-35578-8_13","volume-title":"Formal Methods for Protocol Engineering and Distributed Systems FORTE\/PSTV","author":"D. Peled","year":"1999","unstructured":"Peled, D., Vardi, M.Y., Yannakakis, M.: Black-box checking. In: Formal Methods for Protocol Engineering and Distributed Systems FORTE\/PSTV, pp. 225\u2013240. Kluwer, Dordrecht (1999)"},{"key":"11_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"136","DOI":"10.1007\/978-3-540-77966-7_13","volume-title":"Hardware and Software: Verification and Testing","author":"H. Raffelt","year":"2008","unstructured":"Raffelt, H., Steffen, B., Margaria, T.: Dynamic testing via automata learning. In: Yorav, K. (ed.) HVC 2007. LNCS, vol.\u00a04899, pp. 136\u2013152. Springer, Heidelberg (2008)"},{"key":"11_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"126","DOI":"10.1007\/978-3-642-16573-3_10","volume-title":"Testing Software and Systems","author":"N. Walkinshaw","year":"2010","unstructured":"Walkinshaw, N., Bogdanov, K., Derrick, J., Paris, J.: Increasing functional coverage by inductive testing: a case study. In: Petrenko, A., Sim\u00e3o, A., Maldonado, J.C. (eds.) ICTSS 2010. LNCS, vol.\u00a06435, pp. 126\u2013141. Springer, Heidelberg (2010)"}],"container-title":["Lecture Notes in Computer Science","Tests and Proofs"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-21768-5_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,1,26]],"date-time":"2019-01-26T01:49:15Z","timestamp":1548467355000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-21768-5_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642217678","9783642217685"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-21768-5_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2011]]}}}