{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,3]],"date-time":"2026-03-03T06:31:46Z","timestamp":1772519506135,"version":"3.50.1"},"publisher-location":"Cham","reference-count":61,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319965611","type":"print"},{"value":"9783319965628","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96562-8_8","type":"book-chapter","created":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T13:43:34Z","timestamp":1532094214000},"page":"205-218","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Constraint-Based Behavioral Consistency of Evolving Software Systems"],"prefix":"10.1007","author":[{"given":"Reiner","family":"H\u00e4hnle","sequence":"first","affiliation":[]},{"given":"Bernhard","family":"Steffen","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,7,20]]},"reference":[{"key":"8_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"10","DOI":"10.1007\/978-3-642-32759-9_4","volume-title":"FM 2012: Formal Methods","author":"F Aarts","year":"2012","unstructured":"Aarts, F., Heidarian, F., Kuppens, H., Olsen, P., Vaandrager, F.: Automata learning through counterexample guided abstraction refinement. In: Giannakopoulou, D., M\u00e9ry, D. (eds.) FM 2012. LNCS, vol. 7436, pp. 10\u201327. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-32759-9_4"},{"issue":"1","key":"8_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10703-014-0216-x","volume":"46","author":"F Aarts","year":"2015","unstructured":"Aarts, F., Jonsson, B., Uijen, J., Vaandrager, F.W.: Generating models of infinite-state communication protocols using regular inference with abstraction. Formal Methods Syst. Des. 46(1), 1\u201341 (2015)","journal-title":"Formal Methods Syst. Des."},{"key":"8_CR3","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511624162","volume-title":"The B Book: Assigning Programs to Meanings","author":"J-R Abrial","year":"1996","unstructured":"Abrial, J.-R.: The B Book: Assigning Programs to Meanings. Cambridge University Press, Cambridge (1996)"},{"key":"8_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-49812-6","volume-title":"Deductive Software Verification-The KeY Book: From Theory to Practice","year":"2016","unstructured":"Ahrendt, W., Beckert, B., Bubel, R., H\u00e4hnle, R., Schmitt, P., Ulbrich, M. (eds.): Deductive Software Verification-The KeY Book: From Theory to Practice. LNCS, vol. 10001. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-49812-6"},{"issue":"1","key":"8_CR5","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1007\/s10703-017-0274-y","volume":"51","author":"W Ahrendt","year":"2017","unstructured":"Ahrendt, W., Chimento, J.M., Pace, G.J., Schneider, G.: Verifying data- and control-oriented properties combining static and runtime verification: theory and tools. Formal Methods Syst. Des. 51(1), 200\u2013265 (2017)","journal-title":"Formal Methods Syst. Des."},{"key":"8_CR6","doi-asserted-by":"crossref","unstructured":"Ahrendt, W., Gladisch, C., Herda, M.: Proof-based test case generation. In: Ahrendt et al. [4], chap. 12, pp. 415\u2013451","DOI":"10.1007\/978-3-319-49812-6_12"},{"key":"8_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"562","DOI":"10.1007\/978-3-642-54862-8_46","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"E Albert","year":"2014","unstructured":"Albert, E., et al.: SACO: static analyzer for concurrent objects. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 562\u2013567. Springer, Heidelberg (2014). https:\/\/doi.org\/10.1007\/978-3-642-54862-8_46"},{"issue":"4","key":"8_CR8","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1007\/s10270-015-0476-y","volume":"15","author":"E Albert","year":"2016","unstructured":"Albert, E., Bubel, R., Genaim, S., H\u00e4hnle, R., D\u00edez, G.R.: A formal verification framework for static analysis\u2014as well as its instantiation to the resource analyzer COSTA and formal verification tool KeY. Softw. Syst. Model. 15(4), 987\u20131012 (2016)","journal-title":"Softw. Syst. Model."},{"issue":"4","key":"8_CR9","doi-asserted-by":"crossref","first-page":"323","DOI":"10.1007\/s11761-013-0148-0","volume":"8","author":"E Albert","year":"2014","unstructured":"Albert, E., de Boer, F.S., H\u00e4hnle, R., Johnsen, E.B., Schlatte, R., Tarifa, S.L.T., Wong, P.Y.H.: Formal modeling of resource management for cloud architectures: an industrial case study using real-time ABS. J. Serv.-Oriented Comput. Appl. 8(4), 323\u2013339 (2014)","journal-title":"J. Serv.-Oriented Comput. Appl."},{"key":"8_CR10","doi-asserted-by":"crossref","unstructured":"Albert, E., G\u00f3mez-Zamalloa, M., Isabel, M.: SYCO: a systematic testing tool for concurrent objects. In: Zaks, A., Hermenegildo, M.V. (eds.) Proceedings of the 25th International Conference on Compiler Construction, CC, Barcelona, Spain, pp. 269\u2013270. ACM (2016)","DOI":"10.1145\/2892208.2892236"},{"issue":"2","key":"8_CR11","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0890-5401(87)90052-6","volume":"75","author":"D Angluin","year":"1987","unstructured":"Angluin, D.: Learning regular sets from queries and counterexamples. Inf. Comput. 75(2), 87\u2013106 (1987)","journal-title":"Inf. Comput."},{"key":"8_CR12","doi-asserted-by":"crossref","unstructured":"Beckert, B., Klebanov, V., Wei\u00df, B.: Dynamic logic for Java. In: Ahrendt et al. [4], chapt. 3, pp. 49\u2013106","DOI":"10.1007\/978-3-319-49812-6_3"},{"issue":"88","key":"8_CR13","first-page":"28","volume":"2012","author":"A Bertolino","year":"2012","unstructured":"Bertolino, A., Calabr\u00f2, A., Merten, M., Steffen, B.: Never-stop learning: continuous validation of learned models for evolving systems through monitoring. ERCIM News 2012(88), 28\u201329 (2012)","journal-title":"ERCIM News"},{"key":"8_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-319-07317-0_1","volume-title":"Formal Methods for Executable Software Models","author":"R Bubel","year":"2014","unstructured":"Bubel, R., Montoya, A.F., H\u00e4hnle, R.: Analysis of executable software models. In: Bernardo, M., Damiani, F., H\u00e4hnle, R., Johnsen, E.B., Schaefer, I. (eds.) SFM 2014. LNCS, vol. 8483, pp. 1\u201325. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-07317-0_1"},{"key":"8_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/978-3-319-10431-7_18","volume-title":"Software Engineering and Formal Methods","author":"S Cassel","year":"2014","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Learning extended finite state machines. In: Giannakopoulou, D., Sala\u00fcn, G. (eds.) SEFM 2014. LNCS, vol. 8702, pp. 250\u2013264. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10431-7_18"},{"key":"8_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1007\/978-3-319-96562-8_6","volume-title":"ML for Dynamic Software Analysis","author":"S Cassel","year":"2018","unstructured":"Cassel, S., Howar, F., Jonsson, B., Steffen, B.: Extending automata learning to extended finite state machine. In: Bennaceur, A., H\u00e4hnle, R., Meinke, K. (eds.) ML for Dynamic Software Analysis. LNCS, vol. 11026, pp. 149\u2013177. Springer, Cham (2018)"},{"key":"8_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-319-23820-3_21","volume-title":"Runtime Verification","author":"JM Chimento","year":"2015","unstructured":"Chimento, J.M., Ahrendt, W., Pace, G.J., Schneider, G.: StaRVOOrS : a tool for combined static and runtime verification of Java. In: Bartocci, E., Majumdar, R. (eds.) RV 2015. LNCS, vol. 9333, pp. 297\u2013305. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-23820-3_21"},{"key":"8_CR18","doi-asserted-by":"crossref","unstructured":"Cok, D.R., Griggio, A., Bruttomesso, R., Deters, M.: The 2012 SMT competition. In: Fontaine, P., Goel, A. (eds.) 10th International Workshop on Satisfiability Modulo Theories, SMT, Manchester, UK, EPiC Series in Computing, vol. 20, pp. 131\u2013142. EasyChair (2013)","DOI":"10.29007\/gj66"},{"key":"8_CR19","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"273","DOI":"10.1007\/978-3-319-21690-4_16","volume-title":"Computer Aided Verification","author":"S Gouw de","year":"2015","unstructured":"de Gouw, S., Rot, J., de Boer, F.S., Bubel, R., H\u00e4hnle, R.: OpenJDK\u2019s Java.utils.collection.sort() is broken: the good, the bad and the worst case. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 273\u2013289. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_16"},{"key":"8_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"517","DOI":"10.1007\/978-3-319-21401-6_35","volume-title":"Automated Deduction \u2013 CADE-25","author":"CC Din","year":"2015","unstructured":"Din, C.C., Bubel, R., H\u00e4hnle, R.: KeY-ABS: a deductive verification tool for the concurrent modelling language ABS. In: Felty, A.P., Middeldorp, A. (eds.) CADE 2015. LNCS (LNAI), vol. 9195, pp. 517\u2013526. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21401-6_35"},{"key":"8_CR21","series-title":"IFIP Advances in Information and Communication Technology","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1007\/978-3-319-18467-8_27","volume-title":"ICT Systems Security and Privacy Protection","author":"QH Do","year":"2015","unstructured":"Do, Q.H., Bubel, R., H\u00e4hnle, R.: Exploit generation for information flow leaks in object-oriented programs. In: Federrath, H., Gollmann, D. (eds.) SEC 2015. IAICT, vol. 455, pp. 401\u2013415. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-18467-8_27"},{"key":"8_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-540-73770-4_10","volume-title":"Tests and Proofs","author":"C Engel","year":"2007","unstructured":"Engel, C., H\u00e4hnle, R.: Generating unit tests from formal proofs. In: Gurevich, Y., Meyer, B. (eds.) TAP 2007. LNCS, vol. 4454, pp. 169\u2013188. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-73770-4_10"},{"issue":"5","key":"8_CR23","doi-asserted-by":"crossref","first-page":"609","DOI":"10.1007\/s10009-014-0328-z","volume":"16","author":"M Felderer","year":"2014","unstructured":"Felderer, M., Ramler, R.: A multiple case study on risk-based testing in industry. Int. J. Softw. Tools Technol. Transf. 16(5), 609\u2013625 (2014)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"issue":"4","key":"8_CR24","doi-asserted-by":"crossref","first-page":"1013","DOI":"10.1007\/s10270-014-0444-y","volume":"15","author":"E Giachino","year":"2016","unstructured":"Giachino, E., Laneve, C., Lienhardt, M.: A framework for deadlock detection in core ABS. Softw. Syst. Model. 15(4), 1013\u20131048 (2016)","journal-title":"Softw. Syst. Model."},{"key":"8_CR25","volume-title":"Software Runaways: Monumental Software Disasters","author":"RL Glass","year":"1997","unstructured":"Glass, R.L.: Software Runaways: Monumental Software Disasters. Prentice Hall, Upper Saddle River (1997)"},{"key":"8_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"80","DOI":"10.1007\/3-540-45923-5_6","volume-title":"Fundamental Approaches to Software Engineering","author":"A Hagerer","year":"2002","unstructured":"Hagerer, A., Hungar, H., Niese, O., Steffen, B.: Model generation by moderated regular extrapolation. In: Kutsche, R.-D., Weber, H. (eds.) FASE 2002. LNCS, vol. 2306, pp. 80\u201395. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45923-5_6"},{"key":"8_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40615-7_1","volume-title":"Formal Methods for Components and Objects","author":"R H\u00e4hnle","year":"2013","unstructured":"H\u00e4hnle, R.: The abstract behavioral specification language: a tutorial introduction. In: Giachino, E., H\u00e4hnle, R., de Boer, F.S., Bonsangue, M.M. (eds.) FMCO 2012. LNCS, vol. 7866, pp. 1\u201337. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40615-7_1"},{"key":"8_CR28","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/978-3-319-53946-1_4","volume-title":"Formal Techniques for Safety-Critical Systems","author":"E Kamburjan","year":"2017","unstructured":"Kamburjan, E., H\u00e4hnle, R.: Uniform modeling of railway operations. In: Artho, C., \u00d6lveczky, P.C. (eds.) FTSCS 2016. CCIS, vol. 694, pp. 55\u201371. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-53946-1_4"},{"key":"8_CR29","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"255","DOI":"10.1007\/978-3-319-11164-3_21","volume-title":"Runtime Verification","author":"M Hentschel","year":"2014","unstructured":"Hentschel, M., Bubel, R., H\u00e4hnle, R.: Symbolic execution debugger (SED). In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 255\u2013262. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_21"},{"key":"8_CR30","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"123","DOI":"10.1007\/978-3-319-96562-8_5","volume-title":"ML for Dynamic Software Analysis","author":"F Howar","year":"2018","unstructured":"Howar, F., Steffen, B.: Active automata learning in practice: an annotated bibliography of the years 2011 to 2016. In: Bennaceur, A., H\u00e4hnle, R., Meinke, K. (eds.) ML for Dynamic Software Analysis. LNCS, vol. 11026, pp. 123\u2013148. Springer, Cham (2018)"},{"key":"8_CR31","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1007\/978-3-642-27940-9_17","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F Howar","year":"2012","unstructured":"Howar, F., Steffen, B., Jonsson, B., Cassel, S.: Inferring canonical register automata. In: Kuncak, V., Rybalchenko, A. (eds.) VMCAI 2012. LNCS, vol. 7148, pp. 251\u2013266. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-27940-9_17"},{"key":"8_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"687","DOI":"10.1007\/978-3-642-16558-0_55","volume-title":"Leveraging Applications of Formal Methods, Verification, and Validation","author":"F Howar","year":"2010","unstructured":"Howar, F., Steffen, B., Merten, M.: From ZULU to RERS. In: Margaria, T., Steffen, B. (eds.) ISoLA 2010. LNCS, vol. 6415, pp. 687\u2013704. Springer, Heidelberg (2010). https:\/\/doi.org\/10.1007\/978-3-642-16558-0_55"},{"key":"8_CR33","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"263","DOI":"10.1007\/978-3-642-18275-4_19","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"F Howar","year":"2011","unstructured":"Howar, F., Steffen, B., Merten, M.: Automata learning with automated alphabet abstraction refinement. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 263\u2013277. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18275-4_19"},{"key":"8_CR34","unstructured":"Isberner, M.: Foundations of active automata learning: an algorithmic perspective. Ph.D. thesis, TU Dortmund University (2015)"},{"key":"8_CR35","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"124","DOI":"10.1007\/978-3-642-38088-4_9","volume-title":"NASA Formal Methods","author":"M Isberner","year":"2013","unstructured":"Isberner, M., Howar, F., Steffen, B.: Inferring automata with state-local alphabet abstractions. In: Brat, G., Rungta, N., Venet, A. (eds.) NFM 2013. LNCS, vol. 7871, pp. 124\u2013138. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-38088-4_9"},{"issue":"1\u20132","key":"8_CR36","doi-asserted-by":"crossref","first-page":"65","DOI":"10.1007\/s10994-013-5419-7","volume":"96","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: Learning register automata: from languages to program structures. Mach. Learn. 96(1\u20132), 65\u201398 (2014)","journal-title":"Mach. Learn."},{"key":"8_CR37","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"307","DOI":"10.1007\/978-3-319-11164-3_26","volume-title":"Runtime Verification","author":"M Isberner","year":"2014","unstructured":"Isberner, M., Howar, F., Steffen, B.: The TTT algorithm: a redundancy-free approach to active automata learning. In: Bonakdarpour, B., Smolka, S.A. (eds.) RV 2014. LNCS, vol. 8734, pp. 307\u2013322. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-11164-3_26"},{"key":"8_CR38","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"487","DOI":"10.1007\/978-3-319-21690-4_32","volume-title":"Computer Aided Verification","author":"M Isberner","year":"2015","unstructured":"Isberner, M., Howar, F., Steffen, B.: The open-source LearnLib. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 487\u2013495. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_32"},{"key":"8_CR39","unstructured":"Isberner, M., Steffen, B.: An abstract framework for counterexample analysis in active automata learning. In: Proceedings of the 12th International Conference on Grammatical Inference, volume 34 of JMLR Workshop & Conference Proceedings, pp. 79\u201393 (2014)"},{"key":"8_CR40","doi-asserted-by":"crossref","unstructured":"Jabbari, R., Bin Ali, N., Petersen, K., Tanveer, B.: What is DevOps? A systematic mapping study on definitions and practices. In: Proceedings of the Scientific Workshops of XP 2016, Edinburgh, Scotland, UK, p. 12. ACM (2016)","DOI":"10.1145\/2962695.2962707"},{"key":"8_CR41","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/978-3-642-40561-7_20","volume-title":"Software Engineering and Formal Methods","author":"R Ji","year":"2013","unstructured":"Ji, R., H\u00e4hnle, R., Bubel, R.: Program transformation based on symbolic execution and deduction. In: Hierons, R.M., Merayo, M.G., Bravetti, M. (eds.) SEFM 2013. LNCS, vol. 8137, pp. 289\u2013304. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-40561-7_20"},{"key":"8_CR42","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"142","DOI":"10.1007\/978-3-642-25271-6_8","volume-title":"Formal Methods for Components and Objects","author":"EB Johnsen","year":"2011","unstructured":"Johnsen, E.B., H\u00e4hnle, R., Sch\u00e4fer, J., Schlatte, R., Steffen, M.: ABS: a core language for abstract behavioral specification. In: Aichernig, B.K., de Boer, F.S., Bonsangue, M.M. (eds.) FMCO 2010. LNCS, vol. 6957, pp. 142\u2013164. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25271-6_8"},{"key":"8_CR43","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/978-3-642-21455-4_10","volume-title":"Formal Methods for Eternal Networked Software Systems","author":"B Jonsson","year":"2011","unstructured":"Jonsson, B.: Learning of automata models extended with data. In: Bernardo, M., Issarny, V. (eds.) SFM 2011. LNCS, vol. 6659, pp. 327\u2013349. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-21455-4_10"},{"key":"8_CR44","volume-title":"Scientific Method in Practice","author":"HG Gauch Jr","year":"2003","unstructured":"Gauch Jr., H.G.: Scientific Method in Practice. Cambridge University Press, Cambridge (2003)"},{"key":"8_CR45","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1007\/978-3-319-33693-0_2","volume-title":"Integrated Formal Methods","author":"L Kov\u00e1cs","year":"2016","unstructured":"Kov\u00e1cs, L.: Symbolic computation and automated reasoning for program analysis. In: \u00c1brah\u00e1m, E., Huisman, M. (eds.) IFM 2016. LNCS, vol. 9681, pp. 20\u201327. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-33693-0_2"},{"key":"8_CR46","doi-asserted-by":"crossref","unstructured":"Margaria, T., Steffen, B.: Business process modelling in the jABC: the one-thing-approach. In: Handbook of Research on Business Process Modeling, IGI Global (2009)","DOI":"10.4018\/978-1-60566-288-6.ch001"},{"key":"8_CR47","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1007\/978-1-4471-2297-5_10","volume-title":"Conquering Complexity","author":"T Margaria","year":"2012","unstructured":"Margaria, T., Steffen, B.: Service-orientation: conquering complexity with XMDD. In: Hinchey, M., Coyle, L. (eds.) Conquering Complexity, pp. 217\u2013236. Springer, London (2012). https:\/\/doi.org\/10.1007\/978-1-4471-2297-5_10"},{"key":"8_CR48","doi-asserted-by":"crossref","unstructured":"Maurer, A.: Ockham\u2019s razor and dialectical reasoning. Pontifical Institute of Mediaeval Studies (1996)","DOI":"10.1484\/J.MS.2.306862"},{"key":"8_CR49","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"220","DOI":"10.1007\/978-3-642-19835-9_18","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"M Merten","year":"2011","unstructured":"Merten, M., Steffen, B., Howar, F., Margaria, T.: Next generation LearnLib. In: Abdulla, P.A., Leino, K.R.M. (eds.) TACAS 2011. LNCS, vol. 6605, pp. 220\u2013223. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-19835-9_18"},{"issue":"5","key":"8_CR50","doi-asserted-by":"crossref","first-page":"569","DOI":"10.1007\/s10009-014-0321-6","volume":"16","author":"J Neubauer","year":"2014","unstructured":"Neubauer, J., Windm\u00fcller, S., Steffen, B.: Risk-based testing via active continuous quality control. Int. J. Softw. Tools Technol. Transf. 16(5), 569\u2013591 (2014)","journal-title":"Int. J. Softw. Tools Technol. Transf."},{"key":"8_CR51","doi-asserted-by":"crossref","unstructured":"P\u00e9rez, J.F., Wang, W., Casale, G.: Towards a DevOps approach for software quality engineering. In: Proceedings of Workshop on Challenges in Performance Methods for Software Development, WOSP-C 2015, Austin, TX, USA, pp. 5\u201310. ACM (2015)","DOI":"10.1145\/2693561.2693564"},{"key":"8_CR52","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1007\/11916277_29","volume-title":"Logic for Programming, Artificial Intelligence, and Reasoning","author":"P R\u00fcmmer","year":"2006","unstructured":"R\u00fcmmer, P.: Sequential, parallel, and quantified updates of first-order structures. In: Hermann, M., Voronkov, A. (eds.) LPAR 2006. LNCS (LNAI), vol. 4246, pp. 422\u2013436. Springer, Heidelberg (2006). https:\/\/doi.org\/10.1007\/11916277_29"},{"key":"8_CR53","doi-asserted-by":"crossref","unstructured":"Scheben, C., Greiner, S.: Information flow analysis. In: Ahrendt et al. [4], chap. 13, pp. 453\u2013472","DOI":"10.1007\/978-3-319-49812-6_13"},{"key":"8_CR54","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/BFb0023444","volume-title":"STACS 97","author":"B Steffen","year":"1997","unstructured":"Steffen, B.: Unifying models. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 1\u201320. Springer, Heidelberg (1997). https:\/\/doi.org\/10.1007\/BFb0023444"},{"issue":"2","key":"8_CR55","first-page":"78","volume":"17","author":"B Steffen","year":"1996","unstructured":"Steffen, B., Margaria, T., Cla\u00dfen, A., Braun, V.: Incremental formalization: a key to industrial success. Softw. Concepts Tools 17(2), 78\u201395 (1996)","journal-title":"Softw. Concepts Tools"},{"key":"8_CR56","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/978-3-540-70889-6_7","volume-title":"Hardware and Software, Verification and Testing","author":"B Steffen","year":"2007","unstructured":"Steffen, B., Margaria, T., Nagel, R., J\u00f6rges, S., Kubczak, C.: Model-driven development with the jABC. In: Bin, E., Ziv, A., Ur, S. (eds.) HVC 2006. LNCS, vol. 4383, pp. 92\u2013108. Springer, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-70889-6_7"},{"key":"8_CR57","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/978-3-642-18275-4_4","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"B Steffen","year":"2011","unstructured":"Steffen, B., R\u00fcthing, O.: Quality engineering: leveraging heterogeneous information. In: Jhala, R., Schmidt, D. (eds.) VMCAI 2011. LNCS, vol. 6538, pp. 23\u201337. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-18275-4_4"},{"issue":"3","key":"8_CR58","doi-asserted-by":"crossref","first-page":"423","DOI":"10.3233\/AIC-150691","volume":"29","author":"G Sutcliffe","year":"2016","unstructured":"Sutcliffe, G., Urban, J.: The CADE-25 automated theorem proving system competition: CASC-25. AI Commun. 29(3), 423\u2013433 (2016)","journal-title":"AI Commun."},{"key":"8_CR59","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-3-319-25942-0_16","volume-title":"Dependable Software Engineering: Theories, Tools, and Applications","author":"N Wasser","year":"2015","unstructured":"Wasser, N.: Generating specifications for recursive methods by abstracting program states. In: Li, X., Liu, Z., Yi, W. (eds.) SETTA 2015. LNCS, vol. 9409, pp. 243\u2013257. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-25942-0_16"},{"key":"8_CR60","doi-asserted-by":"crossref","unstructured":"Windm\u00fcller, S., et al.: Active continuous quality control. In: 16th International ACM Sigsoft Symposium on Component-Based Software Engineering, Vancouver, Canada (2013)","DOI":"10.1145\/2465449.2465469"},{"issue":"5","key":"8_CR61","doi-asserted-by":"crossref","first-page":"567","DOI":"10.1007\/s10009-012-0250-1","volume":"14","author":"PYH Wong","year":"2012","unstructured":"Wong, P.Y.H., Albert, E., Muschevici, R., Proen\u00e7a, J., Sch\u00e4fer, J., Schlatte, R.: The ABS tool suite: modelling, executing and analysing distributed adaptable object-oriented systems. STTT 14(5), 567\u2013588 (2012)","journal-title":"STTT"}],"container-title":["Lecture Notes in Computer Science","Machine Learning for Dynamic Software Analysis: Potentials and Limits"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96562-8_8","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,5]],"date-time":"2025-07-05T22:48:02Z","timestamp":1751755682000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96562-8_8"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319965611","9783319965628"],"references-count":61,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96562-8_8","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]}}}