{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,16]],"date-time":"2026-04-16T02:09:44Z","timestamp":1776305384702,"version":"3.50.1"},"reference-count":72,"publisher":"Springer Science and Business Media LLC","issue":"1-2","license":[{"start":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T00:00:00Z","timestamp":1587168000000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T00:00:00Z","timestamp":1587168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/501100001659","name":"Deutsche Forschungsgemeinschaft","doi-asserted-by":"publisher","award":["SFB 901"],"award-info":[{"award-number":["SFB 901"]}],"id":[{"id":"10.13039\/501100001659","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Autom Softw Eng"],"published-print":{"date-parts":[[2020,6]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>Algorithm selection is the task of choosing an algorithm from a given set of candidate algorithms when faced with a particular problem instance. Algorithm selection via machine learning (ML) has recently been successfully applied for various problem classes, including computationally hard problems such as SAT. In this paper, we study algorithm selection for<jats:italic>software validation<\/jats:italic>, i.e., the task of choosing a software validation tool for a given validation instance. A validation instance consists of a program plus properties to be checked on it. The application of machine learning techniques to this task first of all requires an appropriate<jats:italic>representation<\/jats:italic>of software. To this end, we propose a dedicated<jats:italic>kernel function<\/jats:italic>, which compares two programs in terms of their similarity, thus making the algorithm selection task amenable to kernel-based machine learning methods. Our kernel operates on a graph representation of source code mixing elements of control-flow and program-dependence graphs with abstract syntax trees. Thus, given two such representations as input, the kernel function yields a real-valued score that can be interpreted as a degree of similarity. We experimentally evaluate our kernel in two learning scenarios, namely a classification and a ranking problem: (1) selecting between a verification and a testing tool for bug finding (i.e., property violation), and (2) ranking several verification tools, from presumably best to worst, for property proving. The evaluation, which is based on data sets from the annual software verification competition SV-COMP, demonstrates our kernel to generalize well and to achieve rather high prediction accuracy, both for the classification and the ranking task.<\/jats:p>","DOI":"10.1007\/s10515-020-00270-x","type":"journal-article","created":{"date-parts":[[2020,4,18]],"date-time":"2020-04-18T05:02:47Z","timestamp":1587186167000},"page":"153-186","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":43,"title":["Algorithm selection for software validation based on graph kernels"],"prefix":"10.1007","volume":"27","author":[{"given":"Cedric","family":"Richter","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eyke","family":"H\u00fcllermeier","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marie-Christine","family":"Jakobs","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Heike","family":"Wehrheim","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,4,18]]},"reference":[{"key":"270_CR1","doi-asserted-by":"crossref","unstructured":"Albarghouthi, A., Li, Y., Gurfinkel, A., Chechik, M.: Ufo: a framework for abstraction- and interpolation-based software verification. In: CAV, LNCS, vol. 7358, pp. 672\u2013678. Springer (2012)","DOI":"10.1007\/978-3-642-31424-7_48"},{"key":"270_CR2","unstructured":"Allamanis, M., Brockschmidt, M., Khademi, M.: Learning to represent programs with graphs. CoRR arXiv:1711.00740 (2017)"},{"issue":"4","key":"270_CR3","doi-asserted-by":"publisher","first-page":"81:1","DOI":"10.1145\/3212695","volume":"51","author":"M Allamanis","year":"2018","unstructured":"Allamanis, M., Barr, E.T., Devanbu, P.T., Sutton, C.A.: A survey of machine learning for big code and naturalness. ACM Comput. Surv. 51(4), 81:1\u201381:37 (2018)","journal-title":"ACM Comput. Surv."},{"key":"270_CR4","doi-asserted-by":"crossref","unstructured":"Alon, U., Zilberstein, M., Levy, O., Yahav, E.: A general path-based representation for predicting program properties. In: Proc. PLDI, pp. 404\u2013419. ACM (2018)","DOI":"10.1145\/3296979.3192412"},{"issue":"POPL","key":"270_CR5","first-page":"40:1","volume":"3","author":"U Alon","year":"2019","unstructured":"Alon, U., Zilberstein, M., Levy, O., Yahav, E.: code2vec: learning distributed representations of code. PACMPL 3(POPL), 40:1\u201340:29 (2019)","journal-title":"PACMPL"},{"issue":"12","key":"270_CR6","doi-asserted-by":"publisher","first-page":"2584","DOI":"10.1080\/02664763.2015.1043870","volume":"42","author":"IL Amerise","year":"2015","unstructured":"Amerise, I.L., Tarsitano, A.: Correction methods for ties in rank correlations. J. Appl. Stat. 42(12), 2584\u20132596 (2015)","journal-title":"J. Appl. Stat."},{"key":"270_CR7","doi-asserted-by":"crossref","unstructured":"Apel, S., Beyer, D., Friedberger, K., Raimondi, F., von Rhein, A.: Domain types: abstract-domain selection based on variable usage. In: HVC, LNCS, vol. 8244, pp. 262\u2013278. Springer (2013)","DOI":"10.1007\/978-3-319-03077-7_18"},{"key":"270_CR8","doi-asserted-by":"crossref","unstructured":"Beyer, D., Dangl, M.: Strategy selection for software verification based on boolean features\u2014a simple but effective approach. In: ISoLA, LNCS, vol. 11245, pp. 144\u2013159. Springer (2018)","DOI":"10.1007\/978-3-030-03421-4_11"},{"key":"270_CR9","doi-asserted-by":"crossref","unstructured":"Beyer, D., Keremoglu, M.E.: CPAchecker: A Tool for Configurable Software Verification. In: CAV, LNCS, vol. 6806, pp. 184\u2013190. Springer (2011)","DOI":"10.1007\/978-3-642-22110-1_16"},{"key":"270_CR10","doi-asserted-by":"crossref","unstructured":"Beyer, D., Lemberger, T.: Software verification: testing versus model checking\u2014a comparative evaluation of the state of the art. In: HVC, LNCS, vol. 10629, pp. 99\u2013114. Springer (2017)","DOI":"10.1007\/978-3-319-70389-3_7"},{"key":"270_CR11","doi-asserted-by":"crossref","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Refinement selection. In: SPIN, LNCS, vol. 9232, pp. 20\u201338. Springer (2015)","DOI":"10.1007\/978-3-319-23404-5_3"},{"key":"270_CR12","doi-asserted-by":"crossref","unstructured":"Beyer, D., L\u00f6we, S., Wendler, P.: Reliable benchmarking: requirements and solutions. Int. J. Softw Tools Technol. Transf. 1\u201329 (2017)","DOI":"10.1007\/s10009-017-0469-y"},{"key":"270_CR13","doi-asserted-by":"crossref","unstructured":"Beyer, D.: Software verification with validation of results\u2014(report on SV-COMP 2017). In: TACAS, LNCS, vol. 10206, pp. 331\u2013349 (2017)","DOI":"10.1007\/978-3-662-54580-5_20"},{"key":"270_CR14","doi-asserted-by":"publisher","first-page":"41","DOI":"10.1016\/j.artint.2016.04.003","volume":"237","author":"B Bischl","year":"2016","unstructured":"Bischl, B., Kerschke, P., Kotthoff, L., Lindauer, M.T., Malitsky, Y., Fr\u00e9chette, A., Hoos, H.H., Hutter, F., Leyton-Brown, K., Tierney, K., Vanschoren, J.: ASlib: a benchmark library for algorithm selection. Artif. Intell. 237, 41\u201358 (2016)","journal-title":"Artif. Intell."},{"key":"270_CR15","unstructured":"Borgwardt, K., Kriegel, H.: Shortest-path kernels on graphs. In: ICDM, pp. 74\u201381. IEEE Computer Society (2005)"},{"key":"270_CR16","doi-asserted-by":"crossref","unstructured":"Boser, B.E., Guyon, I., Vapnik, V.: A training algorithm for optimal margin classifiers. In: COLT, pp. 144\u2013152. ACM (1992)","DOI":"10.1145\/130385.130401"},{"key":"270_CR17","unstructured":"Cadar, C., Dunbar, D., Engler, D.R.: KLEE: unassisted and automatic generation of high-coverage tests for complex systems programs. In: USENIX, pp. 209\u2013224. USENIX Association (2008)"},{"key":"270_CR18","doi-asserted-by":"crossref","unstructured":"Chalupa, M., Vitovsk\u00e1, M., Jon\u00e1s, M., Slaby, J., Strejcek, J.: Symbiotic 4: Beyond reachability\u2014(competition contribution). In: TACAS, LNCS, vol. 10206, pp. 385\u2013389. Springer (2017)","DOI":"10.1007\/978-3-662-54580-5_28"},{"key":"270_CR19","doi-asserted-by":"crossref","unstructured":"Chen, Y., Hsieh, C., Leng\u00e1l, O., Lii, T., Tsai, M., Wang, B., Wang, F.: PAC learning-based verification and model synthesis. In: ICSE, pp. 714\u2013724. ACM (2016)","DOI":"10.1145\/2884781.2884860"},{"key":"270_CR20","doi-asserted-by":"crossref","unstructured":"Czech, M., H\u00fcllermeier, E., Jakobs, M.-C., Wehrheim, H.: Predicting rankings of software verification tools. In: SWAN@ESEC\/SIGSOFT FSE, pp. 23\u201326. ACM (2017)","DOI":"10.1145\/3121257.3121262"},{"key":"270_CR21","unstructured":"de\u00a0Borda, J.C.: M\u00e9moire sur les \u00e9lections au scrutin, M\u00e9moire de l\u2019Acad\u00e9mie Royale. Histoire de l\u00c1cademie Royale des Sciences, Paris, pp. 657\u2013665 (1781)"},{"key":"270_CR22","doi-asserted-by":"crossref","unstructured":"Demyanova, Y., Pani, T., Veith, H., Zuleger, F.: Empirical software metrics for benchmarking of verification tools. In: CAV, LNCS, vol. 9206, pp. 561\u2013579. Springer (2015)","DOI":"10.1007\/978-3-319-21690-4_39"},{"issue":"2\u20133","key":"270_CR23","doi-asserted-by":"publisher","first-page":"289","DOI":"10.1007\/s10703-016-0264-5","volume":"50","author":"Y Demyanova","year":"2017","unstructured":"Demyanova, Y., Pani, T., Veith, H., Zuleger, F.: Empirical software metrics for benchmarking of verification tools. Formal Methods Syst. Des. 50(2\u20133), 289\u2013316 (2017)","journal-title":"Formal Methods Syst. Des."},{"key":"270_CR24","first-page":"721","volume":"2","author":"J F\u00fcrnkranz","year":"2002","unstructured":"F\u00fcrnkranz, J.: Round robin classification. J. Mach. Learn. Res. 2, 721\u2013747 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"270_CR25","doi-asserted-by":"crossref","unstructured":"Gadelha, M.Y.R., Monteiro, F.R., Morse, J., Cordeiro, L.C., Fischer, B., Nicole, D.A.: ESBMC 5.0: an industrial-strength C model checker. In: ASE, pp. 888\u2013891. ACM (2018)","DOI":"10.1145\/3238147.3240481"},{"key":"270_CR26","volume-title":"Design patterns: elements of reusable object-oriented software","author":"E Gamma","year":"1995","unstructured":"Gamma, E., Helm, R., Johnson, R., Vlissides, J.: Design patterns: elements of reusable object-oriented software. Addison-Wesley, Boston (1995)"},{"key":"270_CR27","doi-asserted-by":"crossref","unstructured":"G\u00e4rtner, T., Flach, P.A., Wrobel, S.: On graph kernels: Hardness results and efficient alternatives. In: COLT\/Kernel, LNCS, vol. 2777, pp. 129\u2013143. Springer (2003)","DOI":"10.1007\/978-3-540-45167-9_11"},{"key":"270_CR28","doi-asserted-by":"publisher","DOI":"10.1142\/6855","volume-title":"Kernels for structured data","author":"T G\u00e4rtner","year":"2008","unstructured":"G\u00e4rtner, T.: Kernels for structured data. World Scientific, Singapore (2008)"},{"key":"270_CR29","doi-asserted-by":"crossref","unstructured":"Greitschus, M., Dietsch, D., Heizmann, M., Nutz, A., Sch\u00e4tzle, C., Schilling, C., Sch\u00fcssele, F., Podelski, A.: Ultimate Taipan: trace abstraction and abstract interpretation. In: TACAS, LNCS, vol. 10206, pp. 399\u2013403. Springer (2017)","DOI":"10.1007\/978-3-662-54580-5_31"},{"key":"270_CR30","doi-asserted-by":"crossref","unstructured":"G\u00fcnther, H., Weissenbacher, G.: Incremental bounded software model checking. In: SPIN, pp. 40\u201347. ACM (2014)","DOI":"10.1145\/2632362.2632374"},{"key":"270_CR31","doi-asserted-by":"crossref","unstructured":"Gurfinkel, A., Kahsai, T., Komuravelli, A., Navas, J.A.: The SeaHorn verification framework. In: CAV, LNCS, vol. 9206, pp. 343\u2013361. Springer (2015)","DOI":"10.1007\/978-3-319-21690-4_20"},{"key":"270_CR32","doi-asserted-by":"crossref","unstructured":"Habib, A., Pradel, M.: Is this class thread-safe? Inferring documentation using graph-based learning. In: ASE, pp. 41\u201352. ACM (2018)","DOI":"10.1145\/3238147.3238212"},{"key":"270_CR33","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: NIPS, pp. 1024\u20131034. Curran Associates, Inc. (2017)"},{"key":"270_CR34","doi-asserted-by":"crossref","unstructured":"Heizmann, M., Hoenicke, J., Podelski, A.: Software model checking for people who love automata. In: CAV, LNCS, vol. 8044, pp. 36\u201352. Springer (2013)","DOI":"10.1007\/978-3-642-39799-8_2"},{"key":"270_CR35","unstructured":"Helmert, M., R\u00f6ger, G., Seipp, J., Karpas, E., Hoffmann, J., Keyder, E., Nissim, R., Richter, S., Westphal, M.: Fast downward stone soup. In: PAL, pp. 28\u201335 (2011)"},{"key":"270_CR36","doi-asserted-by":"crossref","unstructured":"Horwitz, S., Reps, T.W.: The use of program dependence graphs in software engineering. In: ICSE, pp. 392\u2013411. ACM Press (1992)","DOI":"10.1109\/ICSE.1992.753516"},{"issue":"1","key":"270_CR37","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1016\/j.jcss.2009.05.005","volume":"76","author":"E H\u00fcllermeier","year":"2010","unstructured":"H\u00fcllermeier, E., F\u00fcrnkranz, J.: On predictive accuracy and risk minimization in pairwise label ranking. J. Comput. Syst. Sci. 76(1), 49\u201362 (2010)","journal-title":"J. Comput. Syst. Sci."},{"key":"270_CR38","doi-asserted-by":"publisher","first-page":"1897","DOI":"10.1016\/j.artint.2008.08.002","volume":"172","author":"E H\u00fcllermeier","year":"2008","unstructured":"H\u00fcllermeier, E., F\u00fcrnkranz, J., Cheng, W., Brinker, K.: Label ranking by learning pairwise preferences. Artif. Intell. 172, 1897\u20131917 (2008)","journal-title":"Artif. Intell."},{"key":"270_CR39","unstructured":"Kashima, H., Tsuda, K., Inokuchi, A.: Marginalized kernels between labeled graphs. In: ICML, pp. 321\u2013328. AAAI Press (2003)"},{"key":"270_CR40","unstructured":"Kondor, R., Lafferty, J.D.: Diffusion kernels on graphs and other discrete structures. In: ICML, pp. 315\u2013322. Morgan Kaufmann Publishers Inc. (2002)"},{"issue":"3","key":"270_CR41","doi-asserted-by":"publisher","first-page":"257","DOI":"10.3233\/AIC-2012-0533","volume":"25","author":"L Kotthoff","year":"2012","unstructured":"Kotthoff, L., Gent, I.P., Miguel, I.: An evaluation of machine learning in algorithm selection for search problems. AI Commun. 25(3), 257\u2013270 (2012)","journal-title":"AI Commun."},{"key":"270_CR42","doi-asserted-by":"crossref","unstructured":"Kroening, D., Tautschnig, M.: CBMC\u2013C bounded model checker. In: TACAS, LNCS, vol. 8413, pp. 389\u2013391. Springer (2014)","DOI":"10.1007\/978-3-642-54862-8_26"},{"key":"270_CR43","unstructured":"Lau, T.: Programming by demonstration: a machine learning approach. Ph.D. thesis, University of Washington (2001)"},{"key":"270_CR44","doi-asserted-by":"crossref","unstructured":"Le, T.B., Lo, D., Le Goues, C., Grunske, L.: A learning-to-rank based fault localization approach using likely invariants. In: ISSTA, pp. 177\u2013188. ACM (2016)","DOI":"10.1145\/2931037.2931049"},{"key":"270_CR45","doi-asserted-by":"crossref","unstructured":"Li, W., Saidi, H., Sanchez, H., Sch\u00e4f, M., Schweitzer, P.: Detecting similar programs via the Weisfeiler-Leman graph kernel. In: ICSR, LNCS, vol. 9679, pp. 315\u2013330. Springer (2016)","DOI":"10.1007\/978-3-319-35122-3_21"},{"key":"270_CR46","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-319-32967-3","volume-title":"The conversational interface","author":"M McTear","year":"2016","unstructured":"McTear, M., Callejas, Z., Griol, D.: The conversational interface, vol. 6(94), p. 102. Springer, Berlin (2016)"},{"key":"270_CR47","doi-asserted-by":"crossref","unstructured":"Nutz, A., Dietsch, D., Mohamed, M.M., Podelski, A.: ULTIMATE KOJAK with memory safety checks. In: TACAS, LNCS, vol. 9035, pp. 458\u2013460. Springer (2015)","DOI":"10.1007\/978-3-662-46681-0_44"},{"key":"270_CR48","volume-title":"The interpretation of ecological data: a primer on classification and ordination","author":"EC Pielou","year":"1984","unstructured":"Pielou, E.C.: The interpretation of ecological data: a primer on classification and ordination. Wiley, New York (1984)"},{"key":"270_CR49","unstructured":"Platt, J.: Probabilistic outputs for support vector machines and comparisons to regularized likelihood methods. In: Advances in Large Margin Classifiers, pp. 6\u201374. MIT Press (1999)"},{"issue":"OOPSLA","key":"270_CR50","doi-asserted-by":"publisher","first-page":"147:1","DOI":"10.1145\/3276517","volume":"2","author":"M Pradel","year":"2018","unstructured":"Pradel, M., Sen, K.: DeepBugs: a learning approach to name-based bug detection. Proc. ACM Program. Lang. 2(OOPSLA), 147:1\u2013147:25 (2018)","journal-title":"Proc. ACM Program. Lang."},{"key":"270_CR51","doi-asserted-by":"crossref","unstructured":"Rakamaric, Z., Emmi, M.: SMACK: Decoupling source language details from verifier implementations. In: CAV, LNCS, vol. 8559, pp. 106\u2013113. Springer (2014)","DOI":"10.1007\/978-3-319-08867-9_7"},{"issue":"8","key":"270_CR52","doi-asserted-by":"publisher","first-page":"1093","DOI":"10.1016\/j.neunet.2005.07.009","volume":"18","author":"L Ralaivola","year":"2005","unstructured":"Ralaivola, L., Swamidass, S.J., Saigo, H., Baldi, P.: Graph kernels for chemical informatics. Neural Netw. 18(8), 1093\u20131110 (2005)","journal-title":"Neural Netw."},{"key":"270_CR53","doi-asserted-by":"crossref","unstructured":"Raychev, V., Bielik, P., Vechev, M.T., Krause, A.: Learning programs from noisy data. In: POPL, pp. 761\u2013774. ACM (2016)","DOI":"10.1145\/2914770.2837671"},{"key":"270_CR54","doi-asserted-by":"crossref","unstructured":"Raychev, V., Vechev, M.T., Krause, A.: Predicting program properties from big code. In: POPL, pp. 111\u2013124. ACM (2015)","DOI":"10.1145\/2775051.2677009"},{"key":"270_CR55","doi-asserted-by":"publisher","first-page":"65","DOI":"10.1016\/S0065-2458(08)60520-3","volume":"15","author":"J Rice","year":"1976","unstructured":"Rice, J.: The algorithm selection problem. Adv. Comput. 15, 65\u2013118 (1976)","journal-title":"Adv. Comput."},{"key":"270_CR56","doi-asserted-by":"crossref","unstructured":"Richter, C., Wehrheim, H.: PeSCo: predicting sequential combinations of verifiers (competition contribution). In: TACAS, LNCS, vol. 11429, pp. 229\u2013233. Springer (2019)","DOI":"10.1007\/978-3-030-17502-3_19"},{"key":"270_CR57","doi-asserted-by":"crossref","unstructured":"Rocha, W., Rocha, H., Ismail, H., Cordeiro, L., Fischer, B.: DepthK: A k-induction verifier based on invariant inference for C programs. In: TACAS, LNCS, vol. 10206, pp. 360\u2013364. Springer (2017)","DOI":"10.1007\/978-3-662-54580-5_23"},{"key":"270_CR58","doi-asserted-by":"crossref","unstructured":"Sahs, J., Khan, L.: A machine learning approach to android malware detection. In: EISIC, pp. 141\u2013147. IEEE Computer Society (2012)","DOI":"10.1109\/EISIC.2012.34"},{"key":"270_CR59","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4175.001.0001","volume-title":"Learning with Kernels: support vector machines, regularization, optimization, and beyond","author":"B Sch\u00f6lkopf","year":"2001","unstructured":"Sch\u00f6lkopf, B., Smola, A.: Learning with Kernels: support vector machines, regularization, optimization, and beyond. MIT Press, Cambridge (2001)"},{"key":"270_CR60","doi-asserted-by":"crossref","unstructured":"Schrammel, P., Kroening, D.: 2LS for program analysis. In: TACAS, LNCS, vol. 9636, pp. 905\u2013907. Springer (2016)","DOI":"10.1007\/978-3-662-49674-9_56"},{"key":"270_CR61","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511809682","volume-title":"Kernel methods for pattern analysis","author":"J Shawe-Taylor","year":"2004","unstructured":"Shawe-Taylor, J., Cristianini, N.: Kernel methods for pattern analysis. Cambridge University Press, Cambridge (2004)"},{"key":"270_CR62","first-page":"2539","volume":"12","author":"N Shervashidze","year":"2011","unstructured":"Shervashidze, N., Schweitzer, P., van Leeuwen, E.J., Mehlhorn, K., Borgwardt, K.M.: Weisfeiler\u2013Lehman graph kernels. J. Mach. Learn. Res. 12, 2539\u20132561 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"270_CR63","doi-asserted-by":"publisher","first-page":"72","DOI":"10.2307\/1412159","volume":"15","author":"C Spearman","year":"1904","unstructured":"Spearman, C.: The proof and measurement of association between two things. Am. J. Psychol. 15, 72\u2013101 (1904)","journal-title":"Am. J. Psychol."},{"key":"270_CR64","doi-asserted-by":"crossref","unstructured":"Tulsian, V., Kanade, A., Kumar, R., Lal, A., Nori, A.V.: MUX: algorithm selection for software model checkers. In: MSR, pp. 132\u2013141. ACM (2014)","DOI":"10.1145\/2597073.2597080"},{"key":"270_CR65","doi-asserted-by":"crossref","unstructured":"Vembu, S., G\u00e4rtner, T.: Label ranking algorithms: A survey. In: Preference Learning., pp. 45\u201364. Springer (2010)","DOI":"10.1007\/978-3-642-14125-6_3"},{"key":"270_CR66","doi-asserted-by":"crossref","unstructured":"Wagner, C., Wagener, G., State, R., Engel, T.: Malware analysis with graph kernels and support vector machines. In: MALWARE, pp. 63\u201368. IEEE Computer Society (2009)","DOI":"10.1109\/MALWARE.2009.5403018"},{"issue":"9","key":"270_CR67","first-page":"12","volume":"2","author":"B Weisfeiler","year":"1968","unstructured":"Weisfeiler, B., Lehman, A.: A reduction of a graph to a canonical form and an algebra arising during this reduction. Nauchno Technicheskaya Informatsia 2(9), 12\u201319 (1968)","journal-title":"Nauchno Technicheskaya Informatsia"},{"key":"270_CR68","doi-asserted-by":"crossref","unstructured":"Wendler, P.: CPAchecker with sequential combination of explicit-state analysis and predicate analysis\u2014(Competition Contribution). In: TACAS, LNCS, vol. 7795, pp. 613\u2013615. Springer (2013)","DOI":"10.1007\/978-3-642-36742-7_45"},{"key":"270_CR69","unstructured":"Wu, Z., Pan, S., Chen, F., Long, G., Zhang, C., Yu, P.S.: A comprehensive survey on graph neural networks. CoRR arXiv:1901.00596 (2019)"},{"key":"270_CR70","unstructured":"Xu, K., Hu, W., Leskovec, J., Jegelka, S.: How powerful are graph neural networks? In: ICLR 2019. OpenReview.net. (2019)"},{"key":"270_CR71","doi-asserted-by":"publisher","first-page":"565","DOI":"10.1613\/jair.2490","volume":"32","author":"L Xu","year":"2008","unstructured":"Xu, L., Hutter, F., Hoos, H.H., Leyton-Brown, K.: Satzilla: Portfolio-based algorithm selection for SAT. J. Artif. Intell. Res. 32, 565\u2013606 (2008)","journal-title":"J. Artif. Intell. Res."},{"key":"270_CR72","doi-asserted-by":"crossref","unstructured":"Yefet, N., Alon, U., Yahav, E.: Adversarial examples for models of code. CoRR arXiv:1910.07517 (2019)","DOI":"10.1145\/3428230"}],"container-title":["Automated Software Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10515-020-00270-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s10515-020-00270-x\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s10515-020-00270-x.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,4]],"date-time":"2024-08-04T07:18:58Z","timestamp":1722755938000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s10515-020-00270-x"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,4,18]]},"references-count":72,"journal-issue":{"issue":"1-2","published-print":{"date-parts":[[2020,6]]}},"alternative-id":["270"],"URL":"https:\/\/doi.org\/10.1007\/s10515-020-00270-x","relation":{},"ISSN":["0928-8910","1573-7535"],"issn-type":[{"value":"0928-8910","type":"print"},{"value":"1573-7535","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,4,18]]},"assertion":[{"value":"19 March 2019","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 March 2020","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 April 2020","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}