{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,20]],"date-time":"2025-12-20T02:18:31Z","timestamp":1766197111371,"version":"3.37.3"},"reference-count":69,"publisher":"Springer Science and Business Media LLC","issue":"7","license":[{"start":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T00:00:00Z","timestamp":1487116800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T00:00:00Z","timestamp":1487116800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["1545126"],"award-info":[{"award-number":["1545126"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000028","name":"Semiconductor Research Corporation","doi-asserted-by":"publisher","award":["TerraSwarm, one of six centers of STARnet"],"award-info":[{"award-number":["TerraSwarm, one of six centers of STARnet"]}],"id":[{"id":"10.13039\/100000028","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Acta Informatica"],"published-print":{"date-parts":[[2017,11]]},"DOI":"10.1007\/s00236-017-0294-5","type":"journal-article","created":{"date-parts":[[2017,2,15]],"date-time":"2017-02-15T09:55:13Z","timestamp":1487152513000},"page":"693-726","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":75,"title":["A theory of formal synthesis via inductive learning"],"prefix":"10.1007","volume":"54","author":[{"given":"Susmit","family":"Jha","sequence":"first","affiliation":[]},{"given":"Sanjit A.","family":"Seshia","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,2,15]]},"reference":[{"key":"294_CR1","doi-asserted-by":"crossref","unstructured":"Alur, R., Bodik, R., Juniwal, G., Martin, M.M.K., Raghothaman, M., Seshia, S.A., Singh, R., Solar-Lezama, A., Torlak, E., Udupa, A.: Syntax-Guided Synthesis. In: Proceedings of the IEEE International Conference on Formal Methods in Computer-Aided Design (FMCAD) (2013)","DOI":"10.1109\/FMCAD.2013.6679385"},{"key":"294_CR2","doi-asserted-by":"publisher","first-page":"117","DOI":"10.1016\/S0019-9958(80)90285-5","volume":"45","author":"D Angluin","year":"1980","unstructured":"Angluin, D.: Inductive inference of formal languages from positive data. Inf. Control 45, 117\u2013135 (1980). doi:\n                    10.1016\/S0019-9958(80)90285-5","journal-title":"Inf. Control"},{"issue":"2","key":"294_CR3","doi-asserted-by":"publisher","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."},{"issue":"4","key":"294_CR4","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1023\/A:1022821128753","volume":"2","author":"D Angluin","year":"1988","unstructured":"Angluin, D.: Queries and concept learning. Mach. Learn. 2(4), 319\u2013342 (1988). doi:\n                    10.1023\/A:1022821128753","journal-title":"Mach. Learn."},{"key":"294_CR5","doi-asserted-by":"publisher","unstructured":"Angluin, D.: Queries revisited. Theoretical computer science. Algorithmic learning theory 313(2), 175\u2013194 (2004). doi:\n                    10.1016\/j.tcs.2003.11.004\n                    \n                  . \n                    http:\/\/www.sciencedirect.com\/science\/article\/pii\/S030439750300608X","DOI":"10.1016\/j.tcs.2003.11.004"},{"key":"294_CR6","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1145\/356914.356918","volume":"15","author":"D Angluin","year":"1983","unstructured":"Angluin, D., Smith, C.H.: Inductive inference: theory and methods. ACM Comput. Surv. 15, 237\u2013269 (1983)","journal-title":"ACM Comput. Surv."},{"key":"294_CR7","doi-asserted-by":"publisher","DOI":"10.2168\/LMCS-7(4:4)2011","author":"MF Atig","year":"2011","unstructured":"Atig, M.F., Bouajjani, A., Qadeer, S.: Context-bounded analysis for concurrent programs with dynamic creation of threads. Log. Methods Comput. Sci. (2011). doi:\n                    10.2168\/LMCS-7(4:4)2011","journal-title":"Log. Methods Comput. Sci."},{"key":"294_CR8","volume-title":"Handbook of Satisfiability, Chapter 8","author":"C Barrett","year":"2009","unstructured":"Barrett, C., Sebastiani, R., Seshia, S.A., Tinelli, C.: Satisfiability modulo theories. In: Biere, A., van Maaren, H., Walsh, T. (eds.) Handbook of Satisfiability, Chapter 8, vol. 4. IOS Press, Amsterdam (2009)"},{"key":"294_CR9","unstructured":"Bengio, Y., Goodfellow, I.J., Courville, A.: Deep Learning. Book in preparation for MIT Press (2015). \n                    http:\/\/www.iro.umontreal.ca\/~bengioy\/dlbook"},{"key":"294_CR10","doi-asserted-by":"publisher","unstructured":"Biere, A.: Bounded model checking. In: Handbook of Satisfiability, pp. 457\u2013481 (2009). doi:\n                    10.3233\/978-1-58603-929-5-457","DOI":"10.3233\/978-1-58603-929-5-457"},{"issue":"2","key":"294_CR11","doi-asserted-by":"publisher","first-page":"125","DOI":"10.1016\/S0019-9958(75)90261-2","volume":"28","author":"L Blum","year":"1975","unstructured":"Blum, L., Blum, M.: Toward a mathematical theory of inductive inference. Inf. Control 28(2), 125\u2013155 (1975). doi:\n                    10.1016\/s0019-9958(75)90261-2","journal-title":"Inf. Control"},{"issue":"4","key":"294_CR12","doi-asserted-by":"publisher","first-page":"929","DOI":"10.1145\/76359.76371","volume":"36","author":"A Blumer","year":"1989","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.K.: Learnability and the Vapnik\u2013Chervonenkis dimension. J. ACM 36(4), 929\u2013965 (1989). doi:\n                    10.1145\/76359.76371","journal-title":"J. ACM"},{"issue":"8","key":"294_CR13","doi-asserted-by":"publisher","first-page":"677","DOI":"10.1109\/TC.1986.1676819","volume":"C\u201335","author":"RE Bryant","year":"1986","unstructured":"Bryant, R.E.: Graph-based algorithms for Boolean function manipulation. IEEE Trans. Comput. C\u201335(8), 677\u2013691 (1986)","journal-title":"IEEE Trans. Comput."},{"issue":"11","key":"294_CR14","doi-asserted-by":"publisher","first-page":"1804","DOI":"10.1109\/TCAD.2010.2061270","volume":"29","author":"Y Chen","year":"2010","unstructured":"Chen, Y., Safarpour, S., Marques-Silva, J.: Automated design debugging with maximum satisfiability. IEEE Trans. CAD Integr. Circuits Syst. 29(11), 1804\u20131817 (2010). doi:\n                    10.1109\/TCAD.2010.2061270","journal-title":"IEEE Trans. CAD Integr. Circuits Syst."},{"key":"294_CR15","unstructured":"Clarke, E.M., Emerson, E.A.: Design and synthesis of synchronization skeletons using branching-time temporal logic. In: Kozen, D. (ed.) Logic of Programs, Workshop. Springer, London (1981)"},{"key":"294_CR16","volume-title":"Model Checking","author":"EM Clarke","year":"2000","unstructured":"Clarke, E.M., Grumberg, O., Peled, D.A.: Model Checking. MIT Press, Cambridge (2000)"},{"issue":"6","key":"294_CR17","doi-asserted-by":"publisher","first-page":"1157","DOI":"10.3233\/JCS-2009-0393","volume":"18","author":"MR Clarkson","year":"2010","unstructured":"Clarkson, M.R., Schneider, F.B.: Hyperproperties. J. Comput. Secur. 18(6), 1157\u20131210 (2010)","journal-title":"J. Comput. Secur."},{"key":"294_CR18","doi-asserted-by":"crossref","unstructured":"Giannakopoulou, D., Pasareanu, C.S. (eds.): Special issue on learning techniques for compositional reasoning. Formal Methods in System Design 32(3), pp. 173\u2013174 (2008)","DOI":"10.1007\/s10703-008-0054-9"},{"issue":"5","key":"294_CR19","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1016\/S0019-9958(67)91165-5","volume":"10","author":"EM Gold","year":"1967","unstructured":"Gold, E.M.: Language identification in the limit. Inf. Control 10(5), 447\u2013474 (1967). doi:\n                    10.1016\/S0019-9958(67)91165-5","journal-title":"Inf. Control"},{"key":"294_CR20","first-page":"303","volume":"50","author":"SA Goldman","year":"1992","unstructured":"Goldman, S.A., Kearns, M.J.: On the complexity of teaching. J. Comput. Syst. Sci. 50, 303\u2013314 (1992)","journal-title":"J. Comput. Syst. Sci."},{"issue":"5","key":"294_CR21","doi-asserted-by":"publisher","first-page":"1006","DOI":"10.1137\/0222062","volume":"22","author":"SA Goldman","year":"1993","unstructured":"Goldman, S.A., Rivest, R.L., Schapire, R.E.: Learning binary relations and total orders. SIAM J. Comput. 22(5), 1006\u20131034 (1993). doi:\n                    10.1137\/0222062","journal-title":"SIAM J. Comput."},{"key":"294_CR22","volume-title":"Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic","author":"MJC Gordon","year":"1993","unstructured":"Gordon, M.J.C., Melham, T.F.: Introduction to HOL: A Theorem Proving Environment for Higher-Order Logic. Cambridge University Press, Cambridge (1993)"},{"key":"294_CR23","doi-asserted-by":"crossref","unstructured":"Grebenshchikov, S., Lopes, N.P., Popeea, C., Rybalchenko, A.: Synthesizing software verifiers from proof rules. In: ACM SIGPLAN Notices, 47, ACM, pp. 405\u2013416 (2012)","DOI":"10.1145\/2345156.2254112"},{"key":"294_CR24","doi-asserted-by":"publisher","unstructured":"Gulwani, S., Jha, S., Tiwari, A., Venkatesan, R.: Synthesis of loop-free programs. In: PLDI, pp. 62\u201373 (2011). doi:\n                    10.1145\/1993498.1993506","DOI":"10.1145\/1993498.1993506"},{"key":"294_CR25","doi-asserted-by":"publisher","unstructured":"Heged\u0171s, T.: Geometrical concept learning and convex polytopes. In: Proceedings of the Seventh Annual Conference on Computational Learning Theory, COLT \u201994, ACM, New York, NY, USA, pp. 228\u2013236 (1994). doi:\n                    10.1145\/180139.181124","DOI":"10.1145\/180139.181124"},{"issue":"3","key":"294_CR26","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1006\/jcss.1997.1533","volume":"55","author":"JC Jackson","year":"1997","unstructured":"Jackson, J.C.: An efficient membership-query algorithm for learning DNF with respect to the uniform distribution. J. Comput. Syst. Sci. 55(3), 414\u2013440 (1997). doi:\n                    10.1006\/jcss.1997.1533","journal-title":"J. Comput. Syst. Sci."},{"key":"294_CR27","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/6610.001.0001","volume-title":"Systems that Learn: An Introduction to Learning Theory","author":"S Jain","year":"1999","unstructured":"Jain, S.: Systems that Learn: An Introduction to Learning Theory. MIT Press, Cambridge (1999)"},{"issue":"12","key":"294_CR28","doi-asserted-by":"publisher","first-page":"1777","DOI":"10.1016\/j.ic.2007.09.001","volume":"205","author":"S Jain","year":"2007","unstructured":"Jain, S., Kinber, E.: Iterative learning from positive data and negative counterexamples. Inf. Comput. 205(12), 1777\u20131805 (2007). doi:\n                    10.1016\/j.ic.2007.09.001","journal-title":"Inf. Comput."},{"issue":"8\/9","key":"294_CR29","first-page":"465","volume":"17","author":"KP Jantke","year":"1981","unstructured":"Jantke, K.P., Beick, H.-R.: Combining Postulates of Naturalness in Inductive Inference. Elektronische Informationsverarbeitung und Kybernetik 17(8\/9), 465\u2013484 (1981)","journal-title":"Elektronische Informationsverarbeitung und Kybernetik"},{"key":"294_CR30","unstructured":"Jha, S., Seshia, S.A.: A theory of formal synthesis via inductive learning. ArXiv e-prints (2015)"},{"key":"294_CR31","doi-asserted-by":"publisher","unstructured":"Jha, S., Gulwani, S., Seshia, S.A., Tiwari, A.: Oracle-guided Component-based Program Synthesis. ICSE \u201910, ACM, New York, NY, USA, pp. 215\u2013224 (2010). doi:\n                    10.1145\/1806799.1806833","DOI":"10.1145\/1806799.1806833"},{"key":"294_CR32","doi-asserted-by":"crossref","unstructured":"Jha, S., Gulwani, S., Seshia, S.A., Tiwari, A.: Synthesizing switching logic for safety and dwell-time requirements. In: Proceedings of the International Conference on Cyber-Physical Systems (ICCPS), pp. 22\u201331 (2010)","DOI":"10.1145\/1795194.1795198"},{"key":"294_CR33","doi-asserted-by":"crossref","unstructured":"Jha, S., Seshia, S.A.: Are there good mistakes? a theoretical analysis of CEGIS. In: 3rd Workshop on Synthesis (SYNT) (2014)","DOI":"10.4204\/EPTCS.157.10"},{"key":"294_CR34","doi-asserted-by":"crossref","unstructured":"Jha, S., Seshia, S.A., Tiwari, A.: Synthesis of optimal switching logic for hybrid systems. In: Proceedings of the international conference on embedded software (EMSOFT), pp. 107\u2013116 (2011)","DOI":"10.1145\/2038642.2038660"},{"key":"294_CR35","unstructured":"Jha, S., Seshia, S.A., Zhu, X.: On the teaching dimension of octagons for formal synthesis. In: 5th Workshop on Synthesis (SYNT) (2016)"},{"key":"294_CR36","unstructured":"Jha, S.K.: Towards automated system synthesis using SCIDUCTION. Ph.D. thesis, EECS Department, University of California, Berkeley (2011). \n                    http:\/\/www.eecs.berkeley.edu\/Pubs\/TechRpts\/2011\/EECS-2011-118.html"},{"key":"294_CR37","doi-asserted-by":"crossref","unstructured":"Jin, X., Donz\u00e9, A., Deshmukh, J., Seshia, S.A.: Mining requirements from closed-loop control models. In: HSCC (2013)","DOI":"10.1145\/2461328.2461337"},{"key":"294_CR38","volume-title":"Computer-Aided Reasoning: An Approach","author":"M Kaufmann","year":"2000","unstructured":"Kaufmann, M., Manolios, P., Moore, J.S.: Computer-Aided Reasoning: An Approach. Kluwer Academic Publishers, Dordrecht (2000)"},{"issue":"2","key":"294_CR39","doi-asserted-by":"publisher","first-page":"103","DOI":"10.1145\/2076450.2076472","volume":"55","author":"V Kuncak","year":"2012","unstructured":"Kuncak, V., Mayer, M., Piskac, R., Suter, P.: Software synthesis procedures. Commun. ACM 55(2), 103\u2013111 (2012)","journal-title":"Commun. ACM"},{"key":"294_CR40","volume-title":"Algorithmic Learning of Recursive Languages","author":"S Lange","year":"2000","unstructured":"Lange, S.: Algorithmic Learning of Recursive Languages. Mensch-und-Buch-Verlag, Berlin (2000)"},{"issue":"1\u20133","key":"294_CR41","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1016\/j.tcs.2008.02.030","volume":"397","author":"S Lange","year":"2008","unstructured":"Lange, S., Zeugmann, T., Zilles, S.: Learning indexed families of recursive languages from positive data: a survey. Theor. Comput. Sci. 397(1\u20133), 194\u2013232 (2008). doi:\n                    10.1016\/j.tcs.2008.02.030","journal-title":"Theor. Comput. Sci."},{"key":"294_CR42","doi-asserted-by":"publisher","unstructured":"Lange, S., Zilles, S.: Formal language identification: query learning vs. gold-style learning. Inf. Process. Lett. 91(6), 285\u2013292 (2004). doi:\n                    10.1016\/j.ipl.2004.05.010","DOI":"10.1016\/j.ipl.2004.05.010"},{"key":"294_CR43","unstructured":"Li, W.: Specification mining: new formalisms, algorithms and applications. Ph.D. thesis, EECS Department, University of California, Berkeley (2014)"},{"key":"294_CR44","doi-asserted-by":"crossref","unstructured":"Li, W., Dworkin, L., Seshia, S.A.: Mining assumptions for synthesis. In: 2011 9th IEEE\/ACM International Conference on Formal Methods and Models for Codesign (MEMOCODE), pp. 43\u201350 (2011)","DOI":"10.1109\/MEMCOD.2011.5970509"},{"issue":"8","key":"294_CR45","doi-asserted-by":"publisher","first-page":"76","DOI":"10.1145\/1536616.1536637","volume":"52","author":"S Malik","year":"2009","unstructured":"Malik, S., Zhang, L.: Boolean satisfiability: from theoretical hardness to practical success. Commun. ACM (CACM) 52(8), 76\u201382 (2009). doi:\n                    10.1145\/1536616.1536637","journal-title":"Commun. ACM (CACM)"},{"issue":"1","key":"294_CR46","doi-asserted-by":"publisher","first-page":"90","DOI":"10.1145\/357084.357090","volume":"2","author":"Z Manna","year":"1980","unstructured":"Manna, Z., Waldinger, R.: A deductive approach to program synthesis. ACM Trans. Program. Lang. Syst. 2(1), 90\u2013121 (1980). doi:\n                    10.1145\/357084.357090","journal-title":"ACM Trans. Program. Lang. Syst."},{"key":"294_CR47","volume-title":"Machine Learning","author":"TM Mitchell","year":"1997","unstructured":"Mitchell, T.M.: Machine Learning, 1st edn. McGraw-Hill Inc, New York (1997)","edition":"1"},{"key":"294_CR48","doi-asserted-by":"publisher","unstructured":"Morgado, A., Liffiton, M., Marques-Silva, J.: MaxSAT-based MCS enumeration. In: Biere, A., Nahir, A., Vos, T. (eds.) Hardware and Software: Verification and Testing, Lecture Notes in Computer Science 7857, Springer Berlin Heidelberg, pp. 86\u2013101 (2013). doi:\n                    10.1007\/978-3-642-39611-3_13","DOI":"10.1007\/978-3-642-39611-3_13"},{"key":"294_CR49","doi-asserted-by":"crossref","unstructured":"Owre, S., Rushby, J.M., Shankar, N.: PVS: a prototype verification system. In: Kapur, D., (ed.) In: 11th International Conference on Automated Deduction (CADE), Lecture Notes in Artificial Intelligence 607, Springer-Verlag, pp. 748\u2013752 (1992)","DOI":"10.1007\/3-540-55602-8_217"},{"key":"294_CR50","doi-asserted-by":"crossref","unstructured":"Pnueli, A., Rosner, R.: On the synthesis of a reactive module. In: ACM Symposium on Principles of Programming Languages (POPL), pp. 179\u2013190 (1989)","DOI":"10.1145\/75277.75293"},{"key":"294_CR51","doi-asserted-by":"crossref","unstructured":"Queille, J.-P., Sifakis, J.: Specification and verification of concurrent systems in CESAR. In: Symposium on programming, LNCS 137, pp. 337\u2013351 (1982)","DOI":"10.1007\/3-540-11494-7_22"},{"key":"294_CR52","doi-asserted-by":"publisher","unstructured":"Quinlan, J.R.: Induction of decision trees. Mach. Learn. 1(1), 81\u2013106 (1986). doi:\n                    10.1023\/A:1022643204877","DOI":"10.1023\/A:1022643204877"},{"key":"294_CR53","volume-title":"Theory of Recursive Functions and Effective Computability","author":"H Rogers Jr","year":"1987","unstructured":"Rogers Jr., H.: Theory of Recursive Functions and Effective Computability. MIT Press, Cambridge (1987)"},{"issue":"6","key":"294_CR54","doi-asserted-by":"publisher","first-page":"599","DOI":"10.1109\/34.387506","volume":"17","author":"S Salzberg","year":"1995","unstructured":"Salzberg, S., Delcher, A.L., Heath, D., Kasif, S.: Best-case results for nearest-neighbor learning. IEEE Trans. Pattern Anal. Mach. Intell. 17(6), 599\u2013608 (1995). doi:\n                    10.1109\/34.387506","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"294_CR55","doi-asserted-by":"crossref","unstructured":"Seshia, S.A.: Sciduction: combining induction, deduction, and structure for verification and synthesis. In: Proceedings of the Design Automation Conference (DAC), pp. 356\u2013365 (2012)","DOI":"10.1145\/2228360.2228425"},{"issue":"11","key":"294_CR56","doi-asserted-by":"publisher","first-page":"2036","DOI":"10.1109\/JPROC.2015.2471838","volume":"103","author":"SA Seshia","year":"2015","unstructured":"Seshia, S.A.: Combining induction, deduction, and structure for verification and synthesis. Proc. IEEE 103(11), 2036\u20132051 (2015)","journal-title":"Proc. IEEE"},{"key":"294_CR57","volume-title":"Algorithmic Program Debugging","author":"EY Shapiro","year":"1982","unstructured":"Shapiro, E.Y.: Algorithmic Program Debugging. MIT Press, Cambridge (1982)"},{"key":"294_CR58","unstructured":"Shinohara, A., Miyano, S.: Teachability in computational learning. In: ALT, pp. 247\u2013255 (1990)"},{"key":"294_CR59","doi-asserted-by":"crossref","unstructured":"Solar-Lezama, A., Rabbah, R., Bod\u00edk, R., Ebcioglu, K.: Programming by sketching for bit-streaming programs. In: PLDI (2005)","DOI":"10.1145\/1065010.1065045"},{"key":"294_CR60","doi-asserted-by":"publisher","unstructured":"Solar-Lezama, A., Tancau, L., Bodk, R., Seshia, S.A., Saraswat, V.A.: Combinatorial sketching for finite programs. In: ASPLOS, pp. 404\u2013415 (2006). doi:\n                    10.1145\/1168857.1168907","DOI":"10.1145\/1168857.1168907"},{"key":"294_CR61","doi-asserted-by":"crossref","unstructured":"Srivastava, S., Gulwani, S., Foster, J.S.: From program verification to program synthesis. In: Proceedings of ACM Symposium on Principles of Programming Languages, pp. 313\u2013326 (2010)","DOI":"10.1145\/1707801.1706337"},{"issue":"1","key":"294_CR62","doi-asserted-by":"publisher","first-page":"161","DOI":"10.1145\/321992.322002","volume":"24","author":"PD Summers","year":"1977","unstructured":"Summers, P.D.: A methodology for LISP program construction from examples. J. ACM 24(1), 161\u2013175 (1977)","journal-title":"J. ACM"},{"key":"294_CR63","doi-asserted-by":"crossref","unstructured":"Udupa, A., Raghavan, A., Deshmukh, J.V., Mador-Haim, S., Martin, M.M.K., Alur, R.: Transit: Specifying protocols with concolic snippets, In: Proceedings of the 34th ACM SIGPLAN conference on Programming Language Design and Implementation, pp. 287\u2013296 (2013)","DOI":"10.1145\/2499370.2462174"},{"key":"294_CR64","doi-asserted-by":"publisher","first-page":"1134","DOI":"10.1145\/1968.1972","volume":"27","author":"LG Valiant","year":"1984","unstructured":"Valiant, L.G.: A theory of the learnable. Commun. ACM 27, 1134\u20131142 (1984)","journal-title":"Commun. ACM"},{"key":"294_CR65","doi-asserted-by":"publisher","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities 16(2), pp. 264\u2013280 (1971). doi:\n                    10.1137\/1116025","DOI":"10.1137\/1116025"},{"key":"294_CR66","doi-asserted-by":"crossref","unstructured":"Weisberg, S.: Applied linear regression, 3rd edn. Wiley, Hoboken (2005). \n                    http:\/\/www.stat.umn.edu\/alr","DOI":"10.1002\/0471704091"},{"issue":"1\/2","key":"294_CR67","first-page":"93","volume":"12","author":"R Wiehagen","year":"1976","unstructured":"Wiehagen, R.: Limit detection of recursive functions by specific strategies. Electron. Inf. Process. Cybernet. 12(1\/2), 93\u201399 (1976)","journal-title":"Electron. Inf. Process. Cybernet."},{"key":"294_CR68","doi-asserted-by":"publisher","unstructured":"Wiehagen, R.: A thesis in inductive inference. In: Dix, J., Jantke, K.P., Schmitt, P.H. (eds.) Nonmonotonic and inductive logic, Lecture Notes in Computer Science 543, Springer, pp. 184\u2013207 (1990). doi:\n                    10.1007\/BFb0023324","DOI":"10.1007\/BFb0023324"},{"key":"294_CR69","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/3054.001.0001","volume-title":"The Formal Semantics of Programming Languages: An Introduction","author":"G Winskel","year":"1993","unstructured":"Winskel, G.: The Formal Semantics of Programming Languages: An Introduction. MIT Press, Cambridge (1993)"}],"container-title":["Acta Informatica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00236-017-0294-5\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-017-0294-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00236-017-0294-5.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,5,16]],"date-time":"2020-05-16T10:35:14Z","timestamp":1589625314000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00236-017-0294-5"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,2,15]]},"references-count":69,"journal-issue":{"issue":"7","published-print":{"date-parts":[[2017,11]]}},"alternative-id":["294"],"URL":"https:\/\/doi.org\/10.1007\/s00236-017-0294-5","relation":{},"ISSN":["0001-5903","1432-0525"],"issn-type":[{"type":"print","value":"0001-5903"},{"type":"electronic","value":"1432-0525"}],"subject":[],"published":{"date-parts":[[2017,2,15]]},"assertion":[{"value":"23 April 2015","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"23 January 2017","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"15 February 2017","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}