{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,4]],"date-time":"2026-02-04T15:51:03Z","timestamp":1770220263612,"version":"3.49.0"},"reference-count":53,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2015,3,17]],"date-time":"2015-03-17T00:00:00Z","timestamp":1426550400000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Empir Software Eng"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10664-015-9367-7","type":"journal-article","created":{"date-parts":[[2015,3,16]],"date-time":"2015-03-16T08:59:45Z","timestamp":1426496385000},"page":"811-853","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":100,"title":["Inferring extended finite state machine models from software executions"],"prefix":"10.1007","volume":"21","author":[{"given":"Neil","family":"Walkinshaw","sequence":"first","affiliation":[]},{"given":"Ramsay","family":"Taylor","sequence":"additional","affiliation":[]},{"given":"John","family":"Derrick","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2015,3,17]]},"reference":[{"key":"9367_CR1","doi-asserted-by":"crossref","unstructured":"Aarts F, Heidarian F, Kuppens H, Olsen P, Vaandrager F (2012) Automata learning through counterexample-guided abstraction refinement. In: In Proceedings FM 2012, 18th International Symposium on Formal Methods","DOI":"10.1007\/978-3-642-32759-9_4"},{"key":"9367_CR2","doi-asserted-by":"crossref","unstructured":"Ammons G, Bod\u00edk R, Larus JR (2002) Mining specifications. In: POPL 2002, Portland, Oregon, pp 4\u201316","DOI":"10.1145\/503272.503275"},{"key":"9367_CR3","doi-asserted-by":"crossref","unstructured":"Androutsopoulos K, Gold N, Harman M, Li Z, Tratt L (2009) A theoretical and empirical study of EFSM dependence. In: 2009 IEEE International Conference on Software Maintenance, ICSM 2009. IEEE, pp 287\u2013296","DOI":"10.1109\/ICSM.2009.5306309"},{"key":"9367_CR4","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. Inf Comput 75:87\u2013106","journal-title":"Inf Comput"},{"issue":"2\u20133","key":"9367_CR5","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1007\/s10009-003-0114-9","volume":"5","author":"T Arts","year":"2004","unstructured":"Arts T, Earle CB, Derrick J (2004) Development of a verified Erlang program for resource locking. Int J Softw Tools Technol Transfer 5(2\u20133):205\u2013220","journal-title":"Int J Softw Tools Technol Transfer"},{"key":"9367_CR6","doi-asserted-by":"crossref","first-page":"592","DOI":"10.1109\/TC.1972.5009015","volume":"21","author":"AW Biermann","year":"1972","unstructured":"Biermann AW, Feldman JA (1972) On the synthesis of finite-state machines from samples of their behaviour. IEEE Trans Comput C 21:592\u2013597","journal-title":"IEEE Trans Comput C"},{"key":"9367_CR7","doi-asserted-by":"crossref","unstructured":"B\u00f6rger E, St\u00e4rk RF (2003) Abstract State Machines: A Method for High-level System Design and Analysis. Springer","DOI":"10.1007\/978-3-642-18216-7"},{"key":"9367_CR8","unstructured":"Lindig CVD, Wasylkowski A, Zeller A (2006) Mining object behavior with ADABU. In: Proceedings of the 2006 international workshop on Dynamic systems analysis. ACM, pp 17\u201324"},{"key":"9367_CR9","unstructured":"Cesarini F, Thompson S (2011) Erlang by Example. O\u2019Reilly Media"},{"key":"9367_CR10","doi-asserted-by":"crossref","unstructured":"Cheng K, Krishnakumar A (1993) Automatic functional test generation using the extended finite state machine model. In: 30th Conference on Design Automation. ACM, pp 86\u201391","DOI":"10.1145\/157485.164585"},{"key":"9367_CR11","doi-asserted-by":"crossref","unstructured":"Clarke E, Grumberg O, Jha S, Lu Y, Veith H (2000) Counterexample-guided abstraction refinement. In: Computer aided verification. Springer, pp 154\u2013169","DOI":"10.1007\/10722167_15"},{"issue":"3","key":"9367_CR12","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1145\/287000.287001","volume":"7","author":"J Cook","year":"1998","unstructured":"Cook J, Wolf A (1998) Discovering models of software processes from event-based data. ACM Trans Softw Eng Methodol 7(3):215\u2013249","journal-title":"ACM Trans Softw Eng Methodol"},{"issue":"2","key":"9367_CR13","doi-asserted-by":"crossref","first-page":"243","DOI":"10.1109\/TSE.2011.105","volume":"38","author":"V Dallmeier","year":"2012","unstructured":"Dallmeier V, Knopp N, Mallon C, Fraser G, Hack S, Zeller A (2012) Automatically generating test cases for specification mining. IEEE Trans Softw Eng 38(2):243\u2013257","journal-title":"IEEE Trans Softw Eng"},{"key":"9367_CR14","doi-asserted-by":"crossref","unstructured":"Damas C, Lambeau B, Dupont P, van Lamsweerde A (2005) Generating annotated behavior models from end-user scenarios. IEEE Trans Softw Eng 31(12)","DOI":"10.1109\/TSE.2005.138"},{"issue":"1","key":"9367_CR15","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1023\/A:1011227529550","volume":"19","author":"W Damm","year":"2001","unstructured":"Damm W, Harel D (2001) Lscs: Breathing life into message sequence charts. Formal Methods in System Design 19(1):45\u201380","journal-title":"Formal Methods in System Design"},{"issue":"9","key":"9367_CR16","doi-asserted-by":"crossref","first-page":"1332","DOI":"10.1016\/j.patcog.2005.01.003","volume":"38","author":"C De La Higuera","year":"2005","unstructured":"De La Higuera C (2005) A bibliographical study of grammatical inference. Pattern Recog 38(9):1332\u20131348","journal-title":"Pattern Recog"},{"issue":"2","key":"9367_CR17","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/32.908957","volume":"27","author":"MD Ernst","year":"2001","unstructured":"Ernst MD, Cockrell J, Griswold WG, Notkin D (2001) Dynamically discovering likely program invariants to support program evolution. IEEE Trans Softw Eng 27(2):1\u201325","journal-title":"IEEE Trans Softw Eng"},{"key":"9367_CR18","doi-asserted-by":"crossref","unstructured":"Fraser G, Walkinshaw N (2012) Behaviourally adequate software testing. In: Software Testing, Verification and Validation (ICST) 2012. IEEE, pp 300\u2013309","DOI":"10.1109\/ICST.2012.110"},{"key":"9367_CR19","doi-asserted-by":"crossref","unstructured":"Freund Y, Schapire R (1995) A desicion-theoretic generalization of on-line learning and an application to boosting. In: Computational learning theory. Springer, pp 23\u201337","DOI":"10.1007\/3-540-59119-2_166"},{"key":"9367_CR20","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"EM Gold","year":"1967","unstructured":"Gold EM (1967) Language identification in the limit. Inf Control 10:447\u2013474","journal-title":"Inf Control"},{"key":"9367_CR21","doi-asserted-by":"crossref","unstructured":"Gransden T, Walkinshaw N, Raman R (2014) Mining State-Based Models from Proof Corpora. In: Proceedings of Conferences on Intelligence Mathematics - Mathematical Knowledge Management Track - CICM\u201914, vol 8543","DOI":"10.1007\/978-3-319-08434-3_21"},{"key":"9367_CR22","doi-asserted-by":"crossref","first-page":"10","DOI":"10.1145\/1656274.1656278","volume":"11","author":"M Hall","year":"2009","unstructured":"Hall M, Frank E, Holmes G, Pfahringer B, Reutemann P, Witten IH (2009) The weka data mining software: an update. SIGKDD Explor Newsl 11:10\u201318","journal-title":"SIGKDD Explor Newsl"},{"issue":"2","key":"9367_CR23","doi-asserted-by":"crossref","first-page":"9","DOI":"10.1145\/1459352.1459354","volume":"41","author":"RM Hierons","year":"2009","unstructured":"Hierons RM, Bogdanov K, Bowen JP, Cleaveland R, Derrick J, Dick J, Gheorghe M, Harman M, Kapoor K, Krause P et al (2009) Using formal specifications to support testing. ACM Comput Surv (CSUR) 41(2):9","journal-title":"ACM Comput Surv (CSUR)"},{"issue":"2","key":"9367_CR24","doi-asserted-by":"crossref","first-page":"69","DOI":"10.1049\/sej.1988.0009","volume":"3","author":"M Holcombe","year":"1988","unstructured":"Holcombe M (1988) X-machines as a basis for dynamic system specification. Softw Eng J 3(2):69\u2013 76","journal-title":"Softw Eng J"},{"key":"9367_CR25","doi-asserted-by":"crossref","unstructured":"Howar F, Steffen B, Jonsson B, Cassel S (2012) Inferring canonical register automata. In: Verification, Model Checking, and Abstract Interpretation. Springer, pp 251\u2013266","DOI":"10.1007\/978-3-642-27940-9_17"},{"key":"9367_CR26","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1109\/TSE.1982.235571","volume":"4","author":"WE Howden","year":"1982","unstructured":"Howden WE (1982) Weak mutation testing and completeness of test sets. IEEE Trans Softw Eng 4:371\u2013379","journal-title":"IEEE Trans Softw Eng"},{"key":"9367_CR27","doi-asserted-by":"crossref","unstructured":"Just R, Schweiggert F, Kapfhammer GM (2011) MAJOR: An efficient and extensible tool for mutation analysis in a Java compiler. In: Automated Software Engineering (ASE). IEEE\/ACM, pp 612\u2013615","DOI":"10.1109\/ASE.2011.6100138"},{"key":"9367_CR28","unstructured":"Kohavi R (1995) A study of cross-validation and bootstrap for accuracy estimation and model selection. In: International joint Conference on artificial intelligence, vol 14. Morgan Kaufmann Publishers Inc., pp 1137\u20131145"},{"issue":"1","key":"9367_CR29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1049\/ip-d.1983.0001","volume":"130","author":"J Kramer","year":"1983","unstructured":"Kramer J, Magee J, Sloman M, Lister A (1983) Conic: an integrated approach to distributed computer control systems. IEE Proc 130(1):1\u201310","journal-title":"IEE Proc"},{"key":"9367_CR30","doi-asserted-by":"crossref","unstructured":"Krka I, Brun Y, Medvidovic N (2014) Automatic mining of specifications from invocation traces and method invariants. In: ACM SIGSOFT International Symposium on Foundations of Software Engineering (FSE), Hong Kong, China","DOI":"10.1145\/2635868.2635890"},{"key":"9367_CR31","doi-asserted-by":"crossref","unstructured":"Lang KJ, Pearlmutter BA, Price RA (1998) Results of the Abbadingo One DFA learning competition and a new evidence-driven state merging algorithm. In: Honavar V, Slutzki G (eds) Proceedings of the 4th International Colloquium on Grammatical Inference, vol 1433. Springer-Verlag, pp 1\u201312","DOI":"10.1007\/BFb0054059"},{"key":"9367_CR32","doi-asserted-by":"crossref","unstructured":"Lee C, Chen F, Ro\u015fu G (2011) Mining parametric specifications. In: Proceedings of the 33rd International Conference on Software Engineering. ACM, pp 591\u2013600","DOI":"10.1145\/1985793.1985874"},{"key":"9367_CR33","unstructured":"Li H, Thompson S (2011) A User-extensible Refactoring Tool for Erlang Programs. Tech. rep., University of Kent, http:\/\/www.cs.kent.ac.uk\/pubs\/2011\/3171"},{"key":"9367_CR34","doi-asserted-by":"crossref","unstructured":"Lo D, Khoo SC (2006) QUARK: Empirical assessment of automaton-based specification miners. In: 2006 IEEE Computer Society on Reverse Engineering, (WCRE\u201906), pp 51\u201360","DOI":"10.1109\/WCRE.2006.47"},{"issue":"4","key":"9367_CR35","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1007\/s10515-012-0103-x","volume":"19","author":"D Lo","year":"2012","unstructured":"Lo D, Maoz S (2012) Scenario-based and value-based specification mining: better together. Autom Softw Eng 19(4):423\u2013458","journal-title":"Autom Softw Eng"},{"key":"9367_CR36","doi-asserted-by":"crossref","unstructured":"Lo D, Cheng H, Han J, Khoo SC, Sun C (2009) Classification of software behaviors for failure detection: a discriminative pattern mining approach. In: Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining. ACM, pp 557\u2013566","DOI":"10.1145\/1557019.1557083"},{"issue":"9","key":"9367_CR37","doi-asserted-by":"crossref","first-page":"2063","DOI":"10.1016\/j.jss.2012.04.001","volume":"85","author":"D Lo","year":"2012","unstructured":"Lo D, Mariani L, Santoro M (2012) Learning extended FSA from software: An empirical assessment. J Syst Softw 85(9):2063\u20132076. doi 10.1016\/j.jss.2012.04.001","journal-title":"J Syst Softw"},{"key":"9367_CR38","doi-asserted-by":"crossref","unstructured":"Lorenzoli D, Mariani L, Pezz\u00e8 M (2008) Automatic generation of software behavioral models. In: 2008 ACM\/IEEE 30th International Conference on Software Engineering, (ICSE\u201908). ACM, pp 501\u2013 510","DOI":"10.1145\/1368088.1368157"},{"key":"9367_CR39","unstructured":"Mitchell T (1997) Machine Learning. McGraw-Hill"},{"key":"9367_CR40","volume-title":"C4.5: Programs for Machine Learning","author":"JR Quinlan","year":"1993","unstructured":"Quinlan JR (1993) C4.5: Programs for Machine Learning. Morgan Kaufmann, San Mateo"},{"issue":"4","key":"9367_CR41","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1016\/j.ipm.2009.03.002","volume":"45","author":"M Sokolova","year":"2009","unstructured":"Sokolova M, Lapalme G (2009) A systematic analysis of performance measures for classification tasks. Inf Process Manag 45(4):427\u2013437","journal-title":"Inf Process Manag"},{"key":"9367_CR42","doi-asserted-by":"crossref","unstructured":"Taylor R, Hall M, Bogdanov K, Derrick J (2012) Using behaviour inference to optimise regression test sets. In: Testing Software and Systems (ICTSS\u201912). Springer, pp 184\u2013199","DOI":"10.1007\/978-3-642-34691-0_14"},{"key":"9367_CR43","doi-asserted-by":"crossref","unstructured":"Valdes A, Skinner K (2000) Adaptive, model-based monitoring for cyber attack detection. In: Recent Advances in Intrusion Detection. Springer, pp 80\u201393","DOI":"10.1007\/3-540-39945-3_6"},{"issue":"11","key":"9367_CR44","doi-asserted-by":"crossref","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"L Valiant","year":"1984","unstructured":"Valiant L (1984) A theory of the learnable. Commun ACM 27(11):1134\u20131142","journal-title":"Commun ACM"},{"key":"9367_CR45","doi-asserted-by":"crossref","unstructured":"Walkinshaw N, Bogdanov K (2013) Automated comparison of state-based software models in terms of their language and structure. ACM Trans Softw Eng Methodol 22 (2)","DOI":"10.1145\/2430545.2430549"},{"key":"9367_CR46","doi-asserted-by":"crossref","unstructured":"Walkinshaw N, Bogdanov K, Holcombe M, Salahuddin S (2007) Reverse engineering state machines by interactive grammar inference. In: 2007 14th Working Conference on Reverse Engineering, WCRE 2007. IEEE, pp 209\u2013218","DOI":"10.1109\/WCRE.2007.45"},{"issue":"2","key":"9367_CR47","doi-asserted-by":"crossref","first-page":"99","DOI":"10.1002\/stvr.380","volume":"18","author":"N Walkinshaw","year":"2008","unstructured":"Walkinshaw N, Bogdanov K, Ali S, Holcombe M (2008) Automated discovery of state transitions and their functions in source code. Software Testing. Verification and Reliability (STVR) 18(2):99\u2013 121","journal-title":"Verification and Reliability (STVR)"},{"key":"9367_CR48","doi-asserted-by":"crossref","unstructured":"Walkinshaw N, Derrick J, Guo Q (2009) Iterative refinement of reverse-engineered models by model-based testing. In: International conference on Formal Methods (FM\u201909). Springer, pp 305\u2013320","DOI":"10.1007\/978-3-642-05089-3_20"},{"key":"9367_CR49","doi-asserted-by":"crossref","unstructured":"Walkinshaw N, Bogdanov K, Derrick J, Paris J (2010) Increasing functional coverage by inductive testing: A case study. In: Testing Software and Systems (ICTSS\u201910), pp 126\u2013141","DOI":"10.1007\/978-3-642-16573-3_10"},{"key":"9367_CR50","unstructured":"Walkinshaw N, Lambeau B, Damas C, Bogdanov K, Dupont P (2012) STAMINA: a competition to encourage the development and assessment of software model inference techniques. Empir Softw Eng:1\u201334"},{"key":"9367_CR51","doi-asserted-by":"crossref","unstructured":"Walkinshaw N, Taylor R, Derrick J (2013) Inferring extended finite state machine models from software executions. In: 2013 20th Working Conference on Reverse Engineering (WCRE). IEEE, pp 301\u2013310","DOI":"10.1109\/WCRE.2013.6671305"},{"key":"9367_CR52","unstructured":"Weiss SM, Kapouleas I (1989) An empirical comparison of pattern recognition, neural nets, and machine learning classification methods. In: Proceedings of the Eleventh International Joint Conference on Artificial Intelligence. Morgan Kaufmann, pp 781\u2013787"},{"issue":"7","key":"9367_CR53","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1162\/neco.1996.8.7.1341","volume":"8","author":"DH Wolpert","year":"1996","unstructured":"Wolpert DH (1996) The lack of a priori distinctions between learning algorithms. Neural comput 8(7):1341\u20131390","journal-title":"Neural comput"}],"container-title":["Empirical Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10664-015-9367-7.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10664-015-9367-7\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10664-015-9367-7","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,30]],"date-time":"2019-05-30T21:15:17Z","timestamp":1559250917000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10664-015-9367-7"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,17]]},"references-count":53,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["9367"],"URL":"https:\/\/doi.org\/10.1007\/s10664-015-9367-7","relation":{},"ISSN":["1382-3256","1573-7616"],"issn-type":[{"value":"1382-3256","type":"print"},{"value":"1573-7616","type":"electronic"}],"subject":[],"published":{"date-parts":[[2015,3,17]]}}}