{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,3]],"date-time":"2025-12-03T17:50:43Z","timestamp":1764784243858},"publisher-location":"Cham","reference-count":64,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030284220"},{"type":"electronic","value":"9783030284237"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-28423-7_1","type":"book-chapter","created":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T07:22:46Z","timestamp":1564730566000},"page":"3-25","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["Trust, Resilience and Interpretability of AI Models"],"prefix":"10.1007","author":[{"given":"Susmit","family":"Jha","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,8,3]]},"reference":[{"key":"1_CR1","doi-asserted-by":"crossref","unstructured":"Abouzied, A., Angluin, D., Papadimitriou, C., Hellerstein, J.M., Silberschatz, A.: Learning and verifying quantified boolean queries by example. In: ACM Symposium on Principles of Database Systems, pp. 49\u201360. ACM (2013)","DOI":"10.1145\/2463664.2465220"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Angluin, D.: Computational learning theory: survey and selected bibliography. In: ACM Symposium on Theory of Computing, pp. 351\u2013369. ACM (1992)","DOI":"10.1145\/129712.129746"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Angluin, D., Kharitonov, M.: When won\u2019t membership queries help? In: ACM Symposium on Theory of Computing, pp. 444\u2013454. ACM (1991)","DOI":"10.1145\/103418.103420"},{"key":"1_CR4","unstructured":"Athalye, A., Carlini, N., Wagner, D.: Obfuscated gradients give a false sense of security: circumventing defenses to adversarial examples. arXiv preprint \n                      arXiv:1802.00420\n                      \n                     (2018)"},{"key":"1_CR5","unstructured":"Bengio, Y., Mesnil, G., Dauphin, Y., Rifai, S.: Better mixing via deep representations. In: International Conference on Machine Learning, pp. 552\u2013560 (2013)"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Bittner, B., Bozzano, M., Cimatti, A., Gario, M., Griggio, A.: Towards pareto-optimal parameter synthesis for monotonie cost functions. In: FMCAD, pp. 23\u201330, October 2014","DOI":"10.1109\/FMCAD.2014.6987591"},{"key":"1_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"321","DOI":"10.1007\/BFb0035397","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"B Boigelot","year":"1997","unstructured":"Boigelot, B., Godefroid, P.: Automatic synthesis of specifications from the dynamic observation of reactive programs. In: Brinksma, E. (ed.) TACAS 1997. LNCS, vol. 1217, pp. 321\u2013333. Springer, Heidelberg (1997). \n                      https:\/\/doi.org\/10.1007\/BFb0035397"},{"key":"1_CR8","doi-asserted-by":"publisher","unstructured":"Botin\u010dan, M., Babi\u0107, D.: Sigma*: symbolic learning of input-output specifications. In: POPL, pp. 443\u2013456 (2013). \n                      https:\/\/doi.org\/10.1145\/2429069.2429123","DOI":"10.1145\/2429069.2429123"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Carlini, N., Wagner, D.: Towards evaluating the robustness of neural networks. arXiv preprint \n                      arXiv:1608.04644\n                      \n                     (2016)","DOI":"10.1109\/SP.2017.49"},{"issue":"1","key":"1_CR10","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/s10703-013-0186-4","volume":"43","author":"B Cook","year":"2013","unstructured":"Cook, B., Kroening, D., R\u00fcmmer, P., Wintersteiger, C.M.: Ranking function synthesis for bit-vector relations. FMSD 43(1), 93\u2013120 (2013). \n                      https:\/\/doi.org\/10.1007\/s10703-013-0186-4","journal-title":"FMSD"},{"issue":"16","key":"1_CR11","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1016\/j.ifacol.2018.08.026","volume":"51","author":"S Dutta","year":"2018","unstructured":"Dutta, S., Jha, S., Sankaranarayanan, S., Tiwari, A.: Learning and verification of feedback control systems using feedforward neural networks. IFAC-PapersOnLine 51(16), 151\u2013156 (2018)","journal-title":"IFAC-PapersOnLine"},{"key":"1_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"121","DOI":"10.1007\/978-3-319-77935-5_9","volume-title":"NASA Formal Methods","author":"S Dutta","year":"2018","unstructured":"Dutta, S., Jha, S., Sankaranarayanan, S., Tiwari, A.: Output range analysis for deep feedforward neural networks. In: Dutle, A., Mu\u00f1oz, C., Narkawicz, A. (eds.) NFM 2018. LNCS, vol. 10811, pp. 121\u2013138. Springer, Cham (2018). \n                      https:\/\/doi.org\/10.1007\/978-3-319-77935-5_9"},{"issue":"3","key":"1_CR13","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1016\/0890-5401(89)90002-3","volume":"82","author":"A Ehrenfeucht","year":"1989","unstructured":"Ehrenfeucht, A., Haussler, D., Kearns, M., Valiant, L.: A general lower bound on the number of examples needed for learning. Inf. Comput. 82(3), 247\u2013261 (1989). \n                      https:\/\/doi.org\/10.1016\/0890-5401(89)90002-3","journal-title":"Inf. Comput."},{"key":"1_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1007\/978-3-642-05258-3_5","volume-title":"MICAI 2009: Advances in Artificial Intelligence","author":"F Elizalde","year":"2009","unstructured":"Elizalde, F., Sucar, E., Noguez, J., Reyes, A.: Generating explanations based on Markov decision processes. In: Aguirre, A.H., Borja, R.M., Garci\u00e1, C.A.R. (eds.) MICAI 2009. LNCS, vol. 5845, pp. 51\u201362. Springer, Heidelberg (2009). \n                      https:\/\/doi.org\/10.1007\/978-3-642-05258-3_5"},{"key":"1_CR15","doi-asserted-by":"publisher","first-page":"154","DOI":"10.1016\/B978-1-55860-247-2.50025-5","volume-title":"Machine Learning Proceedings 1992","author":"Cao Feng","year":"1992","unstructured":"Feng, C., Muggleton, S.: Towards inductive generalisation in higher order logic. In: 9th International Workshop on Machine Learning, pp. 154\u2013162 (2014)"},{"key":"1_CR16","unstructured":"Gardner, J.R., et al.: Deep manifold traversal: changing labels with convolutional features. arXiv preprint \n                      arXiv:1511.06421\n                      \n                     (2015)"},{"issue":"6","key":"1_CR17","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1145\/2345156.2254116","volume":"47","author":"P Godefroid","year":"2012","unstructured":"Godefroid, P., Taly, A.: Automated synthesis of symbolic instruction encodings from I\/O samples. SIGPLAN Not. 47(6), 441\u2013452 (2012). \n                      https:\/\/doi.org\/10.1145\/2345156.2254116","journal-title":"SIGPLAN Not."},{"issue":"2","key":"1_CR18","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1016\/j.artint.2004.01.002","volume":"156","author":"J Goldsmith","year":"2004","unstructured":"Goldsmith, J., Sloan, R.H., Sz\u00f6r\u00e9nyi, B., Tur\u00e1n, G.: Theory revision with queries: horn, read-once, and parity formulas. Artif. Intell. 156(2), 139\u2013176 (2004)","journal-title":"Artif. Intell."},{"key":"1_CR19","unstructured":"Goodfellow, I.J., Shlens, J., Szegedy, C.: Explaining and harnessing adversarial examples. arXiv preprint \n                      arXiv:1412.6572\n                      \n                     (2014)"},{"key":"1_CR20","unstructured":"Grosse, K., Manoharan, P., Papernot, N., Backes, M., McDaniel, P.: On the (statistical) detection of adversarial examples. arXiv preprint \n                      arXiv:1702.06280\n                      \n                     (2017)"},{"key":"1_CR21","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"93","DOI":"10.1007\/978-3-642-54862-8_7","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"A Gurfinkel","year":"2014","unstructured":"Gurfinkel, A., Belov, A., Marques-Silva, J.: Synthesizing safe bit-precise invariants. In: \u00c1brah\u00e1m, E., Havelund, K. (eds.) TACAS 2014. LNCS, vol. 8413, pp. 93\u2013108. Springer, Heidelberg (2014). \n                      https:\/\/doi.org\/10.1007\/978-3-642-54862-8_7"},{"key":"1_CR22","unstructured":"Harbers, M., Meyer, J.J., van den Bosch, K.: Explaining simulations through self explaining agents. J. Artif. Soc. Soc. Simul. (2010). \n                      http:\/\/EconPapers.repec.org\/RePEc:jas:jasssj:2009-25-1"},{"issue":"1","key":"1_CR23","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1016\/j.tcs.2007.05.018","volume":"384","author":"L Hellerstein","year":"2007","unstructured":"Hellerstein, L., Servedio, R.A.: On PAC learning algorithms for rich boolean function classes. Theoret. Comput. Sci. 384(1), 66\u201376 (2007)","journal-title":"Theoret. Comput. Sci."},{"key":"1_CR24","unstructured":"Hinton, G., Vinyals, O., Dean, J.: Distilling the knowledge in a neural network. arXiv preprint \n                      arXiv:1503.02531\n                      \n                     (2015)"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Jha, S., Gulwani, S., Seshia, S.A., Tiwari, A.: Oracle-guided component-based program synthesis. In: ICSE, pp. 215\u2013224. IEEE (2010)","DOI":"10.1145\/1806799.1806833"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Jha, S., Jang, U., Jha, S., Jalaian, B.: Detecting adversarial examples using data manifolds. In: 2018 IEEE Military Communications Conference (MILCOM), MILCOM 2018, pp. 547\u2013552. IEEE (2018)","DOI":"10.1109\/MILCOM.2018.8599691"},{"key":"1_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"99","DOI":"10.1007\/978-3-319-57288-8_7","volume-title":"NASA Formal Methods","author":"S Jha","year":"2017","unstructured":"Jha, S., Raman, V., Pinto, A., Sahai, T., Francis, M.: On learning sparse boolean formulae for explaining AI decisions. In: Barrett, C., Davies, M., Kahsai, T. (eds.) NFM 2017. LNCS, vol. 10227, pp. 99\u2013114. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-57288-8_7"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Jha, S., Sahai, T., Raman, V., Pinto, A., Francis, M.: Explaining AI decisions using efficient methods for learning sparse boolean formulae. J. Autom. Reason. 1\u201321 (2018)","DOI":"10.1007\/s10817-018-9499-8"},{"key":"1_CR29","doi-asserted-by":"publisher","first-page":"693","DOI":"10.1007\/s00236-017-0294-5","volume":"54","author":"S Jha","year":"2016","unstructured":"Jha, S., Seshia, S.A.: A theory of formal synthesis via inductive learning. Acta Informatica 54, 693\u2013726 (2016). Special Issue on Synthesis","journal-title":"Acta Informatica"},{"issue":"433","key":"1_CR30","doi-asserted-by":"publisher","first-page":"401","DOI":"10.1080\/01621459.1996.10476701","volume":"91","author":"MC Jones","year":"1996","unstructured":"Jones, M.C., Marron, J.S., Sheather, S.J.: A brief survey of bandwidth selection for density estimation. J. Am. Stat. Assoc. 91(433), 401\u2013407 (1996)","journal-title":"J. Am. Stat. Assoc."},{"key":"1_CR31","unstructured":"Kannan, H., Kurakin, A., Goodfellow, I.: Adversarial logit pairing. arXiv preprint \n                      arXiv:1803.06373\n                      \n                     (2018)"},{"key":"1_CR32","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/978-3-319-63387-9_5","volume-title":"Computer Aided Verification","author":"G Katz","year":"2017","unstructured":"Katz, G., Barrett, C., Dill, D.L., Julian, K., Kochenderfer, M.J.: Reluplex: an efficient SMT solver for verifying deep neural networks. In: Majumdar, R., Kun\u010dak, V. (eds.) CAV 2017. LNCS, vol. 10426, pp. 97\u2013117. Springer, Cham (2017). \n                      https:\/\/doi.org\/10.1007\/978-3-319-63387-9_5"},{"issue":"6","key":"1_CR33","doi-asserted-by":"publisher","first-page":"1298","DOI":"10.1145\/195613.195656","volume":"41","author":"M Kearns","year":"1994","unstructured":"Kearns, M., Li, M., Valiant, L.: Learning boolean formulas. J. ACM 41(6), 1298\u20131328 (1994)","journal-title":"J. ACM"},{"issue":"1","key":"1_CR34","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/174644.174647","volume":"41","author":"M Kearns","year":"1994","unstructured":"Kearns, M., Valiant, L.: Cryptographic limitations on learning boolean formulae and finite automata. J. ACM (JACM) 41(1), 67\u201395 (1994)","journal-title":"J. ACM (JACM)"},{"key":"1_CR35","doi-asserted-by":"crossref","unstructured":"Kos, J., Fischer, I., Song, D.: Adversarial examples for generative models. arXiv preprint \n                      arXiv:1702.06832\n                      \n                     (2017)","DOI":"10.1109\/SPW.2018.00014"},{"key":"1_CR36","unstructured":"Krizhevsky, A., Nair, V., Hinton, G.: The CIFAR-10 dataset (2014). \n                      http:\/\/www.cs.toronto.edu\/kriz\/cifar.html"},{"key":"1_CR37","unstructured":"Kurakin, A., Goodfellow, I., Bengio, S.: Adversarial examples in the physical world. arXiv preprint \n                      arXiv:1607.02533\n                      \n                     (2016)"},{"key":"1_CR38","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546877","volume-title":"Planning Algorithms","author":"SM LaValle","year":"2006","unstructured":"LaValle, S.M.: Planning Algorithms. Cambridge University Press, Cambridge (2006)"},{"key":"1_CR39","unstructured":"LeCun, Y.: The MNIST database of handwritten digits (1998). \n                      http:\/\/yann.lecun.com\/exdb\/mnist\/"},{"issue":"10","key":"1_CR40","doi-asserted-by":"publisher","first-page":"1243","DOI":"10.1080\/00140139208967392","volume":"35","author":"J Lee","year":"1992","unstructured":"Lee, J., Moray, N.: Trust, control strategies and allocation of function in human-machine systems. Ergonomics 35(10), 1243\u20131270 (1992)","journal-title":"Ergonomics"},{"issue":"Nov","key":"1_CR41","first-page":"2579","volume":"9","author":"L Maaten van der","year":"2008","unstructured":"van der Maaten, L., Hinton, G.: Visualizing data using t-SNE. J. Mach. Learn. Res. 9(Nov), 2579\u20132605 (2008)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR42","unstructured":"Madry, A., Makelov, A., Schmidt, L., Tsipras, D., Vladu, A.: Towards deep learning models resistant to adversarial attacks. arXiv preprint \n                      arXiv:1706.06083\n                      \n                     (2017)"},{"key":"1_CR43","doi-asserted-by":"publisher","first-page":"391","DOI":"10.1007\/978-1-4615-2696-4_11","volume-title":"Theoretical Advances in Neural Computation and Learning","author":"Y Mansour","year":"1994","unstructured":"Mansour, Y.: Learning boolean functions via the Fourier transform. In: Roychowdhury, V., Siu, K.Y., Orlitsky, A. (eds.) Theoretical Advances in Neural Computation and Learning, pp. 391\u2013424. Springer, Boston (1994). \n                      https:\/\/doi.org\/10.1007\/978-1-4615-2696-4_11"},{"key":"1_CR44","unstructured":"Metzen, J.H., Genewein, T., Fischer, V., Bischoff, B.: On detecting adversarial perturbations. arXiv preprint \n                      arXiv:1702.04267\n                      \n                     (2017)"},{"key":"1_CR45","doi-asserted-by":"crossref","unstructured":"Moosavi-Dezfooli, S.M., Fawzi, A., Frossard, P.: DeepFool: a simple and accurate method to fool deep neural networks. In: Proceedings of the IEEE Conference on Computer Vision and Pattern Recognition, pp. 2574\u20132582 (2016)","DOI":"10.1109\/CVPR.2016.282"},{"key":"1_CR46","unstructured":"Papernot, N., et al.: CleverHans v2.0.0: an adversarial machine learning library. arXiv preprint \n                      arXiv:1610.00768\n                      \n                     (2016)"},{"key":"1_CR47","doi-asserted-by":"crossref","unstructured":"Papernot, N., McDaniel, P., Goodfellow, I., Jha, S., Celik, Z.B., Swami, A.: Practical black-box attacks against machine learning. In: Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security, pp. 506\u2013519. ACM (2017)","DOI":"10.1145\/3052973.3053009"},{"key":"1_CR48","doi-asserted-by":"crossref","unstructured":"Papernot, N., McDaniel, P., Jha, S., Fredrikson, M., Celik, Z.B., Swami, A.: The limitations of deep learning in adversarial settings. In: 2016 IEEE European Symposium on Security and Privacy (EuroS&P), pp. 372\u2013387. IEEE (2016)","DOI":"10.1109\/EuroSP.2016.36"},{"key":"1_CR49","doi-asserted-by":"crossref","unstructured":"Papernot, N., McDaniel, P., Swami, A., Harang, R.: Crafting adversarial input sequences for recurrent neural networks. In: 2016 IEEE Military Communications Conference, MILCOM 2016, pp. 49\u201354. IEEE (2016)","DOI":"10.1109\/MILCOM.2016.7795300"},{"issue":"4","key":"1_CR50","doi-asserted-by":"publisher","first-page":"965","DOI":"10.1145\/48014.63140","volume":"35","author":"L Pitt","year":"1988","unstructured":"Pitt, L., Valiant, L.G.: Computational limitations on learning from examples. J. ACM (JACM) 35(4), 965\u2013984 (1988)","journal-title":"J. ACM (JACM)"},{"key":"1_CR51","doi-asserted-by":"crossref","unstructured":"Raman, V., Lignos, C., Finucane, C., Lee, K.C.T., Marcus, M.P., Kress-Gazit, H.: Sorry Dave, I\u2019m afraid I can\u2019t do that: explaining unachievable robot tasks using natural language. In: Robotics: Science and Systems (2013)","DOI":"10.15607\/RSS.2013.IX.023"},{"key":"1_CR52","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"198","DOI":"10.1007\/978-3-319-21668-3_12","volume-title":"Computer Aided Verification","author":"A Reynolds","year":"2015","unstructured":"Reynolds, A., Deters, M., Kuncak, V., Tinelli, C., Barrett, C.: Counterexample-guided quantifier instantiation for synthesis in SMT. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9207, pp. 198\u2013216. Springer, Cham (2015). \n                      https:\/\/doi.org\/10.1007\/978-3-319-21668-3_12"},{"key":"1_CR53","doi-asserted-by":"publisher","unstructured":"Ribeiro, M.T., Singh, S., Guestrin, C.: \u201cWhy Should I Trust You?\u201d: explaining the predictions of any classifier. In: KDD, pp. 1135\u20131144 (2016). \n                      https:\/\/doi.org\/10.1145\/2939672.2939778","DOI":"10.1145\/2939672.2939778"},{"issue":"5500","key":"1_CR54","doi-asserted-by":"publisher","first-page":"2323","DOI":"10.1126\/science.290.5500.2323","volume":"290","author":"ST Roweis","year":"2000","unstructured":"Roweis, S.T., Saul, L.K.: Nonlinear dimensionality reduction by locally linear embedding. Science 290(5500), 2323\u20132326 (2000)","journal-title":"Science"},{"key":"1_CR55","doi-asserted-by":"publisher","unstructured":"Sankaranarayanan, S., Miller, C., Raghunathan, R., Ravanbakhsh, H., Fainekos, G.: A model-based approach to synthesizing insulin infusion pump usage parameters for diabetic patients. In: Annual Allerton Conference on Communication, Control, and Computing, pp. 1610\u20131617, October 2012. \n                      https:\/\/doi.org\/10.1109\/Allerton.2012.6483413","DOI":"10.1109\/Allerton.2012.6483413"},{"key":"1_CR56","doi-asserted-by":"publisher","unstructured":"Sankaranarayanan, S.: Automatic invariant generation for hybrid systems using ideal fixed points. In: HSCC, pp. 221\u2013230 (2010). \n                      https:\/\/doi.org\/10.1145\/1755952.1755984","DOI":"10.1145\/1755952.1755984"},{"issue":"1","key":"1_CR57","doi-asserted-by":"publisher","first-page":"25","DOI":"10.1007\/s10703-007-0046-1","volume":"32","author":"S Sankaranarayanan","year":"2008","unstructured":"Sankaranarayanan, S., Sipma, H.B., Manna, Z.: Constructing invariants for hybrid systems. FMSD 32(1), 25\u201355 (2008). \n                      https:\/\/doi.org\/10.1007\/s10703-007-0046-1","journal-title":"FMSD"},{"issue":"Jun","key":"1_CR58","first-page":"119","volume":"4","author":"LK Saul","year":"2003","unstructured":"Saul, L.K., Roweis, S.T.: Think globally, fit locally: unsupervised learning of low dimensional manifolds. J. Mach. Learn. Res. 4(Jun), 119\u2013155 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR59","unstructured":"Shaham, U., Yamada, Y., Negahban, S.: Understanding adversarial training: increasing local stability of neural nets through robust optimization. arXiv preprint \n                      arXiv:1511.05432\n                      \n                     (2015)"},{"issue":"3","key":"1_CR60","doi-asserted-by":"publisher","first-page":"647","DOI":"10.1007\/s10115-013-0679-x","volume":"41","author":"E \u0160trumbelj","year":"2014","unstructured":"\u0160trumbelj, E., Kononenko, I.: Explaining prediction models and individual predictions with feature contributions. KIS 41(3), 647\u2013665 (2014). \n                      https:\/\/doi.org\/10.1007\/s10115-013-0679-x","journal-title":"KIS"},{"key":"1_CR61","unstructured":"Szegedy, C., et al.: Intriguing properties of neural networks. arXiv preprint \n                      arXiv:1312.6199\n                      \n                     (2013)"},{"issue":"5500","key":"1_CR62","doi-asserted-by":"publisher","first-page":"2319","DOI":"10.1126\/science.290.5500.2319","volume":"290","author":"JB Tenenbaum","year":"2000","unstructured":"Tenenbaum, J.B., De Silva, V., Langford, J.C.: A global geometric framework for nonlinear dimensionality reduction. Science 290(5500), 2319\u20132323 (2000)","journal-title":"Science"},{"key":"1_CR63","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/978-3-662-49674-9_4","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"C Urban","year":"2016","unstructured":"Urban, C., Gurfinkel, A., Kahsai, T.: Synthesizing ranking functions from bits and pieces. In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 54\u201370. Springer, Heidelberg (2016). \n                      https:\/\/doi.org\/10.1007\/978-3-662-49674-9_4"},{"key":"1_CR64","first-page":"309","volume":"42","author":"C Yuan","year":"2011","unstructured":"Yuan, C., Lim, H., Lu, T.C.: Most relevant explanation in Bayesian networks. J. Artif. Intell. Res. (JAIR) 42, 309\u2013352 (2011)","journal-title":"J. Artif. Intell. Res. (JAIR)"}],"container-title":["Lecture Notes in Computer Science","Numerical Software Verification"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-28423-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,8,2]],"date-time":"2019-08-02T07:29:37Z","timestamp":1564730977000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-28423-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030284220","9783030284237"],"references-count":64,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-28423-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"3 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"NSV","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Numerical Software Verification","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"New York City, NY","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","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":"13 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"nsv2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/nsv19.mpi-sws.org\/","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":"10","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":"5","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":"2","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":"50% - 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":"1.1","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2 invited papers related to tutorials presented at the workshop.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}