{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,9]],"date-time":"2026-06-09T08:45:13Z","timestamp":1780994713941,"version":"3.54.1"},"reference-count":56,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2013,10,4]],"date-time":"2013-10-04T00:00:00Z","timestamp":1380844800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2014,7]]},"DOI":"10.1007\/s10994-013-5419-7","type":"journal-article","created":{"date-parts":[[2013,10,3]],"date-time":"2013-10-03T15:42:35Z","timestamp":1380814955000},"page":"65-98","source":"Crossref","is-referenced-by-count":48,"title":["Learning register automata: from languages to program structures"],"prefix":"10.1007","volume":"96","author":[{"given":"Malte","family":"Isberner","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Falk","family":"Howar","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2013,10,4]]},"reference":[{"key":"5419_CR1","volume-title":"FM 2012","author":"F. Aarts","year":"2012","unstructured":"Aarts, F., Heidarian, F., Kuppens, H., Olsen, P., & Vaandrager, F. (2012a). Automata learning through counterexample-guided abstraction refinement. In FM 2012. doi: 10.1007\/978-3-642-32759-9_4"},{"key":"5419_CR2","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"240","DOI":"10.1007\/978-3-642-32940-1_18","volume-title":"CONCUR","author":"F. Aarts","year":"2012","unstructured":"Aarts, F., Heidarian, F., & Vaandrager, F. W. (2012b). A theory of history dependent abstractions for learning interface automata. In M. Koutny & I. Ulidowski (Eds.), Lecture notes in computer science: Vol.\u00a07454. CONCUR (pp. 240\u2013255). Berlin: Springer."},{"key":"5419_CR3","volume-title":"ICTSS 2010","author":"F. Aarts","year":"2010","unstructured":"Aarts, F., Jonsson, B., & Uijen, J. (2010). Generating models of infinite-state communication protocols using regular inference with abstraction. In ICTSS 2010."},{"key":"5419_CR4","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"673","DOI":"10.1007\/978-3-642-16558-0_54","volume-title":"Leveraging applications of formal methods, verification, and validation\u20144th international symposium on leveraging applications, ISoLA 2010, proceedings, part\u00a0I","author":"F. Aarts","year":"2010","unstructured":"Aarts, F., Schmaltz, J., & Vaandrager, F. W. (2010). Inference and abstraction of the biometric passport. In T. Margaria & B. Steffen (Eds.), Lecture notes in computer science: Vol.\u00a06415. Leveraging applications of formal methods, verification, and validation\u20144th international symposium on leveraging applications, ISoLA 2010, proceedings, part\u00a0I, Heraklion, Crete, Greece, October 18\u201321, 2010 (pp.\u00a0673\u2013686). Berlin: Springer."},{"key":"5419_CR5","series-title":"LNCS","doi-asserted-by":"crossref","first-page":"71","DOI":"10.1007\/978-3-642-15375-4_6","volume-title":"CONCUR 2010","author":"F. Aarts","year":"2010","unstructured":"Aarts, F., & Vaandrager, F. (2010). Learning I\/O automata. In LNCS: Vol.\u00a06269. CONCUR 2010 (pp. 71\u201385)."},{"key":"5419_CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/0304-3975(94)90010-8","volume":"126","author":"R. Alur","year":"1994","unstructured":"Alur, R., & Dill, D. L. (1994). A theory of timed automata. Theoretical Computer Science, 126, 183\u2013235.","journal-title":"Theoretical Computer Science"},{"key":"5419_CR7","doi-asserted-by":"crossref","first-page":"4","DOI":"10.1145\/503272.503275","volume-title":"POPL","author":"G. Ammons","year":"2002","unstructured":"Ammons, G., Bod\u00edk, R., & Larus, J. R. (2002). Mining specifications. In POPL (pp. 4\u201316)."},{"issue":"2","key":"5419_CR8","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. Information and Computation, 75(2), 87\u2013106.","journal-title":"Information and Computation"},{"key":"5419_CR9","doi-asserted-by":"crossref","first-page":"61","DOI":"10.1007\/978-3-642-28033-7_6","volume-title":"Eternal systems, CCIS","author":"O. Bauer","year":"2012","unstructured":"Bauer, O., Neubauer, J., Steffen, B., & Howar, F. (2012). Reusing system states by active learning algorithms. In Eternal systems, CCIS (Vol.\u00a0255, pp. 61\u201378)."},{"key":"5419_CR10","series-title":"LNCS","first-page":"107","volume-title":"FASE 2006","author":"T. Berg","year":"2006","unstructured":"Berg, T., Jonsson, B., & Raffelt, H. (2006). Regular inference for state machines with parameters. In LNCS: Vol.\u00a03922. FASE 2006 (pp. 107\u2013121)."},{"key":"5419_CR11","series-title":"LNCS","first-page":"317","volume-title":"FASE 2008","author":"T. Berg","year":"2008","unstructured":"Berg, T., Jonsson, B., & Raffelt, H. (2008). Regular inference for state machines using domains with equality tests. In LNCS: Vol.\u00a04961. FASE 2008 (pp. 317\u2013331)."},{"key":"5419_CR12","unstructured":"Bertolino, A., Calabr\u00f2, A., Merten, M., & Steffen, B. (2012). Never-stop learning: Continuous validation of learned models for evolving systems through monitoring. ERCIM News, 2012(88)."},{"key":"5419_CR13","first-page":"443","volume-title":"POPL\u201913: proceedings of the 40th ACM SIGPLAN-SIGACT symposium on principles of programming languages","author":"M. Botin\u010dan","year":"2013","unstructured":"Botin\u010dan, M., & Babi\u0107, D. (2013). Sigma*: symbolic learning of input-output specifications. In POPL\u201913: proceedings of the 40th ACM SIGPLAN-SIGACT symposium on principles of programming languages (pp. 443\u2013456). New York: ACM."},{"key":"5419_CR14","series-title":"LNCS","first-page":"366","volume-title":"ATVA","author":"S. Cassel","year":"2011","unstructured":"Cassel, S., Howar, F., Jonsson, B., Merten, M., & Steffen, B. (2011). A succinct canonical register automaton model. In LNCS: Vol.\u00a06996. ATVA (pp.\u00a0366\u2013380)."},{"key":"5419_CR15","volume-title":"ATVA","author":"S. Cassel","year":"2012","unstructured":"Cassel, S., Jonsson, B., Howar, F., & Steffen, B. (2012). A succinct canonical register automaton model for data domains with binary relations. In ATVA. doi: 10.1007\/978-3-642-33386-6_6"},{"issue":"3","key":"5419_CR16","doi-asserted-by":"crossref","first-page":"178","DOI":"10.1109\/TSE.1978.231496","volume":"4","author":"T. S. Chow","year":"1978","unstructured":"Chow, T. S. (1978). Testing software design modeled by finite-state machines. IEEE Transactions on Software Engineering, 4(3), 178\u2013187.","journal-title":"IEEE Transactions on Software Engineering"},{"key":"5419_CR17","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1007\/3-540-36577-X_24","volume-title":"Proc. TACAS\u201903, 9th int. conf. on tools and algorithms for the construction and analysis of systems","author":"J. M. Cobleigh","year":"2003","unstructured":"Cobleigh, J. M., Giannakopoulou, D., & Pasareanu, C. S. (2003). Learning assumptions for compositional verification. In Lecture notes in computer science: Vol.\u00a02619. Proc. TACAS\u201903, 9th int. conf. on tools and algorithms for the construction and analysis of systems (pp. 331\u2013346). Berlin: Springer."},{"issue":"1\u20133","key":"5419_CR18","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/j.scico.2007.01.015","volume":"69","author":"M. D. Ernst","year":"2007","unstructured":"Ernst, M. D., Perkins, J. H., Guo, P. J., McCamant, S., Pacheco, C., Tschantz, M. S., & Xiao, C. (2007). The Daikon system for dynamic detection of likely invariants. Science of Computer Programming, 69(1\u20133), 35\u201345.","journal-title":"Science of Computer Programming"},{"key":"5419_CR19","first-page":"276","volume-title":"Proc. of the 19th int. conf. on tools and algorithms for the construction and analysis of systems (TACAS\u201907)","author":"M. Gheorghiu","year":"2007","unstructured":"Gheorghiu, M., Giannakopoulou, D., & P\u0103s\u0103reanu, C. (2007). Refining interface alphabets for compositional verification. In Proc. of the 19th int. conf. on tools and algorithms for the construction and analysis of systems (TACAS\u201907) (pp. 276\u2013291)."},{"key":"5419_CR20","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1007\/978-3-642-33125-1_18","volume-title":"Static analysis","author":"D. Giannakopoulou","year":"2012","unstructured":"Giannakopoulou, D., Rakamari\u0107, Z., & Raman, V. (2012). Symbolic learning of component interfaces. In A.\u00a0Min\u00e9 & D. Schmidt (Eds.), Lecture notes in computer science: Vol.\u00a07460. Static analysis (pp. 248\u2013264). Berlin: Springer. doi: 10.1007\/978-3-642-33125-1_18 ."},{"issue":"47","key":"5419_CR21","doi-asserted-by":"crossref","first-page":"4029","DOI":"10.1016\/j.tcs.2010.07.008","volume":"411","author":"O. Grinchtein","year":"2010","unstructured":"Grinchtein, O., Jonsson, B., & Leucker, M. (2010). Learning of event-recording automata. Theoretical Computer Science, 411(47), 4029\u20134054.","journal-title":"Theoretical Computer Science"},{"key":"5419_CR22","doi-asserted-by":"crossref","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., & Yannakakis, M. (2002). Adaptive model checking. In Tools and algorithms for the construction and analysis of systems (pp. 357\u2013370). Berlin: Springer."},{"key":"5419_CR23","series-title":"LNCS","first-page":"80","volume-title":"FASE 2002","author":"A. Hagerer","year":"2002","unstructured":"Hagerer, A., Hungar, H., Niese, O., & Steffen, B. (2002). Model generation by moderated regular extrapolation. In LNCS: Vol.\u00a02306. FASE 2002 (pp. 80\u201395)."},{"key":"5419_CR24","first-page":"1033","volume":"55","author":"A. Hagerer","year":"2001","unstructured":"Hagerer, A., Margaria, T., Niese, O., Steffen, B., Brune, G., & Ide, H. D. (2001). Efficient regression testing of CTI-systems: testing a complex call-center solution. annual review of communication. International Engineering Consortium (IEC), 55, 1033\u20131040.","journal-title":"International Engineering Consortium (IEC)"},{"key":"5419_CR25","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9781139194655","volume-title":"Grammatical inference: learning automata and grammars","author":"C. Higuera De la","year":"2010","unstructured":"De la Higuera, C. (2010). Grammatical inference: learning automata and grammars. Cambridge: Cambridge University Press."},{"key":"5419_CR26","series-title":"Addison-Wesley series in computer science","volume-title":"Introduction to automata theory, languages, and computation","author":"J. E. Hopcroft","year":"2001","unstructured":"Hopcroft, J. E., Motwani, R., & Ullman, J. D. (2001). Introduction to automata theory, languages, and computation. Addison-Wesley series in computer science (2nd ed.). Reading: Addison-Wesley.","edition":"2"},{"key":"5419_CR27","volume-title":"ISoLA 2012","author":"F. Howar","year":"2012","unstructured":"Howar, F., Isberner, M., Steffen, B., Bauer, O., & Jonsson, B. (2012, to appear) Inferring semantic interfaces of data structures. In: ISoLA 2012."},{"key":"5419_CR28","series-title":"LNCS","first-page":"251","volume-title":"VMCAI 2012","author":"F. Howar","year":"2012","unstructured":"Howar, F., Steffen, B., Jonsson, B., & Cassel, S. (2012). Inferring canonical register automata. In LNCS: Vol.\u00a07148. VMCAI 2012 (pp. 251\u2013266)."},{"key":"5419_CR29","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"687","DOI":"10.1007\/978-3-642-16558-0_55","volume-title":"Leveraging applications of formal methods, verification, and validation\u20144th international symposium on leveraging applications, ISoLA 2010, proceedings, part\u00a0I","author":"F. Howar","year":"2010","unstructured":"Howar, F., Steffen, B., & Merten, M. (2010). From ZULU to RERS\u2014lessons learned in the ZULU challenge. In: T. Margaria & B. Steffen (Eds.) Lecture notes in computer science: Vol.\u00a06415. Leveraging applications of formal methods, verification, and validation\u20144th international symposium on leveraging applications, ISoLA 2010, proceedings, part\u00a0I, Heraklion, Crete, Greece, October 18\u201321, 2010 (pp.\u00a0687\u2013704). Berlin: Springer."},{"key":"5419_CR30","series-title":"LNCS","first-page":"263","volume-title":"VMCAI 2011","author":"F. Howar","year":"2011","unstructured":"Howar, F., Steffen, B., & Merten, M. (2011). Automata learning with automated alphabet abstraction refinement. In LNCS: Vol.\u00a06538. VMCAI 2011 (pp. 263\u2013277)."},{"key":"5419_CR31","doi-asserted-by":"crossref","first-page":"315","DOI":"10.1007\/978-3-540-45069-6_31","volume-title":"Proc. 15th int. conf. on computer aided verification","author":"H. Hungar","year":"2003","unstructured":"Hungar, H., Niese, O., & Steffen, B. (2003). Domain-specific optimization in automata learning. In Proc. 15th int. conf. on computer aided verification (pp. 315\u2013327). Berlin: Springer."},{"key":"5419_CR32","first-page":"133","volume-title":"Proceedings of the 11th international conference on grammatical inference, ICGI 2012","author":"M. N. Irfan","year":"2012","unstructured":"Irfan, M. N., Groz, R., & Oriat, C. (2012). Improving model inference of black box components having large input test set. In Proceedings of the 11th international conference on grammatical inference, ICGI 2012 (pp. 133\u2013138)."},{"key":"5419_CR33","doi-asserted-by":"crossref","first-page":"11","DOI":"10.1145\/1868044.1868046","volume-title":"Proceedings of the first international workshop on model inference in testing, MIIT\u201910","author":"M. N. Irfan","year":"2010","unstructured":"Irfan, M. N., Oriat, C., & Groz, R. (2010). Angluin-style finite state machine inference with non-optimal counterexamples. In Proceedings of the first international workshop on model inference in testing, MIIT\u201910 (pp. 11\u201319)."},{"key":"5419_CR34","first-page":"154","volume-title":"ICECCS 2009","author":"V. Issarny","year":"2009","unstructured":"Issarny, V., Steffen, B., Jonsson, B., Blair, G. S., Grace, P., Kwiatkowska, M. Z., Calinescu, R., Inverardi, P., Tivoli, M., Bertolino, A., & Sabetta, A. (2009). CONNECT challenges: towards emergent connectors for eternal networked systems. In ICECCS 2009 (pp. 154\u2013161)."},{"key":"5419_CR35","series-title":"LNCS","first-page":"327","volume-title":"SFM 2011","author":"B. Jonsson","year":"2011","unstructured":"Jonsson, B. (2011). Learning of automata models extended with data. In LNCS: Vol.\u00a06659. SFM 2011 (pp.\u00a0327\u2013349)."},{"issue":"7","key":"5419_CR36","doi-asserted-by":"crossref","first-page":"385","DOI":"10.1145\/360248.360252","volume":"19","author":"J. C. King","year":"1976","unstructured":"King, J. C. (1976). Symbolic execution and program testing. Communications of the ACM, 19(7), 385\u2013394.","journal-title":"Communications of the ACM"},{"key":"5419_CR37","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BFb0054059","volume-title":"Grammatical inference","author":"K. J. Lang","year":"1998","unstructured":"Lang, K. J., Pearlmutter, B. A., & Price, R. A. (1998). Results of the abbadingo one dfa learning competition and a new evidence-driven state merging algorithm. In Grammatical inference (pp. 1\u201312). Berlin: Springer."},{"key":"5419_CR38","first-page":"501","volume-title":"ICSE 2008","author":"D. Lorenzoli","year":"2008","unstructured":"Lorenzoli, D., Mariani, L., & Pezz\u00e8, M. (2008). Automatic generation of software behavioral models. In ICSE 2008 (pp. 501\u2013510). New York: ACM."},{"issue":"2","key":"5419_CR39","doi-asserted-by":"crossref","first-page":"316","DOI":"10.1006\/inco.1995.1070","volume":"118","author":"O. Maler","year":"1995","unstructured":"Maler, O., & Pnueli, A. (1995). On the learnability of infinitary regular sets. Information and Computation, 118(2), 316\u2013326.","journal-title":"Information and Computation"},{"key":"5419_CR40","first-page":"95","volume-title":"HLDVT 2004","author":"T. Margaria","year":"2004","unstructured":"Margaria, T., Niese, O., Raffelt, H., & Steffen, B. (2004). Efficient test-based model generation for legacy reactive systems. In HLDVT 2004 (pp.\u00a095\u2013100). Los Alamitos: IEEE Comput. Soc.."},{"issue":"2","key":"5419_CR41","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1007\/s11334-005-0016-y","volume":"1","author":"T. Margaria","year":"2005","unstructured":"Margaria, T., Raffelt, H., & Steffen, B. (2005). Knowledge-based relevance filtering for efficient system-level test-based model generation. Innovations in Systems and Software Engineering, 1(2), 147\u2013156.","journal-title":"Innovations in Systems and Software Engineering"},{"key":"5419_CR42","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"97","DOI":"10.1007\/978-3-642-24580-0_8","volume-title":"Testing software and systems","author":"K. Meinke","year":"2011","unstructured":"Meinke, K., & Niu, F. (2011). Learning-based testing for reactive systems using term rewriting technology. In B. Wolff & F. Za\u00efdi (Eds.), Lecture notes in computer science: Vol.\u00a07019. Testing software and systems (pp. 97\u2013114). Berlin: Springer."},{"key":"5419_CR43","series-title":"Lecture notes in computer science","doi-asserted-by":"crossref","first-page":"488","DOI":"10.1007\/978-3-642-34026-0_36","volume-title":"Leveraging applications of formal methods, verification and validation. technologies for mastering change","author":"K. Meinke","year":"2012","unstructured":"Meinke, K., & Niu, F. (2012). An incremental learning algorithm for extended mealy automata. In T. Margaria & B. Steffen (Eds.), Lecture notes in computer science: Vol.\u00a07609. Leveraging applications of formal methods, verification and validation. technologies for mastering change (pp. 488\u2013504). Berlin: Springer."},{"issue":"4","key":"5419_CR44","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1090\/S0002-9939-1958-0135681-9","volume":"9","author":"A. Nerode","year":"1958","unstructured":"Nerode, A. (1958). Linear automaton transformations. Proceedings of the American Mathematical Society, 9(4), 541\u2013544.","journal-title":"Proceedings of the American Mathematical Society"},{"key":"5419_CR45","unstructured":"Niese, O. (2003). An Integrated Approach to Testing Complex Systems. Ph.D. thesis, University of Dortmund, Germany."},{"key":"5419_CR46","first-page":"225","volume-title":"Proceedings of the IFIP TC6 WG6","author":"D. Peled","year":"1999","unstructured":"Peled, D., Vardi, M. Y., & Yannakakis, M. (1999). Black box checking. In Proceedings of the IFIP TC6 WG6 (Vol.\u00a01, pp. 225\u2013240)."},{"issue":"4","key":"5419_CR47","doi-asserted-by":"crossref","first-page":"307","DOI":"10.1007\/s10009-009-0120-7","volume":"11","author":"H. Raffelt","year":"2009","unstructured":"Raffelt, H., Merten, M., Steffen, B., & Margaria, T. (2009). Dynamic testing via automata learning. International Journal on Software Tools for Technology Transfer, 11(4), 307\u2013324.","journal-title":"International Journal on Software Tools for Technology Transfer"},{"issue":"2","key":"5419_CR48","doi-asserted-by":"crossref","first-page":"299","DOI":"10.1006\/inco.1993.1021","volume":"103","author":"R. L. Rivest","year":"1993","unstructured":"Rivest, R. L., & Schapire, R. E. (1993). Inference of finite automata using homing sequences. Information and Computation, 103(2), 299\u2013347.","journal-title":"Information and Computation"},{"key":"5419_CR49","first-page":"207","volume-title":"FM\u201909: proceedings of the 2nd world Congress on formal methods","author":"M. Shahbaz","year":"2009","unstructured":"Shahbaz, M., & Groz, R. (2009). Inferring mealy machines. In FM\u201909: proceedings of the 2nd world Congress on formal methods (pp. 207\u2013222). Berlin: Springer."},{"key":"5419_CR50","first-page":"319","volume-title":"TestCom\/FATES","author":"M. Shahbaz","year":"2007","unstructured":"Shahbaz, M., Li, K., & Groz, R. (2007a). Learning and integration of parameterized components through testing. In TestCom\/FATES (pp. 319\u2013334). Berlin: Springer."},{"key":"5419_CR51","first-page":"755","volume-title":"COMPSAC 2007","author":"M. Shahbaz","year":"2007","unstructured":"Shahbaz, M., Li, K., & Groz, R. (2007b). Learning parameterized state machine model for integration testing. In COMPSAC 2007 (Vol.\u00a02, pp. 755\u2013760). Los Alamitos: IEEE Comput. Soc.."},{"key":"5419_CR52","first-page":"276","volume-title":"ISSTA 2011","author":"M. Shahbaz","year":"2011","unstructured":"Shahbaz, M., Shashidhar, K. C., & Eschbach, R. (2011). Iterative refinement of specification for component based embedded systems. In ISSTA 2011 (pp. 276\u2013286)."},{"key":"5419_CR53","series-title":"JMLR W&CP","first-page":"195","volume-title":"ICGI 2012","author":"B. Steffen","year":"2012","unstructured":"Steffen, B., Howar, F., & Isberner, M. (2012). Active automata learning: from DFAs to interface programs and beyond. In JMLR W&CP: Vol.\u00a021. ICGI 2012 (pp.\u00a0195\u2013209)."},{"key":"5419_CR54","series-title":"LNCS","first-page":"256","volume-title":"SFM 2011","author":"B. Steffen","year":"2011","unstructured":"Steffen, B., Howar, F., & Merten, M. (2011). Introduction to active automata learning from a practical perspective. In LNCS: Vol.\u00a06659. SFM 2011 (pp. 256\u2013296)."},{"issue":"4","key":"5419_CR55","doi-asserted-by":"crossref","first-page":"653","DOI":"10.1007\/BF01068590","volume":"9","author":"M. Vasilevskii","year":"1973","unstructured":"Vasilevskii, M. (1973). Failure diagnosis of automata. Cybernetics, 9(4), 653\u2013665.","journal-title":"Cybernetics"},{"key":"5419_CR56","first-page":"126","volume-title":"Proceedings of the 22nd IFIP WG 6.1 international conference on testing software and systems, ICTSS\u201910","author":"N. Walkinshaw","year":"2010","unstructured":"Walkinshaw, N., Bogdanov, K., Derrick, J., & Paris, J. (2010). Increasing functional coverage by inductive testing: a case study. In Proceedings of the 22nd IFIP WG 6.1 international conference on testing software and systems, ICTSS\u201910 (pp. 126\u2013141)."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-013-5419-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-013-5419-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-013-5419-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,5]],"date-time":"2023-07-05T01:30:51Z","timestamp":1688520651000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-013-5419-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,10,4]]},"references-count":56,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2014,7]]}},"alternative-id":["5419"],"URL":"https:\/\/doi.org\/10.1007\/s10994-013-5419-7","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013,10,4]]}}}