{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,24]],"date-time":"2025-08-24T01:38:30Z","timestamp":1755999510281},"publisher-location":"Cham","reference-count":40,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030306892"},{"type":"electronic","value":"9783030306908"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-30690-8_1","type":"book-chapter","created":{"date-parts":[[2019,9,8]],"date-time":"2019-09-08T19:02:47Z","timestamp":1567969367000},"page":"3-23","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Generating Test Suites to Validate Legacy Systems"],"prefix":"10.1007","author":[{"given":"Thomas","family":"Weigert","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Alexander","family":"Kolchin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Stepan","family":"Potiyenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Oleg","family":"Gurenko","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Aswin","family":"van den Berg","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Valentyn","family":"Banas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Chetvertak","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roman","family":"Yagodka","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Vlad","family":"Volkov","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,9,9]]},"reference":[{"key":"1_CR1","unstructured":"European Telecommunications Standards Institute. TTCN-3: Core Language. ES 201 873\u20131 4.11.1 (2019)"},{"key":"1_CR2","unstructured":"International Telecommunications Union. Message Sequence Charts Z.120 (2011)"},{"key":"1_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1007\/11506843_8","volume-title":"SDL 2005: Model Driven","author":"AA Letichevsky","year":"2005","unstructured":"Letichevsky, A.A., Kapitonova, J.V., Kotlyarov, V.P., Volkov, V.A., Letichevsky, A.A., Weigert, T.: Semantics of message sequence charts. In: Prinz, A., Reed, R., Reed, J. (eds.) SDL 2005. LNCS, vol. 3530, pp. 117\u2013132. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11506843_8"},{"key":"1_CR4","unstructured":"Chelinsky, D.: The RSpec Book. The Pragmatic Bookshelf (2010)"},{"key":"1_CR5","unstructured":"Wynne, M., Hellesoy, A.: The Cucumber Book. The Pragmatic Bookshelf (2012)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Baranov, S., Kotlyarov, V., Letichevsky, A.: An industrial technology of test automation based on verified behavioral models of requirement specifications for telecommunication applications. In: Proceedings of the Region 8 IEEE EUROCON 2009 Conference 2009, pp. 122\u2013129 (2009)","DOI":"10.1109\/EURCON.2009.5167801"},{"issue":"5","key":"1_CR7","doi-asserted-by":"publisher","first-page":"661","DOI":"10.1016\/j.comnet.2005.05.005","volume":"49","author":"S Baranov","year":"2005","unstructured":"Baranov, S., Kapitonova, J., Letichevsky, A., Volkov, V., Weigert, T.: Basic protocols, message sequence charts, and verification of requirements specifications. Comput. Netw. 49(5), 661\u2013675 (2005)","journal-title":"Comput. Netw."},{"key":"1_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"79","DOI":"10.1007\/978-3-642-25264-8_8","volume-title":"SDL 2011: Integrating System and Software Modeling","author":"S Baranov","year":"2011","unstructured":"Baranov, S., Kotlyarov, V., Weigert, T.: Verifiable coverage criteria for automated testing. In: Ober, I., Ober, I. (eds.) SDL 2011. LNCS, vol. 7083, pp. 79\u201389. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25264-8_8"},{"issue":"7","key":"1_CR9","doi-asserted-by":"publisher","first-page":"433","DOI":"10.3103\/S0146411613070213","volume":"47","author":"A Kolchin","year":"2013","unstructured":"Kolchin, A., et al.: An approach to creating concretized test scenarios within test automation technology for industrial software projects. Autom. Control Comput. Sci. 47(7), 433\u2013442 (2013)","journal-title":"Autom. Control Comput. Sci."},{"key":"1_CR10","volume-title":"Use Case Maps for Object-Oriented Systems","author":"R Buhr","year":"1995","unstructured":"Buhr, R.: Use Case Maps for Object-Oriented Systems. Pearson, London (1995)"},{"key":"1_CR11","unstructured":"International Telecommunications Union. User Requirements Notation Z-151 (2018)"},{"issue":"4","key":"1_CR12","doi-asserted-by":"publisher","first-page":"583","DOI":"10.1007\/s10559-010-9235-9","volume":"46","author":"AV Kolchin","year":"2010","unstructured":"Kolchin, A.V.: An automatic method for the dynamic construction of abstractions of states of a formal model. Cybern. Syst. Anal. 46(4), 583\u2013601 (2010)","journal-title":"Cybern. Syst. Anal."},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Kolchin, A.V.: Interactive method for cumulative analysis of software formal models behavior. In: Proceedings of the 11th International Conference on Programming UkrPROG2018, CEUR-WS, vol. 2139, pp. 115\u2013123 (2018)","DOI":"10.15407\/pp2018.02.115"},{"key":"1_CR14","unstructured":"Guba, A., et al.: A method for business logic extraction from legacy COBOL code of industrial systems. In: Proceedings of the 10th International Conference on Programming UkrPROG2016, CEUR-WS, vol. 1631, pp. 17\u201325 (2016)"},{"key":"1_CR15","unstructured":"Robot Framework User Guide. http:\/\/robotframework.org\/robotframework\/#user-guide"},{"key":"1_CR16","first-page":"121","volume":"3","author":"F Tip","year":"1995","unstructured":"Tip, F.: A survey of program slicing techniques. J. Program. Lang. 3, 121\u2013189 (1995)","journal-title":"J. Program. Lang."},{"key":"1_CR17","unstructured":"Weiser, M.: Program slices: formal, psychological and practical investigations of an automatic program abstraction method. Ph.D. thesis, University of Michigan, Ann Arbor (1979)"},{"issue":"3","key":"1_CR18","doi-asserted-by":"publisher","first-page":"155","DOI":"10.1016\/0020-0190(88)90054-3","volume":"29","author":"B Korel","year":"1988","unstructured":"Korel, B., Laski, J.: Dynamic program slicing. Inf. Process. Lett. 29(3), 155\u2013163 (1988)","journal-title":"Inf. Process. Lett."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Ottenstein, K., Ottenstein, L.: The program dependence graph in a software development environment. In: Proceedings of the ACM SIGSOFT\/SIGPLAN Software Engineering Symposium on Practical Software Development Environments, pp. 177\u2013184 (1984)","DOI":"10.1145\/390011.808263"},{"key":"1_CR20","volume-title":"Compilers: Principles, Techniques, and Tools","author":"A Aho","year":"2007","unstructured":"Aho, A., Ullman, J.: Compilers: Principles, Techniques, and Tools. Addison-Wesley, Boston (2007)"},{"key":"1_CR21","unstructured":"Andersen, L.: Program analysis and specialization for the C programming language. Ph.D. thesis, DIEM, University of Copenhagen (1994)"},{"key":"1_CR22","doi-asserted-by":"crossref","unstructured":"Hardekopf, B., Lin, C.: The ant and the grasshopper: fast and accurate pointer analysis for millions of lines of code. In: Programming Language Design and Implementation (2007)","DOI":"10.1145\/1250734.1250767"},{"issue":"4","key":"1_CR23","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1109\/TSE.1984.5010248","volume":"10","author":"M Weiser","year":"1984","unstructured":"Weiser, M.: Program slicing. IEEE Trans. Softw. Eng. 10(4), 352\u2013357 (1984)","journal-title":"IEEE Trans. Softw. Eng."},{"issue":"1","key":"1_CR24","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1145\/77606.77608","volume":"12","author":"S Horwitz","year":"1990","unstructured":"Horwitz, S., Reps, T., Binkley, D.: Interprocedural slicing using dependence graphs. ACM Trans. Program. Lang. Syst. 12(1), 26\u201361 (1990)","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"1_CR25","unstructured":"Hwang, J., Du, M., Chou, C.: Finding program slices for recursive procedures. In: Proceedings of the 12th Annual International Computer Software and Application Conference, Chicago (1988)"},{"key":"1_CR26","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1145\/3020266","volume":"50","author":"T Su","year":"2017","unstructured":"Su, T., et al.: A survey on data-flow testing. ACM Comput. Surv. 50, 5 (2017)","journal-title":"ACM Comput. Surv."},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/bs.adcom.2017.06.002","volume":"107","author":"R Dssouli","year":"2017","unstructured":"Dssouli, R., et al.: Testing the control-flow, data-flow, and time aspects of communication systems: a survey. Adv. Comput. 107, 95\u2013155 (2017)","journal-title":"Adv. Comput."},{"key":"1_CR28","first-page":"71","volume":"2","author":"V Volkov","year":"2017","unstructured":"Volkov, V., et al.: A survey of systematic methods for code-based test data generation. Artif. Intell. 2, 71\u201385 (2017)","journal-title":"Artif. Intell."},{"key":"1_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"33","DOI":"10.1007\/978-3-319-66299-2_3","volume-title":"Search Based Software Engineering","author":"J Campos","year":"2017","unstructured":"Campos, J., Ge, Y., Fraser, G., Eler, M., Arcuri, A.: An empirical evaluation of evolutionary algorithms for test suite generation. In: Menzies, T., Petke, J. (eds.) SSBSE 2017. LNCS, vol. 10452, pp. 33\u201348. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66299-2_3"},{"key":"1_CR30","doi-asserted-by":"publisher","first-page":"493","DOI":"10.1007\/978-3-319-10575-8_16","volume-title":"Handbook of Model Checking","author":"D Beyer","year":"2018","unstructured":"Beyer, D., Gulwani, S., Schmidt, D.A.: Combining model checking and data-flow analysis. Handbook of Model Checking, pp. 493\u2013540. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-10575-8_16"},{"issue":"2","key":"1_CR31","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1145\/2408776.2408795","volume":"56","author":"C Cadar","year":"2013","unstructured":"Cadar, C., Sen, K.: Symbolic execution for software testing: three decades later. Commun. ACM 56(2), 82\u201390 (2013)","journal-title":"Commun. ACM"},{"key":"1_CR32","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1016\/j.entcs.2007.08.005","volume":"190","author":"A Hessel","year":"2007","unstructured":"Hessel, A., Petterson, P.: A global algorithm for model-based test suite generation. Electr. Notes Theor. Comput. Sci. 190, 47\u201359 (2007)","journal-title":"Electr. Notes Theor. Comput. Sci."},{"key":"1_CR33","doi-asserted-by":"crossref","unstructured":"Trabish, D., Mattavelli, A., Cadar, C.: Chopped symbolic execution. In: Proceedings of ICSE 2018 (2018)","DOI":"10.1145\/3180155.3180251"},{"issue":"6","key":"1_CR34","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1145\/2345156.2254088","volume":"47","author":"Volodymyr Kuznetsov","year":"2012","unstructured":"Kuznetsov, V., et al.: Efficient state merging in symbolic execution. ACM SIGPLAN Conference on Programming Language Design and Implementation, pp. 193\u2013204 (2012)","journal-title":"ACM SIGPLAN Notices"},{"key":"1_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-540-78800-3_27","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P Boonstoppel","year":"2008","unstructured":"Boonstoppel, P., Cadar, C., Engler, D.: RWset: attacking path explosion in constraint-based test generation. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 351\u2013366. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78800-3_27"},{"key":"1_CR36","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/11430230_3","volume-title":"Testing of Communicating Systems","author":"HS Hong","year":"2005","unstructured":"Hong, H.S., Ural, H.: Dependence testing: extending data flow testing with control dependence. In: Khendek, F., Dssouli, R. (eds.) TestCom 2005. LNCS, vol. 3502, pp. 23\u201339. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11430230_3"},{"key":"1_CR37","doi-asserted-by":"crossref","unstructured":"Kolchin, A., Potiyenko, S., Weigert, T.: Challenges for automated, model-based test scenario generation. In: Proceedings of the 25th International Conference on Information and Software Technologies, 12 p. (2019)","DOI":"10.1007\/978-3-030-30275-7_15"},{"key":"1_CR38","unstructured":"Rapps, S., Weyuker, E.: Data flow analysis techniques for test data selection. In: Proceedings of the International Conference of Software Engineering, pp. 272\u2013277 (1982)"},{"key":"1_CR39","doi-asserted-by":"crossref","unstructured":"Kolchin, A.: A novel algorithm for attacking path explosion in model-based test generation for data flow coverage. In: Proceedings of the IEEE 1st International Conference on System Analysis and Intelligent Computing, SAIC (2018)","DOI":"10.1109\/SAIC.2018.8516824"},{"key":"1_CR40","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"680","DOI":"10.1007\/978-3-662-49674-9_44","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"P Maiya","year":"2016","unstructured":"Maiya, P., Gupta, R., Kanade, A., Majumdar, R.: Partial order reduction for event-driven multi-threaded programs. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 680\u2013697. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_44"}],"container-title":["Lecture Notes in Computer Science","System Analysis and Modeling. Languages, Methods, and Tools for Industry 4.0"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-30690-8_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,12,6]],"date-time":"2019-12-06T14:57:47Z","timestamp":1575644267000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-30690-8_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030306892","9783030306908"],"references-count":40,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-30690-8_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"9 September 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SAM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on System Analysis and Modeling","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Munich","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sam2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/sdl-forum.org\/Events\/SAM2019\/index.htm","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":"28","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":"12","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":"2","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":"43% - 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":"2.85","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":"1 keynote speaker paper","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)"}}]}}