{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,19]],"date-time":"2026-06-19T16:40:50Z","timestamp":1781887250357,"version":"3.54.5"},"publisher-location":"New York, NY, USA","reference-count":43,"publisher":"ACM","license":[{"start":{"date-parts":[[2017,8,21]],"date-time":"2017-08-21T00:00:00Z","timestamp":1503273600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"NSF","doi-asserted-by":"publisher","award":["1414172"],"award-info":[{"award-number":["1414172"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2017,8,21]]},"DOI":"10.1145\/3106237.3106289","type":"proceedings-article","created":{"date-parts":[[2017,8,2]],"date-time":"2017-08-02T19:36:18Z","timestamp":1501702578000},"page":"683-693","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Recovering clear, natural identifiers from obfuscated JS names"],"prefix":"10.1145","author":[{"given":"Bogdan","family":"Vasilescu","sequence":"first","affiliation":[{"name":"Carnegie Mellon University, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Casey","family":"Casalnuovo","sequence":"additional","affiliation":[{"name":"University of California at Davis, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Premkumar","family":"Devanbu","sequence":"additional","affiliation":[{"name":"University of California at Davis, USA"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2017,8,21]]},"reference":[{"key":"e_1_3_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635883"},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1145\/2786805.2786849"},{"key":"e_1_3_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635901"},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.5555\/647594.731528"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.5555\/646766.704152"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1007\/s11416-008-0084-2"},{"key":"e_1_3_2_1_7_1","volume-title":"Automated Docstring Generation for Python Functions. Master\u2019s thesis","author":"Cabot Michael Anthony","unstructured":"Michael Anthony Cabot . 2014. Automated Docstring Generation for Python Functions. Master\u2019s thesis . University of Amsterdam. Michael Anthony Cabot. 2014. Automated Docstring Generation for Python Functions. Master\u2019s thesis. University of Amsterdam."},{"key":"e_1_3_2_1_8_1","volume-title":"Manning","author":"Cer Daniel","year":"2010","unstructured":"Daniel Cer , Michel Galley , Daniel Jurafsky , and Christopher D . Manning . 2010 . Phrasal : A Statistical Machine Translation Toolkit for Exploring New Model Features. In Proc. NAACL HLT 2010 Demonstration Session. Association for Computational Linguistics , 9\u201312. Daniel Cer, Michel Galley, Daniel Jurafsky, and Christopher D. Manning. 2010. Phrasal: A Statistical Machine Translation Toolkit for Exploring New Model Features. In Proc. NAACL HLT 2010 Demonstration Session. Association for Computational Linguistics, 9\u201312."},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.3115\/981863.981904"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/268946.268962"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2002.1027797"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1007\/11784180_9"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"crossref","DOI":"10.1111\/j.2517-6161.1977.tb01600.x","article-title":"Maximum likelihood from incomplete data via the EM algorithm","author":"Dempster Arthur P","year":"1977","unstructured":"Arthur P Dempster , Nan M Laird , and Donald B Rubin . 1977 . Maximum likelihood from incomplete data via the EM algorithm . Journal of the Royal Statistical Society. Arthur P Dempster, Nan M Laird, and Donald B Rubin. 1977. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society.","journal-title":"Journal of the Royal Statistical Society."},{"key":"e_1_3_2_1_15_1","volume-title":"1\u201338","author":"Series B","year":"1977","unstructured":"Series B (methodological) ( 1977 ), 1\u201338 . Series B (methodological) (1977), 1\u201338."},{"key":"e_1_3_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/336512.336559"},{"key":"e_1_3_2_1_17_1","volume-title":"Discovering statistics using SPSS","author":"Field Andy","unstructured":"Andy Field . 2009. Discovering statistics using SPSS . Sage . Andy Field. 2009. Discovering statistics using SPSS. Sage."},{"key":"e_1_3_2_1_18_1","volume-title":"Autofolding for Source Code Summarization. arXiv preprint arXiv:1403.4503","author":"Fowkes Jaroslav","year":"2014","unstructured":"Jaroslav Fowkes , Razvan Ranca , Miltiadis Allamanis , Mirella Lapata , and Charles Sutton . 2014. Autofolding for Source Code Summarization. arXiv preprint arXiv:1403.4503 ( 2014 ). Jaroslav Fowkes, Razvan Ranca, Miltiadis Allamanis, Mirella Lapata, and Charles Sutton. 2014. Autofolding for Source Code Summarization. arXiv preprint arXiv:1403.4503 (2014)."},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2819009.2819143"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.107"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1882291.1882315"},{"key":"e_1_3_2_1_22_1","volume-title":"Proc. Fourth Workshop on Empirical Studies of Programmers.","author":"Gellenbeck Edward M","year":"1991","unstructured":"Edward M Gellenbeck and Curtis R Cook . 1991 . An investigation of procedure and variable names as beacons during program comprehension . In Proc. Fourth Workshop on Empirical Studies of Programmers. Edward M Gellenbeck and Curtis R Cook. 1991. An investigation of procedure and variable names as beacons during program comprehension. In Proc. Fourth Workshop on Empirical Studies of Programmers."},{"key":"e_1_3_2_1_23_1","volume-title":"Proc. Working Conference on Mining Software Repositories (MSR). IEEE, 12\u201321","author":"Gousios Georgios","year":"2012","unstructured":"Georgios Gousios and Diomidis Spinellis . 2012 . GHTorrent: GitHub\u2019s data from a \ufffdrehose . In Proc. Working Conference on Mining Software Repositories (MSR). IEEE, 12\u201321 . Georgios Gousios and Diomidis Spinellis. 2012. GHTorrent: GitHub\u2019s data from a \ufffdrehose. In Proc. Working Conference on Mining Software Repositories (MSR). IEEE, 12\u201321."},{"key":"e_1_3_2_1_24_1","volume-title":"Proc. Annual Meeting of the Association for Computational Linguistics. ACL, 690\u2013696","author":"Hea\ufffdeld Kenneth","year":"2013","unstructured":"Kenneth Hea\ufffdeld , Ivan Pouzyrevsky , Jonathan H. Clark , and Philipp Koehn . 2013 . Scalable Modi\ufffded Kneser-Ney Language Model Estimation . In Proc. Annual Meeting of the Association for Computational Linguistics. ACL, 690\u2013696 . Kenneth Hea\ufffdeld, Ivan Pouzyrevsky, Jonathan H. Clark, and Philipp Koehn. 2013. Scalable Modi\ufffded Kneser-Ney Language Model Estimation. In Proc. Annual Meeting of the Association for Computational Linguistics. ACL, 690\u2013696."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2337223.2337322"},{"key":"e_1_3_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/2661136.2661148"},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1093\/comjnl\/27.2.97"},{"key":"e_1_3_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.5555\/1557769.1557821"},{"key":"e_1_3_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.3115\/1073445.1073462"},{"key":"e_1_3_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICPC.2006.51"},{"key":"e_1_3_2_1_31_1","volume-title":"Foundations of statistical natural language processing","author":"Manning Christopher D","unstructured":"Christopher D Manning and Hinrich Sch\u00fctze . 1999. Foundations of statistical natural language processing . MIT Press . Christopher D Manning and Hinrich Sch\u00fctze. 1999. Foundations of statistical natural language processing. MIT Press."},{"key":"e_1_3_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.3115\/1118693.1118711"},{"key":"e_1_3_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1109\/SP.2007.17"},{"key":"e_1_3_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/2642937.2643010"},{"key":"e_1_3_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2494584"},{"key":"e_1_3_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1145\/2591062.2591072"},{"key":"e_1_3_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.74"},{"key":"e_1_3_2_1_38_1","volume-title":"Phong Minh Vu, and Tung Thanh Nguyen.","author":"Nguyen Tam The","year":"2015","unstructured":"Tam The Nguyen , Hung Viet Pham , Phong Minh Vu, and Tung Thanh Nguyen. 2015 . Learning api usages from bytecode: A statistical approach. arXiv preprint arXiv:1507.07306 (2015). Tam The Nguyen, Hung Viet Pham, Phong Minh Vu, and Tung Thanh Nguyen. 2015. Learning api usages from bytecode: A statistical approach. arXiv preprint arXiv:1507.07306 (2015)."},{"key":"e_1_3_2_1_39_1","unstructured":"Franz Josef Och. 2005. Statistical machine translation: Foundations and recent advances. Tutorial at MT Summit. (2005). http:\/\/www.mt-archive.info\/ MTS-2005-Och.pdf. Franz Josef Och. 2005. Statistical machine translation: Foundations and recent advances. Tutorial at MT Summit. (2005). http:\/\/www.mt-archive.info\/ MTS-2005-Och.pdf."},{"key":"e_1_3_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1162\/089120103321337421"},{"key":"e_1_3_2_1_41_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2015.36"},{"key":"e_1_3_2_1_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/2884781.2884848"},{"key":"e_1_3_2_1_43_1","doi-asserted-by":"publisher","DOI":"10.1145\/2676726.2677009"},{"key":"e_1_3_2_1_44_1","doi-asserted-by":"publisher","DOI":"10.1145\/1925805.1925815"}],"event":{"name":"ESEC\/FSE'17: Joint Meeting of the European Software Engineering Conference and the ACM SIGSOFT Symposium on the Foundations of Software Engineering","location":"Paderborn Germany","acronym":"ESEC\/FSE'17","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"]},"container-title":["Proceedings of the 2017 11th Joint Meeting on Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3106237.3106289","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3106237.3106289","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3106237.3106289","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T03:30:37Z","timestamp":1750217437000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3106237.3106289"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017,8,21]]},"references-count":43,"alternative-id":["10.1145\/3106237.3106289","10.1145\/3106237"],"URL":"https:\/\/doi.org\/10.1145\/3106237.3106289","relation":{},"subject":[],"published":{"date-parts":[[2017,8,21]]},"assertion":[{"value":"2017-08-21","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}