{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T23:17:06Z","timestamp":1743117426788,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031471148"},{"type":"electronic","value":"9783031471155"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-47115-5_5","type":"book-chapter","created":{"date-parts":[[2023,10,30]],"date-time":"2023-10-30T15:04:38Z","timestamp":1698678278000},"page":"66-84","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Robustness Testing of\u00a0Software Verifiers"],"prefix":"10.1007","author":[{"given":"Florian","family":"Dyck","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2906-6508","authenticated-orcid":false,"given":"Cedric","family":"Richter","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-2385-7512","authenticated-orcid":false,"given":"Heike","family":"Wehrheim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,10,31]]},"reference":[{"doi-asserted-by":"publisher","unstructured":"Beyer, D.: Competition on software verification and witness validation: SV-COMP 2023. In: TACAS. LNCS, vol. 13994, pp. 495\u2013522. Springer, Cham (2023). https:\/\/doi.org\/10.1007\/978-3-031-30820-8_29","key":"5_CR1","DOI":"10.1007\/978-3-031-30820-8_29"},{"key":"5_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"144","DOI":"10.1007\/978-3-030-03421-4_11","volume-title":"Leveraging Applications of Formal Methods, Verification and Validation. Verification","author":"D Beyer","year":"2018","unstructured":"Beyer, D., Dangl, M.: Strategy selection for software verification based on Boolean features. In: Margaria, T., Steffen, B. (eds.) ISoLA 2018. LNCS, vol. 11245, pp. 144\u2013159. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-03421-4_11"},{"key":"5_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"622","DOI":"10.1007\/978-3-319-21690-4_42","volume-title":"Computer Aided Verification","author":"D Beyer","year":"2015","unstructured":"Beyer, D., Dangl, M., Wendler, P.: Boosting k-induction with continuously-refined invariants. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 622\u2013640. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_42"},{"key":"5_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"184","DOI":"10.1007\/978-3-642-22110-1_16","volume-title":"Computer Aided Verification","author":"D Beyer","year":"2011","unstructured":"Beyer, D., Keremoglu, M.E.: CPAchecker: a tool for configurable software verification. In: Gopalakrishnan, G., Qadeer, S. (eds.) CAV 2011. LNCS, vol. 6806, pp. 184\u2013190. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-22110-1_16"},{"unstructured":"Beyer, D., Keremoglu, M.E., Wendler, P.: Predicate abstraction with adjustable-block encoding. In: Proceedings of 10th International Conference on Formal Methods in Computer-Aided Design, FMCAD 2010, Lugano, Switzerland, October 20\u201323, pp. 189\u2013197. IEEE (2010). https:\/\/ieeexplore.ieee.org\/document\/5770949\/","key":"5_CR5"},{"doi-asserted-by":"publisher","unstructured":"Beyer, D., Lemberger, T.: CPA-SymExec: efficient symbolic execution in CPAchecker. In: Proceedings of the 33rd ACM\/IEEE International Conference on Automated Software Engineering, ASE 2018, Montpellier, France, September 3\u20137, 2018, pp. 900\u2013903. ACM (2018). https:\/\/doi.org\/10.1145\/3238147.3240478","key":"5_CR6","DOI":"10.1145\/3238147.3240478"},{"key":"5_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-642-37057-1_11","volume-title":"Fundamental Approaches to Software Engineering","author":"D Beyer","year":"2013","unstructured":"Beyer, D., L\u00f6we, S.: Explicit-state software model checking based on CEGAR and interpolation. In: Cortellessa, V., Varr\u00f3, D. (eds.) FASE 2013. LNCS, vol. 7793, pp. 146\u2013162. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-37057-1_11"},{"issue":"1","key":"5_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s10009-017-0469-y","volume":"21","author":"D Beyer","year":"2019","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Reliable benchmarking: requirements and solutions. Int. J. Softw. Tools Technol. Transf. 21(1), 1\u201329 (2019). https:\/\/doi.org\/10.1007\/s10009-017-0469-y","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"doi-asserted-by":"publisher","unstructured":"Cadar, C., Donaldson, A.F.: Analysing the program analyser. In: ICSE, pp. 765\u2013768. ACM (2016). https:\/\/doi.org\/10.1145\/2889160.2889206","key":"5_CR9","DOI":"10.1145\/2889160.2889206"},{"doi-asserted-by":"publisher","unstructured":"Chalupa, M., Strejcek, J., Vitovsk\u00e1, M.: Joint forces for memory safety checking revisited. Int. J. Softw. Tools Technol. Transf. 22(2), 115\u2013133 (2020). https:\/\/doi.org\/10.1007\/s10009-019-00526-2","key":"5_CR10","DOI":"10.1007\/s10009-019-00526-2"},{"doi-asserted-by":"publisher","unstructured":"Chen, T.Y., Kuo, F., Liu, H., Poon, P., Towey, D., Tse, T.H., Zhou, Z.Q.: Metamorphic testing: a review of challenges and opportunities. ACM Comput. Surv. 51(1), 4:1\u20134:27 (2018). https:\/\/doi.org\/10.1145\/3143561","key":"5_CR11","DOI":"10.1145\/3143561"},{"key":"5_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1007\/978-3-030-01090-4_6","volume-title":"Automated Technology for Verification and Analysis","author":"YT Chen","year":"2018","unstructured":"Chen, Y.T., Furia, C.A.: Robustness testing of intermediate verifiers. In: Lahiri, S.K., Wang, C. (eds.) ATVA 2018. LNCS, vol. 11138, pp. 91\u2013108. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-01090-4_6"},{"key":"5_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1007\/10722167_15","volume-title":"Computer Aided Verification","author":"E Clarke","year":"2000","unstructured":"Clarke, E., Grumberg, O., Jha, S., Lu, Y., Veith, H.: Counterexample-guided abstraction refinement. In: Emerson, E.A., Sistla, A.P. (eds.) CAV 2000. LNCS, vol. 1855, pp. 154\u2013169. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/10722167_15"},{"key":"5_CR14","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., Kroening, D., Lerda, F.: A tool for checking ANSI-C programs. In: Jensen, K., Podelski, A. (eds.) TACAS 2004. LNCS, vol. 2988, pp. 168\u2013176. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24730-2_15"},{"issue":"2","key":"5_CR15","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1007\/BF00264365","volume":"24","author":"R De Nicola","year":"1987","unstructured":"De Nicola, R.: Extensional equivalences for transition systems. Acta Informatica 24(2), 211\u2013237 (1987). https:\/\/doi.org\/10.1007\/BF00264365","journal-title":"Acta Informatica"},{"doi-asserted-by":"publisher","unstructured":"Dolan-Gavitt, B., Hulin, P., Kirda, E., Leek, T., Mambretti, A., Robertson, W.K., Ulrich, F., Whelan, R.: LAVA: large-scale automated vulnerability addition. In: IEEE Symposium on Security and Privacy, SP 2016, pp. 110\u2013121. IEEE Computer Society (2016). https:\/\/doi.org\/10.1109\/SP.2016.15","key":"5_CR16","DOI":"10.1109\/SP.2016.15"},{"doi-asserted-by":"publisher","unstructured":"Dyck, F., Richter, C., Wehrheim, H.: Robustness testing of software verifiers (2023). https:\/\/doi.org\/10.5281\/zenodo.8186536","key":"5_CR17","DOI":"10.5281\/zenodo.8186536"},{"doi-asserted-by":"publisher","unstructured":"Fink, X., Berger, P., Katoen, J.: Configurable benchmarks for C model checkers. In: NFM. LNCS, vol. 13260, pp. 338\u2013354. Springer, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-06773-0_18","key":"5_CR18","DOI":"10.1007\/978-3-031-06773-0_18"},{"key":"5_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/978-3-030-17502-3_15","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"MR Gadelha","year":"2019","unstructured":"Gadelha, M.R., Monteiro, F., Cordeiro, L., Nicole, D.: ESBMC v6.0: verifying C programs using k-induction and invariant inference. In: Beyer, D., Huisman, M., Kordon, F., Steffen, B. (eds.) TACAS 2019. LNCS, vol. 11429, pp. 209\u2013213. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-17502-3_15"},{"issue":"6","key":"5_CR20","doi-asserted-by":"publisher","first-page":"917","DOI":"10.1007\/s10009-021-00617-z","volume":"23","author":"F Howar","year":"2021","unstructured":"Howar, F., Jasper, M., Mues, M., Schmidt, D., Steffen, B.: The RERS challenge: towards controllable and scalable benchmark synthesis. Int. J. Softw. Tools Technol. Transf. 23(6), 917\u2013930 (2021). https:\/\/doi.org\/10.1007\/s10009-021-00617-z","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"doi-asserted-by":"publisher","unstructured":"Kapus, T., Cadar, C.: Automatic testing of symbolic execution engines via program generation and differential testing. In: ASE, pp. 590\u2013600. IEEE Computer Society (2017). https:\/\/doi.org\/10.1109\/ASE.2017.8115669","key":"5_CR21","DOI":"10.1109\/ASE.2017.8115669"},{"doi-asserted-by":"publisher","unstructured":"Le, V., Afshari, M., Su, Z.: Compiler validation via equivalence modulo inputs. In: O\u2019Boyle, M.F.P., Pingali, K. (eds.) PLDI \u201914, pp. 216\u2013226. ACM (2014). https:\/\/doi.org\/10.1145\/2594291.2594334","key":"5_CR22","DOI":"10.1145\/2594291.2594334"},{"doi-asserted-by":"publisher","unstructured":"Le, V., Sun, C., Su, Z.: Finding deep compiler bugs via guided stochastic program mutation. In: Aldrich, J., Eugster, P. (eds.) OOPSLA 2015, pp. 386\u2013399. ACM (2015). https:\/\/doi.org\/10.1145\/2814270.2814319","key":"5_CR23","DOI":"10.1145\/2814270.2814319"},{"unstructured":"Milner, R.: Communication and Concurrency. PHI Series in Computer Science, Prentice Hall (1989)","key":"5_CR24"},{"doi-asserted-by":"publisher","unstructured":"Schott, S., Pauck, F.: Benchmark fuzzing for android taint analyses. In: SCAM, pp. 12\u201323. IEEE (2022). https:\/\/doi.org\/10.1109\/SCAM55253.2022.00007","key":"5_CR25","DOI":"10.1109\/SCAM55253.2022.00007"},{"issue":"5","key":"5_CR26","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1007\/s10009-014-0336-z","volume":"16","author":"B Steffen","year":"2014","unstructured":"Steffen, B., Isberner, M., Naujokat, S., Margaria, T., Geske, M.: Property-driven benchmark generation: synthesizing programs of realistic structure. Int. J. Softw. Tools Technol. Transf. 16(5), 465\u2013479 (2014). https:\/\/doi.org\/10.1007\/s10009-014-0336-z","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"doi-asserted-by":"publisher","unstructured":"Sun, C., Le, V., Su, Z.: Finding compiler bugs via live code mutation. In: Visser, E., Smaragdakis, Y. (eds.) OOPSLA 2016, pp. 849\u2013863. ACM (2016). https:\/\/doi.org\/10.1145\/2983990.2984038","key":"5_CR27","DOI":"10.1145\/2983990.2984038"},{"doi-asserted-by":"publisher","unstructured":"Zhang, C., Su, T., Yan, Y., Zhang, F., Pu, G., Su, Z.: Finding and understanding bugs in software model checkers. In: ESEC\/SIGSOFT FSE, pp. 763\u2013773. ACM (2019). https:\/\/doi.org\/10.1145\/3338906.3338932","key":"5_CR28","DOI":"10.1145\/3338906.3338932"}],"container-title":["Lecture Notes in Computer Science","Software Engineering and Formal Methods"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47115-5_5","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,4]],"date-time":"2023-11-04T00:02:24Z","timestamp":1699056144000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47115-5_5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031471148","9783031471155"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47115-5_5","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"31 October 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"SEFM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Software Engineering and Formal Methods","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Eindhoven","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"The Netherlands","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"6 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"sefm2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/sefm-conference.github.io\/2023\/","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":"41","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":"19","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":"0","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":"46% - 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":"3","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":"4,5","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)"}}]}}