{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T23:10:01Z","timestamp":1748387401767,"version":"3.41.0"},"publisher-location":"Cham","reference-count":36,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319194578"},{"type":"electronic","value":"9783319194585"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-19458-5_5","type":"book-chapter","created":{"date-parts":[[2015,5,11]],"date-time":"2015-05-11T11:41:14Z","timestamp":1431344474000},"page":"62-77","source":"Crossref","is-referenced-by-count":12,"title":["Successful Use of Incremental BMC in the Automotive Industry"],"prefix":"10.1007","author":[{"given":"Peter","family":"Schrammel","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Daniel","family":"Kroening","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Brain","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ruben","family":"Martins","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tino","family":"Teige","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tom","family":"Bienm\u00fcller","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"5_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Kanade, A., Ramesh, S., Shashidhar, K.C.: Symbolic analysis for improving simulation coverage of Simulink\/Stateflow models. In: EMSOFT, pp. 89\u201398 (2008)","DOI":"10.1145\/1450058.1450071"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/3-540-49059-0_14","volume-title":"Tools and Algorithms for the Construction of Analysis of Systems","author":"A. Biere","year":"1999","unstructured":"Biere, A., Cimatti, A., Clarke, E., Zhu, Y.: Symbolic model checking without BDDs. In: Cleaveland, W.R. (ed.) TACAS 1999. LNCS, vol.\u00a01579, pp. 193\u2013207. Springer, Heidelberg (1999)"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"4","DOI":"10.1007\/978-3-642-31424-7_4","volume-title":"Computer Aided Verification","author":"A.R. Bradley","year":"2012","unstructured":"Bradley, A.R.: IC3 and beyond: Incremental, Inductive Verification. In: Madhusudan, P., Seshia, S.A. (eds.) CAV 2012. LNCS, vol.\u00a07358, p. 4. Springer, Heidelberg (2012)"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1007\/978-3-540-71209-1_28","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"R.E. Bryant","year":"2007","unstructured":"Bryant, R.E., Kroening, D., Ouaknine, J., Seshia, S.A., Strichman, O., Brady, B.A.: Deciding Bit-Vector Arithmetic with Abstraction. In: Grumberg, O., Huth, M. (eds.) TACAS 2007. LNCS, vol.\u00a04424, pp. 358\u2013372. Springer, Heidelberg (2007)"},{"key":"5_CR5","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":"5_CR6","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":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"351","DOI":"10.1007\/978-3-642-23702-7_26","volume-title":"Static Analysis","author":"A.F. Donaldson","year":"2011","unstructured":"Donaldson, A.F., Haller, L., Kroening, D., R\u00fcmmer, P.: Software Verification Using k-Induction. In: Yahav, E. (ed.) Static Analysis. LNCS, vol.\u00a06887, pp. 351\u2013368. Springer, Heidelberg (2011)"},{"key":"5_CR8","unstructured":"E\u00e9n, N., Mishchenko, A., Amla, N.: A single-instance incremental SAT formulation of proof- and counterexample-based abstraction. In: FMCAD, pp. 181\u2013188 (2010)"},{"key":"5_CR9","unstructured":"E\u00e9n, N., Mishchenko, A., Brayton, R.K.: Efficient implementation of property directed reachability. In: FMCAD, pp. 125\u2013134 (2011)"},{"key":"5_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"502","DOI":"10.1007\/978-3-540-24605-3_37","volume-title":"Theory and Applications of Satisfiability Testing","author":"N. E\u00e9n","year":"2004","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: An Extensible SAT-solver. In: Giunchiglia, E., Tacchella, A. (eds.) SAT 2003. LNCS, vol.\u00a02919, pp. 502\u2013518. Springer, Heidelberg (2004)"},{"issue":"4","key":"5_CR11","first-page":"543","volume":"89","author":"N. E\u00e9n","year":"2003","unstructured":"E\u00e9n, N., S\u00f6rensson, N.: Temporal induction by incremental SAT solving. ENTCS\u00a089(4), 543\u2013560 (2003)","journal-title":"ENTCS"},{"issue":"3","key":"5_CR12","doi-asserted-by":"publisher","first-page":"218","DOI":"10.1145\/5666.5673","volume":"29","author":"P. Fleming","year":"1986","unstructured":"Fleming, P., Wallace, J.: How Not To Lie With Statistics: The Correct Way To Summarize Benchmark Results. CACM\u00a029(3), 218\u2013221 (1986)","journal-title":"CACM"},{"issue":"3","key":"5_CR13","first-page":"215","volume":"19","author":"G. Fraser","year":"2009","unstructured":"Fraser, G., Wotawa, F., Ammann, P.: Testing with model checkers: a survey. STVR\u00a019(3), 215\u2013261 (2009)","journal-title":"STVR"},{"key":"5_CR14","doi-asserted-by":"crossref","unstructured":"Gunnarsson, D., Kuntz, S., Farrall, G., Iwai, A., Ernst, R.: Trends in automotive embedded systems. In: CODES+ISSS, pp. 9\u201310 (2012)","DOI":"10.1145\/2380356.2380363"},{"key":"5_CR15","doi-asserted-by":"crossref","unstructured":"G\u00fcnther, H., Weissenbacher, G.: Incremental bounded software model checking. In: SPIN, pp. 40\u201347 (2014)","DOI":"10.1145\/2632362.2632374"},{"key":"5_CR16","doi-asserted-by":"crossref","unstructured":"Hagen, G., Tinelli, C.: Scaling up the formal verification of Lustre programs with SMT-based techniques. In: FMCAD, pp. 1\u20139 (2008)","DOI":"10.1109\/FMCAD.2008.ECP.19"},{"key":"5_CR17","doi-asserted-by":"crossref","unstructured":"Halbwachs, N.: Synchronous programming of reactive systems. Kluwer (1993)","DOI":"10.1007\/978-1-4757-2231-4"},{"key":"5_CR18","unstructured":"Hayhurst, K.J., Veerhusen, D.S., Chilenski, J.J., Rierson, L.K.: A practical tutorial on modified condition\/decision coverage. Tech. rep., NASA (May 2001)"},{"key":"5_CR19","doi-asserted-by":"crossref","unstructured":"Herber, P., Reicherdt, R., Bittner, P.: Bit-precise formal verification of discrete-time MATLAB\/Simulink models using SMT solving. In: EMSOFT, pp. 1\u201310 (2013)","DOI":"10.1109\/EMSOFT.2013.6658586"},{"key":"5_CR20","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1007\/978-3-540-93900-9_15","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A. Holzer","year":"2009","unstructured":"Holzer, A., Schallhart, C., Tautschnig, M., Veith, H.: Query-driven program testing. In: Jones, N.D., M\u00fcller-Olm, M. (eds.) VMCAI 2009. LNCS, vol.\u00a05403, pp. 151\u2013166. Springer, Heidelberg (2009)"},{"issue":"1&2","key":"5_CR21","doi-asserted-by":"publisher","first-page":"177","DOI":"10.1016\/0743-1066(93)90018-C","volume":"15","author":"J.N. Hooker","year":"1993","unstructured":"Hooker, J.N.: Solving the incremental satisfiability problem. JLP\u00a015(1&2), 177\u2013186 (1993)","journal-title":"JLP"},{"key":"5_CR22","unstructured":"ISO 26262: Road vehicles \u2013 Functional safety (2011)"},{"issue":"2","key":"5_CR23","first-page":"51","volume":"119","author":"H. Jin","year":"2005","unstructured":"Jin, H., Somenzi, F.: An incremental algorithm to check satisfiability for bounded model checking. ENTCS\u00a0119(2), 51\u201365 (2005)","journal-title":"ENTCS"},{"key":"5_CR24","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":"5_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"389","DOI":"10.1007\/978-3-642-54862-8_26","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D. Kroening","year":"2014","unstructured":"Kroening, D., Tautschnig, M.: CBMC \u2013 C bounded model checker \u2013 (competition contribution). In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol.\u00a08413, pp. 389\u2013391. Springer, Heidelberg (2014)"},{"key":"5_CR26","doi-asserted-by":"crossref","unstructured":"Manamcheri, K., Mitra, S., Bak, S., Caccamo, M.: A step towards verification and synthesis from Simulink\/Stateflow models. In: HSCC, pp. 317\u2013318 (2011)","DOI":"10.1145\/1967701.1967749"},{"key":"5_CR27","doi-asserted-by":"crossref","unstructured":"Peranandam, P., Raviram, S., Satpathy, M., Yeolekar, A., Gadkari, A.A., Ramesh, S.: An integrated test generation tool for enhanced coverage of Simulink\/Stateflow models. In: DATE, pp. 308\u2013311 (2012)","DOI":"10.1109\/DATE.2012.6176485"},{"issue":"2","key":"5_CR28","first-page":"53","volume":"144","author":"A. Pnueli","year":"2006","unstructured":"Pnueli, A., Strichman, O.: Reduced functional consistency of uninterpreted functions. ENTCS\u00a0144(2), 53\u201365 (2006)","journal-title":"ENTCS"},{"key":"5_CR29","doi-asserted-by":"crossref","unstructured":"Satpathy, M., Yeolekar, A., Ramesh, S.: Randomized directed testing (REDIRECT) for Simulink\/Stateflow models. In: EMSOFT, pp. 217\u2013226 (2008)","DOI":"10.1145\/1450058.1450088"},{"key":"5_CR30","unstructured":"Schrammel, P., Kroening, D., Brain, M., Martins, R., Teige, T., Bienm\u00fcller, T.: Incremental bounded model checking for embedded software (extended version). CoRR abs\/1409.5872 (2014), http:\/\/arxiv.org\/abs\/1409.5872"},{"key":"5_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"108","DOI":"10.1007\/3-540-40922-X_8","volume-title":"Formal Methods in Computer-Aided Design","author":"M. Sheeran","year":"2000","unstructured":"Sheeran, M., Singh, S., St\u00e5lmarck, G.: Checking safety properties using induction and a SAT-solver. In: Johnson, S.D., Hunt Jr., W.A. (eds.) FMCAD 2000. LNCS, vol.\u00a01954, pp. 108\u2013125. Springer, Heidelberg (2000)"},{"key":"5_CR32","doi-asserted-by":"crossref","unstructured":"Silva, J.M., Sakallah, K.A.: Robust search algorithms for test pattern generation. In: FTCS, pp. 152\u2013161 (1997)","DOI":"10.1109\/FTCS.1997.614088"},{"key":"5_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1007\/3-540-44798-9_4","volume-title":"Correct Hardware Design and Verification Methods","author":"O. Shtrichman","year":"2001","unstructured":"Shtrichman, O.: Pruning techniques for the SAT-based bounded model checking problem. In: Margaria, T., Melham, T.F. (eds.) CHARME 2001. LNCS, vol.\u00a02144, pp. 58\u201370. Springer, Heidelberg (2001)"},{"key":"5_CR34","unstructured":"Tip, F.: A survey of program slicing techniques. Tech. rep., CWI-Amsterdam (1994)"},{"key":"5_CR35","doi-asserted-by":"crossref","unstructured":"Whittemore, J., Kim, J., Sakallah, K.A.: SATIRE: A new incremental satisfiability engine. In: DAC, pp. 542\u2013545 (2001)","DOI":"10.1145\/378239.379019"},{"key":"5_CR36","unstructured":"Wieringa, S.: On incremental satisfiability and bounded model checking. In: Design & Impl. of Formal Tools & Sys., pp. 46\u201354 (2011)"}],"container-title":["Lecture Notes in Computer Science","Formal Methods for Industrial Critical Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-19458-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,27]],"date-time":"2025-05-27T22:49:26Z","timestamp":1748386166000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-19458-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319194578","9783319194585"],"references-count":36,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-19458-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}