{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2023,6,7]],"date-time":"2023-06-07T17:52:36Z","timestamp":1686160356790},"reference-count":41,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2014,11,15]],"date-time":"2014-11-15T00:00:00Z","timestamp":1416009600000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Int J Softw Tools Technol Transfer"],"published-print":{"date-parts":[[2016,6]]},"DOI":"10.1007\/s10009-014-0358-6","type":"journal-article","created":{"date-parts":[[2014,11,15]],"date-time":"2014-11-15T02:53:12Z","timestamp":1416019992000},"page":"319-334","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":6,"title":["Generating test case chains for reactive systems"],"prefix":"10.1007","volume":"18","author":[{"given":"Peter","family":"Schrammel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Melham","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Kroening","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,15]]},"reference":[{"key":"358_CR1","first-page":"217","volume":"17","author":"R Hierons","year":"2010","unstructured":"Hierons, R., Ural, H.: Generating a checking sequence with a minimum number of reset transitions. ASE 17, 217\u2013250 (2010)","journal-title":"ASE"},{"key":"358_CR2","unstructured":"Robert Bosch GmbH: Bosch Automotive Handbook. Bentley, Plochingen (2007)"},{"key":"358_CR3","doi-asserted-by":"crossref","first-page":"301","DOI":"10.1007\/s00500-012-0894-5","volume":"17","author":"A Nu\u00f1ez","year":"2013","unstructured":"Nu\u00f1ez, A., Merayo, M., Hierons, R., N\u00fa\u00f1ez, M.: Using genetic algorithms to generate test sequences for complex timed systems. Soft Comput. 17, 301\u2013315 (2013)","journal-title":"Soft Comput."},{"key":"358_CR4","doi-asserted-by":"crossref","unstructured":"Petrenko, A., da Silva Sim\u00e3o, A., Yevtushenko, N.: Generating checking sequences for nondeterministic finite state machines. In: ICST, pp. 310\u2013319 (2012)","DOI":"10.1109\/ICST.2012.111"},{"key":"358_CR5","doi-asserted-by":"crossref","first-page":"618","DOI":"10.1109\/TC.2006.80","volume":"55","author":"R Hierons","year":"2006","unstructured":"Hierons, R., Ural, H.: Optimizing the length of checking sequences. Trans. Comput. 55, 618\u2013629 (2006)","journal-title":"Trans. Comput."},{"key":"358_CR6","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1016\/j.ipl.2004.03.003","volume":"90","author":"R Hierons","year":"2004","unstructured":"Hierons, R.: Using a minimal number of resets when testing from a finite state machine. Inf. Proc. Lett. 90, 287\u2013292 (2004)","journal-title":"Inf. Proc. Lett."},{"key":"358_CR7","doi-asserted-by":"crossref","unstructured":"Schrammel, P., Melham, T., Kroening, D.: Chaining test cases for reactive system testing. In: International Conference on Testing Software and Systems, vol. 8254, pp. 133\u2013148 (2013)","DOI":"10.1007\/978-3-642-41707-8_9"},{"key":"358_CR8","doi-asserted-by":"crossref","first-page":"976","DOI":"10.1109\/32.92918","volume":"17","author":"S Boyd","year":"1991","unstructured":"Boyd, S., Ural, H.: On the complexity of generating optimal test sequences. Trans. Softw. Eng. 17, 976\u2013978 (1991)","journal-title":"Trans. Softw. Eng."},{"key":"358_CR9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1145\/367766.368168","volume":"5","author":"R Floyd","year":"1962","unstructured":"Floyd, R.: Algorithm 97: shortest path. Commun. ACM 5, 345 (1962)","journal-title":"Commun. ACM"},{"key":"358_CR10","doi-asserted-by":"crossref","unstructured":"Kroening, D., Strichman, O.: Efficient computation of recurrence diameters. In: VMCAI. LNCS, vol. 2575, pp. 298\u2013309 (2003)","DOI":"10.1007\/3-540-36384-X_24"},{"key":"358_CR11","first-page":"160","volume":"66","author":"A Biere","year":"2002","unstructured":"Biere, A., Artho, C., Schuppan, V.: Liveness checking as safety checking. ENTCS 66, 160\u2013177 (2002)","journal-title":"ENTCS"},{"key":"358_CR12","doi-asserted-by":"crossref","first-page":"107","DOI":"10.3233\/AIC-2011-0491","volume":"24","author":"M Gebser","year":"2011","unstructured":"Gebser, M., Kaufmann, B., Kaminski, R., Ostrowski, M., Schaub, T., Schneider, M.T.: Potassco: the Potsdam answer set solving collection. AI Commun. 24, 107\u2013124 (2011)","journal-title":"AI Commun."},{"key":"358_CR13","doi-asserted-by":"crossref","first-page":"7","DOI":"10.1023\/A:1011276507260","volume":"19","author":"E Clarke","year":"2001","unstructured":"Clarke, E., Biere, A., Raimi, R., Zhu, Y.: Bounded model checking using satisfiability solving. Form. Methods Syst. Des. 19, 7\u201334 (2001)","journal-title":"Form. Methods Syst. Des."},{"key":"358_CR14","unstructured":"E\u00e9n, N., Mishchenko, A., Amla, N.: A single-instance incremental SAT formulation of proof- and counterexample-based abstraction. In: Formal Methods in Computer-Aided Design, pp. 181\u2013188 (2010)"},{"key":"358_CR15","doi-asserted-by":"crossref","unstructured":"Clarke, E., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: TACAS. LNCS, vol. 2988, pp. 168\u2013176 (2004)","DOI":"10.1007\/978-3-540-24730-2_15"},{"key":"358_CR16","doi-asserted-by":"crossref","first-page":"106","DOI":"10.1016\/S0377-2217(99)00284-2","volume":"126","author":"K Helsgaun","year":"2000","unstructured":"Helsgaun, K.: An effective implementation of the Lin\u2013Kernighan traveling salesman heuristic. Eur. J. Oper. Res. 126, 106\u2013130 (2000)","journal-title":"Eur. J. Oper. Res."},{"key":"358_CR17","doi-asserted-by":"crossref","unstructured":"Meinke, K., Sindhu, M.A.: Incremental learning-based testing for reactive systems. In: TAP. LNCS, vol. 6706, pp. 134\u2013151 (2011)","DOI":"10.1007\/978-3-642-21768-5_11"},{"key":"358_CR18","doi-asserted-by":"crossref","unstructured":"Holzer, A., Schallhart, C., Tautschnig, M., Veith, H.: FShell: systematic test case generation for dynamic analysis and measurement. In: CAV. LNCS, vol. 5123, pp. 209\u2013213 (2008)","DOI":"10.1007\/978-3-540-70545-1_20"},{"key":"358_CR19","doi-asserted-by":"crossref","unstructured":"Holzer, A., Schallhart, C., Tautschnig, M., Veith, H.: Query-driven program testing. In: VMCAI. LNCS, vol. 5403, pp. 151\u2013166 (2009)","DOI":"10.1007\/978-3-540-93900-9_15"},{"key":"358_CR20","unstructured":"Cadar, C., Dunbar, D., Engler, D.: KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs. In: OSDI, pp. 209\u2013224 (2008)"},{"key":"358_CR21","doi-asserted-by":"crossref","first-page":"215","DOI":"10.1002\/stvr.402","volume":"19","author":"G Fraser","year":"2009","unstructured":"Fraser, G., Wotawa, F., Ammann, P.: Testing with model checkers: a survey. Softw. Test. Verif. Reliab. 19, 215\u2013261 (2009)","journal-title":"Softw. Test. Verif. Reliab."},{"key":"358_CR22","doi-asserted-by":"crossref","first-page":"438","DOI":"10.1109\/TSE.1984.5010257","volume":"10","author":"JW Duran","year":"1984","unstructured":"Duran, J.W., Ntafos, S.C.: An evaluation of random testing. Trans. Softw. Eng. 10, 438\u2013444 (1984)","journal-title":"Trans. Softw. Eng."},{"key":"358_CR23","doi-asserted-by":"crossref","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: DART: directed automated random testing. In: PLDI, pp. 213\u2013223 (2005)","DOI":"10.1145\/1065010.1065036"},{"key":"358_CR24","doi-asserted-by":"crossref","unstructured":"Sen, K., Agha, G.: CUTE and jCUTE: concolic unit testing and explicit path model-checking tools. In: CAV. LNCS, vol. 4144, pp. 419\u2013423 (2006)","DOI":"10.1007\/11817963_38"},{"key":"358_CR25","doi-asserted-by":"crossref","unstructured":"du Bousquet, L., Ouabdesselam, F., Richier, J.L., Zuanon, N.: Lutess: A specification-driven testing environment for synchronous software. In: ICSE, pp. 267\u2013276 (1999)","DOI":"10.1145\/302405.302634"},{"key":"358_CR26","doi-asserted-by":"crossref","first-page":"517","DOI":"10.1007\/s10009-006-0023-9","volume":"8","author":"E Jahier","year":"2006","unstructured":"Jahier, E., Raymond, P., Baufreton, P.: Case studies with Lurette V2. STTT 8, 517\u2013530 (2006)","journal-title":"STTT"},{"key":"358_CR27","doi-asserted-by":"crossref","unstructured":"Raymond, P., Roux, Y., Jahier, E.: Lutin: A language for specifying and executing reactive scenarios. EURASIP J. Embed. Syst. (2008). doi: 10.1155\/2008\/753821","DOI":"10.1155\/2008\/753821"},{"key":"358_CR28","doi-asserted-by":"crossref","first-page":"383","DOI":"10.1007\/s10009-012-0240-3","volume":"14","author":"A Petrenko","year":"2012","unstructured":"Petrenko, A., da Silva Sim\u00e3o, A., Maldonado, J.C.: Model-based testing of software and systems: recent advances and challenges. STTT 14, 383\u2013386 (2012)","journal-title":"STTT"},{"key":"358_CR29","doi-asserted-by":"crossref","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\u2014a survey. Proc. IEEE 84, 1090\u20131123 (1996)","journal-title":"Proc. IEEE"},{"key":"358_CR30","doi-asserted-by":"crossref","unstructured":"Lee, D., Yannakakis, M.: Optimization problems from feature testing of communication protocols. In: International Conference on Network Protocols, vol. 66 (1996)","DOI":"10.1109\/ICNP.1996.564905"},{"key":"358_CR31","doi-asserted-by":"crossref","first-page":"514","DOI":"10.1109\/26.81739","volume":"39","author":"H Ural","year":"1991","unstructured":"Ural, H., Yang, B.: A test sequence selection method for protocol testing. IEEE Trans. Commun. 39, 514\u2013523 (1991)","journal-title":"IEEE Trans. Commun."},{"key":"358_CR32","doi-asserted-by":"crossref","unstructured":"Petrenko, A., Boroday, S., Groz, R.: Confirming configurations in EFSM testing. Trans. Softw. Eng. 30, 29\u201342 (2004)","DOI":"10.1109\/TSE.2004.1265734"},{"key":"358_CR33","doi-asserted-by":"crossref","unstructured":"Jard, C., J\u00e9ron, T.: TGV: theory, principles and algorithms: a tool for the automatic synthesis of conformance test cases for non-deterministic reactive systems. STTT 7, 297\u2013315 (2005)","DOI":"10.1007\/s10009-004-0153-x"},{"key":"358_CR34","doi-asserted-by":"crossref","unstructured":"Tretmans, J.: Model based testing with labelled transition systems. In: Formal Methods and Testing. LNCS, vol. 4949, pp. 1\u201338 (2008)","DOI":"10.1007\/978-3-540-78917-8_1"},{"key":"358_CR35","doi-asserted-by":"crossref","first-page":"614","DOI":"10.1109\/TC.2004.1275300","volume":"53","author":"A Duale","year":"2004","unstructured":"Duale, A., Uyar, M.\u00dc.: A method enabling feasible conformance test sequence generation for EFSM models. IEEE Trans. Comput. 53, 614\u2013627 (2004)","journal-title":"IEEE Trans. Comput."},{"key":"358_CR36","doi-asserted-by":"crossref","unstructured":"Kalaji, A.S., Hierons, R.M., Swift, S.: Generating feasible transition paths for testing from an extended finite state machine (EFSM). In: ICST, pp. 230\u2013239 (2009)","DOI":"10.1109\/ICST.2009.29"},{"key":"358_CR37","doi-asserted-by":"crossref","unstructured":"Jourdan, G.V., Ural, H., Yenig\u00fcn, H., Zhu, D.: Using a SAT solver to generate checking sequences. In: International Symposium on Computer and Information Sciences, pp. 549\u2013554 (2009)","DOI":"10.1109\/ISCIS.2009.5291883"},{"key":"358_CR38","doi-asserted-by":"crossref","first-page":"20","DOI":"10.1002\/scj.10482","volume":"34","author":"T Mori","year":"2003","unstructured":"Mori, T., Otsuka, H., Funabiki, N., Nakata, A., Higashino, T.: A test sequence generation method for communication protocols using the SAT algorithm. Syst. Comput. Jpn 34, 20\u201329 (2003)","journal-title":"Syst. Comput. Jpn"},{"key":"358_CR39","doi-asserted-by":"crossref","unstructured":"Peleska, J., Vorobev, E., Lapschies, F.: Automated test case generation with SMT-solving and abstract interpretation. In: NASA Formal Methods. LNCS, vol. 6617, pp. 298\u2013312 (2011)","DOI":"10.1007\/978-3-642-20398-5_22"},{"key":"358_CR40","doi-asserted-by":"crossref","unstructured":"Petrenko, A., Dury, A., Ramesh, S., Mohalik, S.: A method and tool for test optimization for automotive controllers. In: Software Testing, Verification and Validation Workshops, pp. 198\u2013207 (2013)","DOI":"10.1109\/ICSTW.2013.31"},{"key":"358_CR41","doi-asserted-by":"crossref","unstructured":"Kroening, D., Lewis, M., Weissenbacher, G.: Under-approximating loops in C programs for fast counterexample detection. In: CAV. LNCS, vol. 8044, pp. 381\u2013396 (2013)","DOI":"10.1007\/978-3-642-39799-8_26"}],"container-title":["International Journal on Software Tools for Technology Transfer"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-014-0358-6.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10009-014-0358-6\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10009-014-0358-6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,26]],"date-time":"2020-08-26T22:07:24Z","timestamp":1598479644000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10009-014-0358-6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,15]]},"references-count":41,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2016,6]]}},"alternative-id":["358"],"URL":"https:\/\/doi.org\/10.1007\/s10009-014-0358-6","relation":{},"ISSN":["1433-2779","1433-2787"],"issn-type":[{"value":"1433-2779","type":"print"},{"value":"1433-2787","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,11,15]]}}}