{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T19:33:02Z","timestamp":1742931182506,"version":"3.40.3"},"publisher-location":"Cham","reference-count":39,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783031046728"},{"type":"electronic","value":"9783031046735"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022]]},"DOI":"10.1007\/978-3-031-04673-5_3","type":"book-chapter","created":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T17:23:08Z","timestamp":1652116988000},"page":"37-54","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Reverse-Engineering EFSMs with\u00a0Data Dependencies"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-8233-9873","authenticated-orcid":false,"given":"Michael","family":"Foster","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6631-8914","authenticated-orcid":false,"given":"John","family":"Derrick","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2134-6548","authenticated-orcid":false,"given":"Neil","family":"Walkinshaw","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,5,10]]},"reference":[{"key":"3_CR1","unstructured":"https:\/\/github.com\/lagodiuk\/genetic-programming. Accessed 03 Feb 2020"},{"key":"3_CR2","unstructured":"http:\/\/www.doc.ic.ac.uk\/~jnm\/book\/book_applets\/concurrency\/invaders. Accessed 15 May 2020"},{"key":"3_CR3","unstructured":"http:\/\/www.cs.le.ac.uk\/people\/nw91\/Files\/ICSMEData.zip. Accessed 15 April 2020"},{"key":"3_CR4","unstructured":"https:\/\/doi.org\/10.15131\/shef.data.15172969"},{"key":"3_CR5","unstructured":"Aarts, F.: Tomte : Bridging the gap between active learning and real-world systems. Ph.D. thesis, Radboud University Nijmegen (2014)"},{"key":"3_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-32759-9_4","volume-title":"FM 2012: Formal Methods","author":"F Aarts","year":"2012","unstructured":"Aarts, F., Heidarian, F., Kuppens, H., Olsen, P., Vaandrager, F.: Automata Learning through Counterexample Guided Abstraction Refinement. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 10\u201327. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_4"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Androutsopoulos, K., Gold, N., Harman, M., Li, Z., Tratt, L.: A theoretical and empirical study of EFSM dependence. In: 2009 IEEE International Conference on Software Maintenance, pp. 287\u2013296 (2009)","DOI":"10.1109\/ICSM.2009.5306309"},{"issue":"2","key":"3_CR8","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. Inf. Comput. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1016\/j.jss.2019.01.045","volume":"150","author":"P Arcaini","year":"2019","unstructured":"Arcaini, P., Gargantini, A., Radavelli, M.: Achieving change requirements of feature models by an evolutionary approach. J. Syst. Softw. 150, 64\u201376 (2019)","journal-title":"J. Syst. Softw."},{"key":"3_CR10","doi-asserted-by":"publisher","unstructured":"Berg, T., Jonsson, B., Raffelt, H.: Regular inference for state machines using domains with equality tests. In: Fiadeiro, J.L., Inverardi, P. (eds.) Fundamental Approaches to Software Engineering. vol. 4961 LNCS, pp. 317\u2013331. Springer, Berlin (2008). https:\/\/doi.org\/10.1007\/978-3-540-78743-3_24","DOI":"10.1007\/978-3-540-78743-3_24"},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"Biermann, A.W., Feldman, J.A.: On the synthesis of finite-state machines from samples of their behavior. IEEE Trans. Comput. C-21(6), 592\u2013597 (1972)","DOI":"10.1109\/TC.1972.5009015"},{"issue":"4","key":"3_CR12","doi-asserted-by":"publisher","first-page":"1521","DOI":"10.1109\/TII.2017.2670146","volume":"13","author":"I Buzhinsky","year":"2017","unstructured":"Buzhinsky, I., Vyatkin, V.: Automatic inference of finite-state plant models from traces and temporal properties. IEEE Trans. Indust. Inf. 13(4), 1521\u20131530 (2017)","journal-title":"IEEE Trans. Indust. Inf."},{"key":"3_CR13","doi-asserted-by":"publisher","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Learning extended finite state machines. In: Giannakopoulou, D., Salaun, G. (eds.) Software Engineering and Formal Methods, pp. 250\u2013264. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10431-7_18","DOI":"10.1007\/978-3-319-10431-7_18"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Cheng, K.T., Krishnakumar, A.S.: Automatic functional test generation using the extended finite state machine model. In: Proceedings of the 30th International Design Automation Conference, pp. 86\u201391. ACM Press (1993)","DOI":"10.1145\/157485.164585"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Doerr, B., Le, H.P., Makhmara, R., Nguyen, T.D.: Fast genetic algorithms. In: Proceedings of the Genetic and Evolutionary Computation Conference, pp. 777\u2013784. Association for Computing Machinery (2017)","DOI":"10.1145\/3071178.3071301"},{"key":"3_CR16","unstructured":"Foster, M.: EFSM inference (2020). https:\/\/github.com\/jmafoster1\/efsm-inference"},{"key":"3_CR17","unstructured":"Foster, M.: Reverse Engineering Systems to Identify Flaws and Understand Behaviour. Ph.D. thesis, The University Of Sheffield (2020)"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Foster, M., Brucker, A.D., Taylor, R., North, S., Derrick, J.: Incorporating data into EFSM inference. In: Olveczky, P., SalaUn, G. (eds.) Software Engineering and Formal Methods. SEFM 2019. LNCS, vol. 11724, pp. 257\u2013272. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-30446-1_14","DOI":"10.1007\/978-3-030-30446-1_14"},{"key":"3_CR19","unstructured":"Foster, M., Brucker, A.D., Taylor, R.G., Derrick, J.: A formal model of extended finite state machines. Archive of Formal Proofs (2020). https:\/\/isa-afp.org\/entries\/Extended_Finite_State_Machines.html, Formal proof development"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Foster, M., Taylor, R., Brucker, A.D., Derrick, J.: Formalising extended finite state machine transition merging. In: Sun, J., Sun, M. (eds.) Formal Methods and Software Engineering. ICFEM 2018. LNCS, vol. 11232, pp. 373\u2013387. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-02450-5_22","DOI":"10.1007\/978-3-030-02450-5_22"},{"key":"3_CR21","unstructured":"Koza, J.R.: Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press (1992)"},{"key":"3_CR22","doi-asserted-by":"publisher","unstructured":"Lang, K.J., Pearlmutter, B.A., Price, R.A.: Results of the Abbadingo One DFA learning competition and a new evidence-driven state merging algorithm. In: Grammatical Inference, pp. 1\u201312. Springer, Berlin (1998). https:\/\/doi.org\/10.1007\/BFb0054059","DOI":"10.1007\/BFb0054059"},{"key":"3_CR23","unstructured":"Langdon, W.B.: Quadratic bloat in genetic programming. In: Proceedings of the 2nd Annual Conference on Genetic and Evolutionary Computation, pp. 451\u2013458. GECCO\u201900, Morgan Kaufmann Publishers Inc., San Francisco, CA, USA (2000)"},{"issue":"8","key":"3_CR24","doi-asserted-by":"publisher","first-page":"1090","DOI":"10.1109\/5.533956","volume":"84","author":"D Lee","year":"1996","unstructured":"Lee, D., Yannakakis, M.: Principles and methods of testing finite state machines-a survey. Proc. IEEE 84(8), 1090\u20131123 (1996)","journal-title":"Proc. IEEE"},{"key":"3_CR25","doi-asserted-by":"crossref","unstructured":"Lorenzoli, D., Mariani, L., Pezz\u00e8, M.: Inferring state-based behavior models. In: Proceedings of the 2006 International Workshop on Dynamic Systems Analysis, p. 25. ACM Press (2006)","DOI":"10.1145\/1138912.1138919"},{"key":"3_CR26","doi-asserted-by":"crossref","unstructured":"Lorenzoli, D., Mariani, L., Pezz\u00e8, M.: Automatic generation of software behavioral models. In: Proceedings of the 13th International Conference on Software Engineering, p. 501. ACM Press (2008)","DOI":"10.1145\/1368088.1368157"},{"key":"3_CR27","unstructured":"Luke, S., Panait, L.: Lexicographic parsimony pressure. In: Proceedings of the 4th Annual Conference on Genetic and Evolutionary Computation, pp. 829\u2013836. Morgan Kaufmann Publishers Inc. (2002)"},{"key":"3_CR28","unstructured":"Magee, J., Kramer, J.: State Models and Java Programs, 2nd edn. Wiley Hoboken (2006)"},{"key":"3_CR29","unstructured":"Mannhardt, F.: Multi-perspective process mining. Ph.D. thesis, TU Eindhoven (2018)"},{"key":"3_CR30","doi-asserted-by":"publisher","unstructured":"de Moura, L., Bj\u00f8rner, N.: Z3: An efficient SMT solver. In: Ramakrishnan, C.R., Rehof, J. (eds.) Tools and Algorithms for the Construction and Analysis of Systems, pp. 337\u2013340. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_24","DOI":"10.1007\/978-3-540-78800-3_24"},{"key":"3_CR31","unstructured":"Poli, R., Langdon, W.B., McPhee, N.F.: A field guide to genetic programming (2008). http:\/\/www.gp-field-guide.org.uk"},{"key":"3_CR32","unstructured":"Strobl, F., Wisspeintner, A.: Specifcation of an elevator control system. Technical report, TUM (1999). https:\/\/wwwbroy.in.tum.de\/publ\/papers\/elevator.pdf"},{"key":"3_CR33","doi-asserted-by":"crossref","unstructured":"Ulyantsev, V., Tsarev, F.: Extended finite-state machine induction using sat-solver. In: 2011 10th International Conference on Machine Learning and Applications and Workshops, vol. 2, pp. 346\u2013349 (2011)","DOI":"10.1109\/ICMLA.2011.166"},{"issue":"1","key":"3_CR34","doi-asserted-by":"publisher","first-page":"35","DOI":"10.1007\/s10009-016-0442-1","volume":"20","author":"V Ulyantsev","year":"2016","unstructured":"Ulyantsev, V., Buzhinsky, I., Shalyto, A.: Exact finite-state machine identification from scenarios and temporal properties. Int. J. Softw. Tools Technol. Transfer 20(1), 35\u201355 (2016)","journal-title":"Int. J. Softw. Tools Technol. Transfer"},{"key":"3_CR35","doi-asserted-by":"publisher","unstructured":"Vaandrager, F., Midya, A.: A Myhill-Nerode theorem for register automata and symbolic trace languages. In: Holm, C., Kremer, K. (eds.) Theoretical Aspects of Computing, vol. 221, pp. 43\u201363. Springer, Cham (2020). https:\/\/doi.org\/10.1016\/j.tcs.2022.01.015","DOI":"10.1016\/j.tcs.2022.01.015"},{"issue":"8","key":"3_CR36","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/2240236.2240257","volume":"55","author":"W Van Der Aalst","year":"2012","unstructured":"Van Der Aalst, W.: Process mining. Commun. ACM 55(8), 76\u201383 (2012)","journal-title":"Commun. ACM"},{"key":"3_CR37","doi-asserted-by":"crossref","unstructured":"Walkinshaw, N., Hall, M.: Inferring computational state machine models from program executions. In: 2016 IEEE International Conference on Software Maintenance and Evolution, pp. 122\u2013132. IEEE (2016)","DOI":"10.1109\/ICSME.2016.74"},{"issue":"4","key":"3_CR38","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/s10664-012-9210-3","volume":"18","author":"N Walkinshaw","year":"2013","unstructured":"Walkinshaw, N., Lambeau, B., Damas, C., Bogdanov, K., Dupont, P.: STAMINA: a competition to encourage the development and assessment of software model inference techniques. Emp. Softw. Eng. 18(4), 791\u2013824 (2013)","journal-title":"Emp. Softw. Eng."},{"issue":"3","key":"3_CR39","doi-asserted-by":"publisher","first-page":"811","DOI":"10.1007\/s10664-015-9367-7","volume":"21","author":"N Walkinshaw","year":"2016","unstructured":"Walkinshaw, N., Taylor, R., Derrick, J.: Inferring extended finite state machine models from software executions. Emp. Softw. Eng. 21(3), 811\u2013853 (2016)","journal-title":"Emp. Softw. Eng."}],"container-title":["Lecture Notes in Computer Science","Testing Software and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-04673-5_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,9]],"date-time":"2022-05-09T17:23:56Z","timestamp":1652117036000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-04673-5_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783031046728","9783031046735"],"references-count":39,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-04673-5_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"10 May 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICTSS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"IFIP International Conference on Testing Software and Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"London","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"United Kingdom","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12 November 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"33","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pts2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ictss2021.cs.ucl.ac.uk","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"36","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"10","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"7","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"28% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Conference was held online due to the COVID-19 pandemic. 6 Project reports are included.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}