{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,2]],"date-time":"2025-05-02T14:09:40Z","timestamp":1746194980114,"version":"3.37.3"},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319961446"},{"type":"electronic","value":"9783319961453"}],"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:\/\/creativecommons.org\/licenses\/by\/4.0"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-96145-3_12","type":"book-chapter","created":{"date-parts":[[2018,7,20]],"date-time":"2018-07-20T22:25:55Z","timestamp":1532125555000},"page":"211-229","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":16,"title":["Fast Numerical Program Analysis with Reinforcement Learning"],"prefix":"10.1007","author":[{"given":"Gagandeep","family":"Singh","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Markus","family":"P\u00fcschel","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Martin","family":"Vechev","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,7,18]]},"reference":[{"unstructured":"ELINA: ETH Library for Numerical Analysis. http:\/\/elina.ethz.ch","key":"12_CR1"},{"key":"12_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1007\/3-540-44898-5_19","volume-title":"Static Analysis","author":"R Bagnara","year":"2003","unstructured":"Bagnara, R., Hill, P.M., Ricci, E., Zaffanella, E.: Precise widening operators for convex polyhedra. In: Cousot, R. (ed.) SAS 2003. LNCS, vol. 2694, pp. 337\u2013354. Springer, Heidelberg (2003). https:\/\/doi.org\/10.1007\/3-540-44898-5_19"},{"key":"12_CR3","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"887","DOI":"10.1007\/978-3-662-49674-9_55","volume-title":"Tools and Algorithms for the Construction and Analysis of Systems","author":"D Beyer","year":"2016","unstructured":"Beyer, D.: Reliable and reproducible competition results with benchexec and witnesses (Report on SV-COMP 2016). In: Chechik, M., Raskin, J.-F. (eds.) TACAS 2016. LNCS, vol. 9636, pp. 887\u2013904. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-49674-9_55"},{"issue":"OOPSLA","key":"12_CR4","doi-asserted-by":"crossref","first-page":"101:1","DOI":"10.1145\/3133925","volume":"1","author":"K Chae","year":"2017","unstructured":"Chae, K., Oh, H., Heo, K., Yang, H.: Automatically generating features for learning program analysis heuristics for C-like languages. Proc. ACM Program. Lang. 1(OOPSLA), 101:1\u2013101:25 (2017)","journal-title":"Proc. ACM Program. Lang."},{"key":"12_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1007\/978-3-662-53413-7_10","volume-title":"Static Analysis","author":"G Gange","year":"2016","unstructured":"Gange, G., Navas, J.A., Schachte, P., S\u00f8ndergaard, H., Stuckey, P.J.: Exploiting sparsity in difference-bound matrices. In: Rival, X. (ed.) SAS 2016. LNCS, vol. 9837, pp. 189\u2013211. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53413-7_10"},{"key":"12_CR6","doi-asserted-by":"crossref","DOI":"10.1561\/9781601987617","volume-title":"A Tutorial on Linear Function Approximators for Dynamic Programming and Reinforcement Learning","author":"A Geramifard","year":"2013","unstructured":"Geramifard, A., Walsh, T.J., Tellex, S.: A Tutorial on Linear Function Approximators for Dynamic Programming and Reinforcement Learning. Now Publishers Inc., Hanover (2013)"},{"key":"12_CR7","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"343","DOI":"10.1007\/978-3-319-21690-4_20","volume-title":"Computer Aided Verification","author":"A Gurfinkel","year":"2015","unstructured":"Gurfinkel, A., Kahsai, T., Komuravelli, A., Navas, J.A.: The seahorn verification framework. In: Kroening, D., P\u0103s\u0103reanu, C.S. (eds.) CAV 2015. LNCS, vol. 9206, pp. 343\u2013361. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21690-4_20"},{"unstructured":"Hasselt, H.V.: Double Q-learning. In: Lafferty, J.D., Williams, C.K.I., Shawe-Taylor, J., Zemel, R.S., Culotta, A. (eds.) Neural Information Processing Systems (NIPS), pp. 2613\u20132621 (2010)","key":"12_CR8"},{"key":"12_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"237","DOI":"10.1007\/978-3-662-53413-7_12","volume-title":"Static Analysis","author":"K Heo","year":"2016","unstructured":"Heo, K., Oh, H., Yang, H.: Learning a variable-clustering strategy for octagon from labeled data generated by a static analysis. In: Rival, X. (ed.) SAS 2016. LNCS, vol. 9837, pp. 237\u2013256. Springer, Heidelberg (2016). https:\/\/doi.org\/10.1007\/978-3-662-53413-7_12"},{"key":"12_CR10","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1016\/j.entcs.2017.02.004","volume":"331","author":"J-H Jourdan","year":"2017","unstructured":"Jourdan, J.-H.: Sparsity preserving algorithms for octagons. Electron. Notes Theor. Comput. Sci. 331, 57\u201370 (2017). Workshop on Numerical and Symbolic Abstract Domains (NSAD)","journal-title":"Electron. Notes Theor. Comput. Sci."},{"key":"12_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"17","DOI":"10.1007\/978-3-319-08867-9_2","volume-title":"Computer Aided Verification","author":"A Komuravelli","year":"2014","unstructured":"Komuravelli, A., Gurfinkel, A., Chaki, S.: SMT-based model checking for recursive programs. In: Biere, A., Bloem, R. (eds.) CAV 2014. LNCS, vol. 8559, pp. 17\u201334. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08867-9_2"},{"doi-asserted-by":"crossref","unstructured":"Kulkarni, S., Mangal, R., Zhang, X., Naik, M.: Accelerating program analyses by cross-program training. In: Proceedings of Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pp. 359\u2013377 (2016)","key":"12_CR12","DOI":"10.1145\/2983990.2984023"},{"key":"12_CR13","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1016\/S1571-0653(04)00332-4","volume":"9","author":"MG Lagoudakis","year":"2001","unstructured":"Lagoudakis, M.G., Littman, M.L.: Learning to select branching rules in the DPLL procedure for satisfiability. Electron. Notes Discret. Math. 9, 344\u2013359 (2001)","journal-title":"Electron. Notes Discret. Math."},{"doi-asserted-by":"crossref","unstructured":"Liang, P., Tripp, O., Naik, M.: Learning minimal abstractions. In: Proceedings Symposium on Principles of Programming Languages (POPL), pp. 31\u201342 (2011)","key":"12_CR14","DOI":"10.1145\/1926385.1926391"},{"key":"12_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1007\/978-3-319-66706-5_11","volume-title":"Static Analysis","author":"A Mar\u00e9chal","year":"2017","unstructured":"Mar\u00e9chal, A., Monniaux, D., P\u00e9rin, M.: Scalable minimizing-operators on polyhedra via parametric linear programming. In: Ranzato, F. (ed.) SAS 2017. LNCS, vol. 10422, pp. 212\u2013231. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-66706-5_11"},{"key":"12_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"367","DOI":"10.1007\/978-3-319-52234-0_20","volume-title":"Verification, Model Checking, and Abstract Interpretation","author":"A Mar\u00e9chal","year":"2017","unstructured":"Mar\u00e9chal, A., P\u00e9rin, M.: Efficient elimination of redundancies in polyhedra by raytracing. In: Bouajjani, A., Monniaux, D. (eds.) VMCAI 2017. LNCS, vol. 10145, pp. 367\u2013385. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-52234-0_20"},{"issue":"7540","key":"12_CR17","doi-asserted-by":"crossref","first-page":"529","DOI":"10.1038\/nature14236","volume":"518","author":"V Mnih","year":"2015","unstructured":"Mnih, V., Kavukcuoglu, K., Silver, D., Rusu, A.A., Veness, J., Bellemare, M.G., Graves, A., Riedmiller, M., Fidjeland, A.K., Ostrovski, G., Petersen, S., Beattie, C., Sadik, A., Antonoglou, I., King, H., Kumaran, D., Wierstra, D., Legg, S., Hassabis, D.: Human-level control through deep reinforcement learning. Nature 518(7540), 529\u2013533 (2015)","journal-title":"Nature"},{"doi-asserted-by":"crossref","unstructured":"Oh, H., Lee, W., Heo, K., Yang, H., Yi, K.: Selective context-sensitivity guided by impact pre-analysis. In: Proceedings of Programming Language Design and Implementation (PLDI), pp. 475\u2013484 (2014)","key":"12_CR18","DOI":"10.1145\/2666356.2594318"},{"doi-asserted-by":"crossref","unstructured":"Oh, H., Yang, H., Yi, K.: Learning a strategy for adapting a program analysis via Bayesian optimisation. In: Proceedings of Object-Oriented Programming, Systems, Languages, and Applications (OOPSLA), pp. 572\u2013588 (2015)","key":"12_CR19","DOI":"10.1145\/2814270.2814309"},{"doi-asserted-by":"crossref","unstructured":"Singh, G., P\u00fcschel, M., Vechev, M.: Making numerical program analysis fast. In: Proceedings of Programming Language Design and Implementation (PLDI), pp. 303\u2013313 (2015)","key":"12_CR20","DOI":"10.1145\/2737924.2738000"},{"doi-asserted-by":"crossref","unstructured":"Singh, G., P\u00fcschel, M., Vechev, M.: Fast polyhedra abstract domain. In: Proceedings of Principles of Programming Languages (POPL), pp. 46\u201359 (2017)","key":"12_CR21","DOI":"10.1145\/3009837.3009885"},{"issue":"POPL","key":"12_CR22","doi-asserted-by":"crossref","first-page":"55:1","DOI":"10.1145\/3158143","volume":"2","author":"G Singh","year":"2017","unstructured":"Singh, G., P\u00fcschel, M., Vechev, M.: A practical construction for decomposing numerical abstract domains. Proc. ACM Program. Lang. 2(POPL), 55:1\u201355:28 (2017)","journal-title":"Proc. ACM Program. Lang."},{"issue":"4","key":"12_CR23","doi-asserted-by":"crossref","first-page":"585","DOI":"10.1145\/263867.263872","volume":"44","author":"M Stoer","year":"1997","unstructured":"Stoer, M., Wagner, F.: A simple min-cut algorithm. J. ACM 44(4), 585\u2013591 (1997)","journal-title":"J. ACM"},{"key":"12_CR24","volume-title":"Introduction to Reinforcement Learning","author":"RS Sutton","year":"1998","unstructured":"Sutton, R.S., Barto, A.G.: Introduction to Reinforcement Learning, 1st edn. MIT Press, Cambridge (1998)","edition":"1"},{"issue":"3","key":"12_CR25","first-page":"279","volume":"8","author":"CJCH Watkins","year":"1992","unstructured":"Watkins, C.J.C.H., Dayan, P.: Q-learning. Mach. Learn. 8(3), 279\u2013292 (1992)","journal-title":"Mach. Learn."}],"container-title":["Lecture Notes in Computer Science","Computer Aided Verification"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-96145-3_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,6]],"date-time":"2020-11-06T11:13:39Z","timestamp":1604661219000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-96145-3_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319961446","9783319961453"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-96145-3_12","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]}}}