{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T21:05:59Z","timestamp":1776373559967,"version":"3.51.2"},"publisher-location":"Cham","reference-count":64,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030167219","type":"print"},{"value":"9783030167226","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-16722-6_23","type":"book-chapter","created":{"date-parts":[[2019,4,4]],"date-time":"2019-04-04T02:01:08Z","timestamp":1554343268000},"page":"389-408","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":35,"title":["CoVeriTest: Cooperative Verifier-Based Testing"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0003-4832-7662","authenticated-orcid":false,"given":"Dirk","family":"Beyer","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-Christine","family":"Jakobs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,4,4]]},"reference":[{"key":"23_CR1","doi-asserted-by":"crossref","unstructured":"Baars, A.I., Harman, M., Hassoun, Y., Lakhotia, K., McMinn, P., Tonella, P., Vos, T.E.J.: Symbolic search-based testing. In: Proc. ASE, pp. 53\u201362. IEEE (2011). \n                      https:\/\/doi.org\/10.1109\/ASE.2011.6100119","DOI":"10.1109\/ASE.2011.6100119"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Beckman, N., Nori, A.V., Rajamani, S.K., Simmons, R.J.: Proofs from tests. In: Proc. ISSTA, pp. 3\u201314. ACM (2008). \n                      https:\/\/doi.org\/10.1145\/1390630.1390634","DOI":"10.1145\/1390630.1390634"},{"key":"23_CR3","doi-asserted-by":"publisher","unstructured":"Beyer, D.: Software verification with validation of results (Report on SV-COMP 2017). In: Proc. TACAS, LNCS, vol. 10206, pp. 331\u2013349. Springer, Heidelberg (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-662-54580-5_20","DOI":"10.1007\/978-3-662-54580-5_20"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Beyer, D.: International competition on software testing (Test-Comp). In: Proc. TACAS, Part 3, LNCS, vol. 11429, pp. 167\u2013175. Springer, Cham (2019). \n                      https:\/\/doi.org\/10.1007\/978-3-030-17502-3_11","DOI":"10.1007\/978-3-030-17502-3_11"},{"key":"23_CR5","doi-asserted-by":"crossref","unstructured":"Beyer, D., Chlipala, A.J., Henzinger, T.A., Jhala, R., Majumdar, R.: Generating tests from counterexamples. In: Proc. ICSE, pp. 326\u2013335. IEEE (2004). \n                      https:\/\/doi.org\/10.1109\/ICSE.2004.1317455","DOI":"10.1109\/ICSE.2004.1317455"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Beyer, D., Dangl, M., Dietsch, D., Heizmann, M.: Correctness witnesses: Exchanging verification results between verifiers. In: Proc. FSE, pp. 326\u2013337. ACM (2016). \n                      https:\/\/doi.org\/10.1145\/2950290.2950351","DOI":"10.1145\/2950290.2950351"},{"key":"23_CR7","doi-asserted-by":"crossref","unstructured":"Beyer, D., Dangl, M., Dietsch, D., Heizmann, M., Stahlbauer, A.: Witness validation and stepwise testification across software verifiers. In: Proc. FSE, pp. 721\u2013733. ACM (2015). \n                      https:\/\/doi.org\/10.1145\/2786805.2786867","DOI":"10.1145\/2786805.2786867"},{"issue":"3","key":"23_CR8","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10817-017-9432-6","volume":"60","author":"D Beyer","year":"2018","unstructured":"Beyer, D., Dangl, M., Wendler, P.: A unifying view on SMT-based software verification. J. Autom. Reasoning 60(3), 299\u2013335 (2018). \n                      https:\/\/doi.org\/10.1007\/s10817-017-9432-6","journal-title":"J. Autom. Reasoning"},{"key":"23_CR9","doi-asserted-by":"publisher","unstructured":"Beyer, D., Gulwani, S., Schmidt, D.: Combining model checking and data-flow analysis. In: Clarke, E.M., Henzinger, T.A., Veith, H. (eds.) Handbook on Model Checking, pp. 493\u2013540. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-10575-8_16","DOI":"10.1007\/978-3-319-10575-8_16"},{"key":"23_CR10","doi-asserted-by":"crossref","unstructured":"Beyer, D., Henzinger, T.A., Keremoglu, M.E., Wendler, P.: Conditional model checking: A technique to pass information between verifiers. In: Proc. FSE, pp. 57:1\u201357:11. ACM (2012). \n                      https:\/\/doi.org\/10.1145\/2393596.2393664","DOI":"10.1145\/2393596.2393664"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Beyer, D., Henzinger, T.A., Th\u00e9oduloz, G.: Program analysis with dynamic precision adjustment. In: Proc. ASE, pp. 29\u201338. IEEE (2008). \n                      http:\/\/dx.doi.org\/10.1109\/ASE.2008.13","DOI":"10.1109\/ASE.2008.13"},{"key":"23_CR12","doi-asserted-by":"publisher","unstructured":"Beyer, D., Holzer, A., Tautschnig, M., Veith, H.: Information reuse for multi-goal reachability analyses. In: Proc. ESOP, LNCS, vol. 7792, pp. 472\u2013491. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-37036-6_26","DOI":"10.1007\/978-3-642-37036-6_26"},{"key":"23_CR13","unstructured":"Beyer, D., Jakobs, M.C.: Replication package for article \u201cCoVeriTest: Cooperative verifier-based testing\u201d in Proc. FASE 2019. Zenodo (2019). \n                      https:\/\/doi.org\/10.5281\/zenodo.2566735"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Beyer, D., Jakobs, M.C., Lemberger, T., Wehrheim, H.: Reducer-based construction of conditional verifiers. In: Proc. ICSE, pp. 1182\u20131193. ACM (2018). \n                      https:\/\/doi.org\/10.1145\/3180155.3180259","DOI":"10.1145\/3180155.3180259"},{"key":"23_CR15","doi-asserted-by":"publisher","unstructured":"Beyer, D., Keremoglu, M.E.: CPAchecker: A tool for configurable software verification. In: Proc. CAV, LNCS, vol. 6806, pp. 184\u2013190. Springer, Heidelberg (2011). \n                      https:\/\/doi.org\/10.1007\/978-3-642-22110-1_16","DOI":"10.1007\/978-3-642-22110-1_16"},{"key":"23_CR16","unstructured":"Beyer, D., Keremoglu, M.E., Wendler, P.: Predicate abstraction with adjustable-block encoding. In: Proc. FMCAD, pp. 189\u2013197. FMCAD (2010). \n                      http:\/\/ieeexplore.ieee.org\/document\/5770949\/"},{"key":"23_CR17","doi-asserted-by":"publisher","unstructured":"Beyer, D., Lemberger, T.: Software verification: Testing vs. model checking. In: Proc. HVC, LNCS, vol. 10629, pp. 99\u2013114. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-70389-3_7","DOI":"10.1007\/978-3-319-70389-3_7"},{"key":"23_CR18","doi-asserted-by":"publisher","unstructured":"Beyer, D., L\u00f6we, S.: Explicit-state software model checking based on CEGAR and interpolation. In: Proc. FASE, LNCS, vol. 7793, pp. 146\u2013162. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-37057-1_11","DOI":"10.1007\/978-3-642-37057-1_11"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Beyer, D., L\u00f6we, S., Novikov, E., Stahlbauer, A., Wendler, P.: Precision reuse for efficient regression verification. In: Proc. FSE, pp. 389\u2013399. ACM (2013). \n                      https:\/\/doi.org\/10.1145\/2491411.2491429","DOI":"10.1145\/2491411.2491429"},{"key":"23_CR20","doi-asserted-by":"publisher","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Benchmarking and resource measurement. In: Proc. SPIN, LNCS, vol. 9232, pp. 160\u2013178. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-23404-5_12","DOI":"10.1007\/978-3-319-23404-5_12"},{"key":"23_CR21","doi-asserted-by":"publisher","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Refinement selection. In: Proc. SPIN, LNCS, vol. 9232, pp. 20\u201338. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-23404-5_3","DOI":"10.1007\/978-3-319-23404-5_3"},{"key":"23_CR22","doi-asserted-by":"publisher","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Sliced path prefixes: An effective method to enable refinement selection. In: Proc. FORTE, LNCS, vol. 9039, pp. 228\u2013243. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-19195-9_15","DOI":"10.1007\/978-3-319-19195-9_15"},{"key":"23_CR23","unstructured":"Cadar, C., Dunbar, D., Engler, D.R.: KLEE: Unassisted and automatic generation of high-coverage tests for complex systems programs. In: Proc. OSDI, pp. 209\u2013224. USENIX Association (2008). \n                      http:\/\/www.usenix.org\/events\/osdi08\/tech\/full_papers\/cadar\/cadar.pdf"},{"key":"23_CR24","doi-asserted-by":"publisher","unstructured":"Chalupa, M., Vitovsk\u00e1, M., Strejcek, J.: SYMBIOTIC 5: Boosted instrumentation (competition contribution). In: Proc. TACAS, LNCS, vol. 10806, pp. 442\u2013446. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-89963-3_29","DOI":"10.1007\/978-3-319-89963-3_29"},{"key":"23_CR25","unstructured":"Chebaro, O., Kosmatov, N., Giorgetti, A., Julliand, J.: Program slicing enhances a verification technique combining static and dynamic analysis. In: Proc. SAC, pp. 1284\u20131291. ACM (2012). \n                      http:\/\/doi.acm.org\/10.1145\/2245276.2231980"},{"key":"23_CR26","doi-asserted-by":"crossref","unstructured":"Chowdhury, A.B., Medicherla, R.K., Venkatesh, R.: VeriFuzz: Program aware fuzzing. In: Proc. TACAS, Part 3, LNCS, vol. 11429, pp. 244\u2013249. Springer, Cham (2019). \n                      https:\/\/doi.org\/10.1007\/978-3-030-17502-3_22","DOI":"10.1007\/978-3-030-17502-3_22"},{"key":"23_CR27","unstructured":"Christakis, M., M\u00fcller, P., W\u00fcstholz, V.: Guiding dynamic symbolic execution toward unverified program executions. In: Proc. ICSE, pp. 144\u2013155. ACM (2016). \n                      http:\/\/doi.acm.org\/10.1145\/2884781.2884843"},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Clarke, E.M., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement for symbolic model checking. J. ACM 50(5), 752\u2013794 (2003). \n                      http:\/\/doi.acm.org\/10.1145\/876638.876643","DOI":"10.1145\/876638.876643"},{"key":"23_CR29","unstructured":"Cousot, P., Cousot, R.: Systematic design of program-analysis frameworks. In: Proc. POPL, pp. 269\u2013282. ACM (1979). \n                      http:\/\/doi.acm.org\/10.1145\/567752.567778"},{"key":"23_CR30","unstructured":"Csallner, C., Smaragdakis, Y.: Check \u2018n\u2019 crash: Combining static checking and testing. In: Proc. ICSE, pp. 422\u2013431. ACM (2005). \n                      http:\/\/doi.acm.org\/10.1145\/1062455.1062533"},{"key":"23_CR31","doi-asserted-by":"publisher","unstructured":"Czech, M., Jakobs, M.C., Wehrheim, H.: Just test what you cannot verify! In: Proc. FASE, LNCS, vol. 9033, pp. 100\u2013114. Springer, Heidelberg (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-662-46675-9_7","DOI":"10.1007\/978-3-662-46675-9_7"},{"key":"23_CR32","doi-asserted-by":"publisher","unstructured":"Daca, P., Gupta, A., Henzinger, T.A.: Abstraction-driven concolic testing. In: Proc. VMCAI, LNCS, vol. 9583, pp. 328\u2013347. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49122-5_16","DOI":"10.1007\/978-3-662-49122-5_16"},{"issue":"7","key":"23_CR33","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1109\/TCAD.2008.923410","volume":"27","author":"V D\u2019Silva","year":"2008","unstructured":"D\u2019Silva, V., Kr\u00f6ning, D., Weissenbacher, G.: A survey of automated techniques for formal software verification. IEEE Trans. CAD Integr. Circ. Syst. 27(7), 1165\u20131178 (2008). \n                      https:\/\/doi.org\/10.1109\/TCAD.2008.923410","journal-title":"IEEE Trans. CAD Integr. Circ. Syst."},{"key":"23_CR34","doi-asserted-by":"crossref","unstructured":"Galeotti, J.P., Fraser, G., Arcuri, A.: Improving search-based test suite generation with dynamic symbolic execution. In: Proc. ISSRE, pp. 360\u2013369. IEEE (2013). \n                      https:\/\/doi.org\/10.1109\/ISSRE.2013.6698889","DOI":"10.1109\/ISSRE.2013.6698889"},{"key":"23_CR35","unstructured":"Ge, X., Taneja, K., Xie, T., Tillmann, N.: DyTa: Dynamic symbolic execution guided with static verification results. In: Proc. ICSE, pp. 992\u2013994. ACM (2011). \n                      http:\/\/doi.acm.org\/10.1145\/1985793.1985971"},{"key":"23_CR36","unstructured":"Godefroid, P., Klarlund, N., Sen, K.: Dart: Directed automated random testing. In: Proc. PLDI, pp. 213\u2013223. ACM (2005). \n                      http:\/\/doi.acm.org\/10.1145\/1065010.1065036"},{"key":"23_CR37","unstructured":"Godefroid, P., Nori, A.V., Rajamani, S.K., Tetali, S.: Compositional may-must program analysis: Unleashing the power of alternation. In: Proc. POPL, pp. 43\u201356. ACM (2010). \n                      http:\/\/doi.acm.org\/10.1145\/1706299.1706307"},{"key":"23_CR38","unstructured":"Godefroid, P., Levin, M.Y., Molnar, D.A.: Automated whitebox fuzz testing. In: Proc. NDSS. The Internet Society (2008)"},{"key":"23_CR39","doi-asserted-by":"publisher","unstructured":"Graf, S., Sa\u00efdi, H.: Construction of abstract state graphs with PVS. In: Proc. CAV, LNCS, vol. 1254, pp. 72\u201383. Springer, Heidelberg (1997). \n                      https:\/\/doi.org\/10.1007\/3-540-63166-6_10","DOI":"10.1007\/3-540-63166-6_10"},{"key":"23_CR40","doi-asserted-by":"crossref","unstructured":"Gulavani, B.S., Henzinger, T.A., Kannan, Y., Nori, A.V., Rajamani, S.K.: Synergy: A new algorithm for property checking. In: Proc. FSE, pp. 117\u2013127. ACM (2006). \n                      https:\/\/doi.org\/10.1145\/1181775.1181790","DOI":"10.1145\/1181775.1181790"},{"key":"23_CR41","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., McMillan, K.L.: Abstractions from proofs. In: Proc. POPL, pp. 232\u2013244. ACM (2004). \n                      http:\/\/doi.acm.org\/10.1145\/964001.964021"},{"key":"23_CR42","doi-asserted-by":"publisher","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sanvido, M.A.A.: Extreme model checking. In: Verification: Theory and Practice, pp. 332\u2013358. Springer, Heidelberg (2003). \n                      https:\/\/doi.org\/10.1007\/978-3-540-39910-0_16","DOI":"10.1007\/978-3-540-39910-0_16"},{"key":"23_CR43","doi-asserted-by":"crossref","unstructured":"Henzinger, T.A., Jhala, R., Majumdar, R., Sutre, G.: Lazy abstraction. In: Proc. POPL, pp. 58\u201370. ACM (2002). \n                      https:\/\/doi.org\/10.1145\/503272.503279","DOI":"10.1145\/503272.503279"},{"key":"23_CR44","doi-asserted-by":"publisher","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.) Proc. CAV, LNCS, vol. 5123, pp. 209\u2013213. Springer, Heidelberg (2008). \n                      https:\/\/doi.org\/10.1007\/978-3-540-70545-1_20","DOI":"10.1007\/978-3-540-70545-1_20"},{"key":"23_CR45","doi-asserted-by":"publisher","unstructured":"Holzer, A., Schallhart, C., Tautschnig, M., Veith, H.: Query-driven program testing. In: Proc. VMCAI, LNCS, vol. 5403, pp. 151\u2013166. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-540-93900-9_15","DOI":"10.1007\/978-3-540-93900-9_15"},{"key":"23_CR46","doi-asserted-by":"crossref","unstructured":"Holzer, A., Schallhart, C., Tautschnig, M., Veith, H.: How did you specify your test suite. In: Proc. ASE, pp. 407\u2013416. ACM (2010). \n                      https:\/\/doi.org\/10.1145\/1858996.1859084","DOI":"10.1145\/1858996.1859084"},{"key":"23_CR47","doi-asserted-by":"crossref","unstructured":"Inkumsah, K., Xie, T.: Improving structural testing of object-oriented programs via integrating evolutionary testing and symbolic execution. In: Proc. ASE, pp. 297\u2013306. IEEE (2008). \n                      https:\/\/doi.org\/10.1109\/ASE.2008.40","DOI":"10.1109\/ASE.2008.40"},{"key":"23_CR48","doi-asserted-by":"publisher","unstructured":"Jakobs, M.C.: Speed up configurable certificate validation by certificate reduction and partitioning. In: Proc. SEFM, LNCS, vol. 9276, pp. 159\u2013174. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-22969-0_12","DOI":"10.1007\/978-3-319-22969-0_12"},{"key":"23_CR49","doi-asserted-by":"crossref","unstructured":"Jakobs, M.C., Wehrheim, H.: Certification for configurable program analysis. In: Proc. SPIN, pp. 30\u201339. ACM (2014). \n                      https:\/\/doi.org\/10.1145\/2632362.2632372","DOI":"10.1145\/2632362.2632372"},{"key":"23_CR50","unstructured":"Jalote, P., Vangala, V., Singh, T., Jain, P.: Program partitioning: A framework for combining static and dynamic analysis. In: Proc. WODA, pp. 11\u201316. ACM (2006). \n                      http:\/\/doi.acm.org\/10.1145\/1138912.1138916"},{"key":"23_CR51","doi-asserted-by":"crossref","unstructured":"Kim, Y., Xu, Z., Kim, M., Cohen, M.B., Rothermel, G.: Hybrid directed test suite augmentation: An interleaving framework. In: Proc. ICST, pp. 263\u2013272. IEEE (2014). \n                      https:\/\/doi.org\/10.1109\/ICST.2014.39","DOI":"10.1109\/ICST.2014.39"},{"key":"23_CR52","doi-asserted-by":"crossref","unstructured":"Lemieux, C., Sen, K.: FairFuzz: A targeted mutation strategy for increasing greybox fuzz testing coverage. In: Proc. ASE, pp. 475\u2013485. ACM (2018). \n                      https:\/\/doi.org\/10.1145\/3238147.3238176","DOI":"10.1145\/3238147.3238176"},{"issue":"1","key":"23_CR53","doi-asserted-by":"publisher","first-page":"6","DOI":"10.1186\/s42400-018-0002-y","volume":"1","author":"J Li","year":"2018","unstructured":"Li, J., Zhao, B., Zhang, C.: Fuzzing: A survey. Cybersecurity 1(1), 6 (2018). \n                      https:\/\/doi.org\/10.1186\/s42400-018-0002-y","journal-title":"Cybersecurity"},{"key":"23_CR54","doi-asserted-by":"crossref","unstructured":"Majumdar, R., Sen, K.: Hybrid concolic testing. In: Proc. ICSE, pp. 416\u2013426. IEEE (2007). \n                      https:\/\/doi.org\/10.1109\/ICSE.2007.41","DOI":"10.1109\/ICSE.2007.41"},{"issue":"2","key":"23_CR55","doi-asserted-by":"publisher","first-page":"105","DOI":"10.1002\/stvr.294","volume":"14","author":"P McMinn","year":"2004","unstructured":"McMinn, P.: Search-based software test data generation: A survey. Softw. Test. Verif. Reliab. 14(2), 105\u2013156 (2004). \n                      https:\/\/doi.org\/10.1002\/stvr.294","journal-title":"Softw. Test. Verif. Reliab."},{"key":"23_CR56","unstructured":"Noller, Y., Kersten, R., Pasareanu, C.S.: Badger: Complexity analysis with fuzzing and symbolic execution. In: Proc. ISSTA, pp. 322\u2013332. ACM (2018). \n                      http:\/\/doi.acm.org\/10.1145\/3213846.3213868"},{"key":"23_CR57","doi-asserted-by":"crossref","unstructured":"Pacheco, C., Lahiri, S.K., Ernst, M.D., Ball, T.: Feedback-directed random test generation. In: Proc. ICSE, pp. 75\u201384. IEEE (2007). \n                      https:\/\/doi.org\/10.1109\/ICSE.2007.37","DOI":"10.1109\/ICSE.2007.37"},{"issue":"4","key":"23_CR58","doi-asserted-by":"publisher","first-page":"339","DOI":"10.1007\/s10009-009-0118-1","volume":"11","author":"CS Pasareanu","year":"2009","unstructured":"Pasareanu, C.S., Visser, W.: A survey of new trends in symbolic execution for software testing and analysis. STTT 11(4), 339\u2013353 (2009). \n                      https:\/\/doi.org\/10.1007\/s10009-009-0118-1","journal-title":"STTT"},{"key":"23_CR59","doi-asserted-by":"publisher","unstructured":"Sakti, A., Gu\u00e9h\u00e9neuc, Y., Pesant, G.: Boosting search based testing by using constraint based testing. In: Proc. SSBSE, LNCS, vol. 7515, pp. 213\u2013227. Springer, Heidelberg (2012). \n                      https:\/\/doi.org\/10.1007\/978-3-642-33119-0_16","DOI":"10.1007\/978-3-642-33119-0_16"},{"key":"23_CR60","unstructured":"Stephens, N., Grosen, J., Salls, C., Dutcher, A., Wang, R., Corbetta, J., Shoshitaishvili, Y., Kruegel, C., Vigna, G.: Driller: Augmenting fuzzing through selective symbolic execution. In: Proc. NDSS. The Internet Society (2016). \n                      http:\/\/wp.internetsociety.org\/ndss\/wp-content\/uploads\/sites\/25\/2017\/09\/driller-augmenting-fuzzing-through-selective-symbolic-execution.pdf"},{"key":"23_CR61","unstructured":"Visser, W., P\u0103s\u0103reanu, C.S., Khurshid, S.: Test input generation with Java PathFinder. In: Proc. ISSTA, pp. 97\u2013107. ACM (2004). \n                      http:\/\/doi.acm.org\/10.1145\/1007512.1007526"},{"key":"23_CR62","doi-asserted-by":"publisher","unstructured":"Wendler, P.: CPAchecker with sequential combination of explicit-state analysis and predicate analysis (competition contribution). In: Proc. TACAS, LNCS, vol. 7795, pp. 613\u2013615. Springer, Heidelberg (2013). \n                      https:\/\/doi.org\/10.1007\/978-3-642-36742-7_45","DOI":"10.1007\/978-3-642-36742-7_45"},{"key":"23_CR63","doi-asserted-by":"crossref","unstructured":"Xu, Z., Kim, Y., Kim, M., Rothermel, G.: A hybrid directed test suite augmentation technique. In: Proc. ISSRE, pp. 150\u2013159. IEEE (2011). \n                      https:\/\/doi.org\/10.1109\/ISSRE.2011.21","DOI":"10.1109\/ISSRE.2011.21"},{"key":"23_CR64","unstructured":"Yorsh, G., Ball, T., Sagiv, M.: Testing, abstraction, theorem proving: Better together! In: Proc. ISSTA, pp. 145\u2013156. ACM (2006). \n                      http:\/\/doi.acm.org\/10.1145\/1146238.1146255"}],"container-title":["Lecture Notes in Computer Science","Fundamental Approaches to Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-16722-6_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,20]],"date-time":"2019-05-20T09:13:21Z","timestamp":1558343601000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-16722-6_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030167219","9783030167226"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-16722-6_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"4 April 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"FASE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Fundamental Approaches to Software Engineering","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Prague","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Czech Republic","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":"9 April 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 April 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"fase2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.etaps.org\/2019\/fase","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"74","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"24","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"32% - 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"}},{"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"}},{"value":"7","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}