{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T00:15:09Z","timestamp":1725754509747},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642417061"},{"type":"electronic","value":"9783642417078"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-41707-8_9","type":"book-chapter","created":{"date-parts":[[2013,10,30]],"date-time":"2013-10-30T06:56:38Z","timestamp":1383116198000},"page":"133-148","source":"Crossref","is-referenced-by-count":10,"title":["Chaining Test Cases for Reactive System Testing"],"prefix":"10.1007","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","reference":[{"key":"9_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\u00a017, 217\u2013250 (2010)","journal-title":"ASE"},{"key":"9_CR2","unstructured":"Robert Bosch GmbH: Bosch Automotive Handbook. Bentley (2007)"},{"key":"9_CR3","doi-asserted-by":"crossref","unstructured":"Nu\u00f1ez, A., Merayo, M., Hierons, R., N\u00fa\u00f1ez, M.: Using genetic algorithms to generate test sequences for complex timed systems. Soft Computing\u00a017 (2013)","DOI":"10.1007\/s00500-012-0894-5"},{"key":"9_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":"9_CR5","doi-asserted-by":"publisher","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.\u00a017, 976\u2013978 (1991)","journal-title":"Trans. Softw. Eng."},{"key":"9_CR6","unstructured":"Schrammel, P., Melham, T., Kroening, D.: Chaining test cases for reactive system testing (extended version). Research report, University of Oxford (2013), http:\/\/arxiv.org\/abs\/1306.3882"},{"key":"9_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/3-540-36384-X_24","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"D. Kroning","year":"2002","unstructured":"Kroning, D., Strichman, O.: Efficient computation of recurrence diameters. In: Zuck, L.D., Attie, P.C., Cortesi, A., Mukhopadhyay, S. (eds.) VMCAI 2003. LNCS, vol.\u00a02575, pp. 298\u2013309. Springer, Heidelberg (2002)"},{"key":"9_CR8","doi-asserted-by":"publisher","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. Formal Methods in System Design\u00a019, 7\u201334 (2001)","journal-title":"Formal Methods in System Design"},{"key":"9_CR9","unstructured":"Schrammel, P.: Logico-Numerical Verification Methods for Discrete and Hybrid Systems. PhD thesis, Universit\u00e9 de Grenoble (2012)"},{"key":"9_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"168","DOI":"10.1007\/978-3-540-24730-2_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E. Clarke","year":"2004","unstructured":"Clarke, E., Kroning, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol.\u00a02988, pp. 168\u2013176. Springer, Heidelberg (2004)"},{"key":"9_CR11","doi-asserted-by":"publisher","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-Kernighan traveling salesman heuristic. European J. of Operational Research\u00a0126, 106\u2013130 (2000)","journal-title":"European J. of Operational Research"},{"key":"9_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"134","DOI":"10.1007\/978-3-642-21768-5_11","volume-title":"Tests and Proofs","author":"K. Meinke","year":"2011","unstructured":"Meinke, K., Sindhu, M.A.: Incremental learning-based testing for reactive systems. In: Gogolla, M., Wolff, B. (eds.) TAP 2011. LNCS, vol.\u00a06706, pp. 134\u2013151. Springer, Heidelberg (2011)"},{"key":"9_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-540-70545-1_20","volume-title":"Computer Aided Verification","author":"A. Holzer","year":"2008","unstructured":"Holzer, A., Schallhart, C., Tautschnig, M., Veith, H.: FShell: Systematic test case generation for dynamic analysis and measurement. In: Gupta, A., Malik, S. (eds.) CAV 2008. LNCS, vol.\u00a05123, pp. 209\u2013213. Springer, Heidelberg (2008)"},{"key":"9_CR14","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":"9_CR15","doi-asserted-by":"publisher","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. Software Testing, Verification & Reliability\u00a019, 215\u2013261 (2009)","journal-title":"Software Testing, Verification & Reliability"},{"key":"9_CR16","doi-asserted-by":"publisher","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. Computers\u00a053, 614\u2013627 (2004)","journal-title":"IEEE Trans. Computers"},{"key":"9_CR17","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":"9_CR18","doi-asserted-by":"crossref","unstructured":"Jourdan, G.V., Ural, H., Yenig\u00fcn, H., Zhu, D.: Using a SAT solver to generate checking sequences. In: Int. Sym. on Comp. and Inf. Sciences, pp. 549\u2013554 (2009)","DOI":"10.1109\/ISCIS.2009.5291883"},{"key":"9_CR19","doi-asserted-by":"publisher","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. System and Computers in Japan\u00a034, 20\u201329 (2003)","journal-title":"System and Computers in Japan"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"298","DOI":"10.1007\/978-3-642-20398-5_22","volume-title":"NASA Formal Methods","author":"J. Peleska","year":"2011","unstructured":"Peleska, J., Vorobev, E., Lapschies, F.: Automated test case generation with SMT-solving and abstract interpretation. In: Bobaru, M., Havelund, K., Holzmann, G.J., Joshi, R. (eds.) NFM 2011. LNCS, vol.\u00a06617, pp. 298\u2013312. Springer, Heidelberg (2011)"},{"key":"9_CR21","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":"9_CR22","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 Communications\u00a024, 107\u2013124 (2011)","journal-title":"AI Communications"}],"container-title":["Lecture Notes in Computer Science","Testing Software and Systems"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-41707-8_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,8,6]],"date-time":"2020-08-06T22:41:09Z","timestamp":1596753669000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-41707-8_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642417061","9783642417078"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-41707-8_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2013]]}}}