{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T03:19:17Z","timestamp":1779074357843,"version":"3.51.4"},"publisher-location":"New York, NY, USA","reference-count":46,"publisher":"ACM","license":[{"start":{"date-parts":[[2019,6,8]],"date-time":"2019-06-08T00:00:00Z","timestamp":1559952000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1846327,1748764,1409668"],"award-info":[{"award-number":["CCF-1846327,1748764,1409668"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007297","name":"Office of Naval Research","doi-asserted-by":"publisher","award":["N000141410468,N000141712947"],"award-info":[{"award-number":["N000141410468,N000141712947"]}],"id":[{"id":"10.13039\/100007297","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000185","name":"Defense Advanced Research Projects Agency","doi-asserted-by":"publisher","award":["FA8650-15-C-7562"],"award-info":[{"award-number":["FA8650-15-C-7562"]}],"id":[{"id":"10.13039\/100000185","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100006234","name":"Sandia National Laboratories","doi-asserted-by":"publisher","award":["1701331"],"award-info":[{"award-number":["1701331"]}],"id":[{"id":"10.13039\/100006234","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2019,6,8]]},"DOI":"10.1145\/3314221.3314629","type":"proceedings-article","created":{"date-parts":[[2019,6,7]],"date-time":"2019-06-07T21:02:18Z","timestamp":1559941338000},"page":"860-873","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["SemCluster: clustering of imperative programming assignments based on quantitative semantic features"],"prefix":"10.1145","author":[{"given":"David M.","family":"Perry","sequence":"first","affiliation":[{"name":"Purdue University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Dohyeong","family":"Kim","sequence":"additional","affiliation":[{"name":"Purdue University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Roopsha","family":"Samanta","sequence":"additional","affiliation":[{"name":"Purdue University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiangyu","family":"Zhang","sequence":"additional","affiliation":[{"name":"Purdue University, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2019,6,8]]},"reference":[{"key":"e_1_3_2_2_1_1","unstructured":"[n. d.]. CodeChef. https:\/\/www.codechef.com\/.  [n. d.]. CodeChef. https:\/\/www.codechef.com\/."},{"key":"e_1_3_2_2_2_1","unstructured":"[n. d.]. Codeforces. http:\/\/codeforces.com\/.  [n. d.]. Codeforces. http:\/\/codeforces.com\/."},{"key":"e_1_3_2_2_3_1","unstructured":"[n. d.]. HackerRank. https:\/\/www.hackerrank.com\/\/.  [n. d.]. HackerRank. https:\/\/www.hackerrank.com\/\/."},{"key":"e_1_3_2_2_4_1","unstructured":"2017. The 50 Most Popular MOOCs of All Time. https:\/\/www.onlinecoursereport.com\/the-50-most-popular-moocs-of-all-time\/.  2017. The 50 Most Popular MOOCs of All Time. https:\/\/www.onlinecoursereport.com\/the-50-most-popular-moocs-of-all-time\/."},{"key":"e_1_3_2_2_5_1","volume-title":"Software Testing Techniques","author":"Beizer Boris","unstructured":"Boris Beizer . 2003. Software Testing Techniques . Dreamtech Press . Boris Beizer. 2003. Software Testing Techniques. Dreamtech Press."},{"key":"e_1_3_2_2_6_1","doi-asserted-by":"publisher","DOI":"10.5555\/2819009.2819072"},{"key":"e_1_3_2_2_7_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00236-017-0297-2"},{"key":"e_1_3_2_2_8_1","first-page":"383","volume-title":"Qlose: Program Repair with Quantitative Objectives. In International Conference on Computer Aided Verification. Springer","author":"D'Antoni Loris","year":"2016","unstructured":"Loris D'Antoni , Roopsha Samanta , and Rishabh Singh . 2016 . Qlose: Program Repair with Quantitative Objectives. In International Conference on Computer Aided Verification. Springer , Toronto, Ontario, Canada , 383 - 401 . Loris D'Antoni, Roopsha Samanta, and Rishabh Singh. 2016. Qlose: Program Repair with Quantitative Objectives. In International Conference on Computer Aided Verification. Springer, Toronto, Ontario, Canada, 383-401."},{"key":"e_1_3_2_2_9_1","doi-asserted-by":"publisher","DOI":"10.5555\/1792734.1792766"},{"key":"e_1_3_2_2_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2014.142"},{"key":"e_1_3_2_2_11_1","doi-asserted-by":"crossref","unstructured":"Matthew Fredrikson and Somesh Jha. 2014. Satisfiability Modulo Counting: A New Approach for Analyzing Privacy Properties. In Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS) (CSL-LICS '14). ACM New York NY USA Article 42 10 pages.   Matthew Fredrikson and Somesh Jha. 2014. Satisfiability Modulo Counting: A New Approach for Analyzing Privacy Properties. In Proceedings of the Joint Meeting of the Twenty-Third EACSL Annual Conference on Computer Science Logic (CSL) and the Twenty-Ninth Annual ACM\/IEEE Symposium on Logic in Computer Science (LICS) (CSL-LICS '14) . ACM New York NY USA Article 42 10 pages.","DOI":"10.1145\/2603088.2603097"},{"key":"e_1_3_2_2_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1368088.1368132"},{"key":"e_1_3_2_2_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/2699751"},{"key":"e_1_3_2_2_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192387"},{"key":"e_1_3_2_2_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/3051457.3051467"},{"key":"e_1_3_2_2_16_1","volume-title":"AIED 2013 Workshops Proceedings Volume","volume":"25","author":"Huang Jonathan","year":"2013","unstructured":"Jonathan Huang , Chris Piech , Andy Nguyen , and Leonidas Guibas . 2013 . Syntactic and Functional Variability of a Million Code Submissions in a Machine Learning MOOC . In AIED 2013 Workshops Proceedings Volume , Vol. 25 . Jonathan Huang, Chris Piech, Andy Nguyen, and Leonidas Guibas. 2013. Syntactic and Functional Variability of a Million Code Submissions in a Machine Learning MOOC. In AIED 2013 Workshops Proceedings Volume, Vol. 25."},{"key":"e_1_3_2_2_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1268784.1268807"},{"key":"e_1_3_2_2_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2950290.2950363"},{"key":"e_1_3_2_2_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/2983990.2984031"},{"key":"e_1_3_2_2_20_1","doi-asserted-by":"publisher","DOI":"10.5555\/977395.977673"},{"key":"e_1_3_2_2_21_1","first-page":"872","volume-title":"Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '06)","author":"Liu Chao","unstructured":"Chao Liu , Chen Chen , Jiawei Han , and Philip S. Yu . 2006. GPLAG: Detection of Software Plagiarism by Program Dependence Graph Analysis . In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '06) . ACM, New York, NY, USA , 872 - 881 . Chao Liu, Chen Chen, Jiawei Han, and Philip S. Yu. 2006. GPLAG: Detection of Software Plagiarism by Program Dependence Graph Analysis. In Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD '06). ACM, New York, NY, USA, 872-881."},{"key":"e_1_3_2_2_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/2889160.2889202"},{"key":"e_1_3_2_2_23_1","first-page":"453","article-title":"Volume Computation for Boolean Combination of Linear Arithmetic Constraints. In International Conference on Automated Deduction. Springer, Montreal","author":"Ma Feifei","year":"2009","unstructured":"Feifei Ma , Sheng Liu , and Jian Zhang . 2009 . Volume Computation for Boolean Combination of Linear Arithmetic Constraints. In International Conference on Automated Deduction. Springer, Montreal , Canada , 453 - 468 . Feifei Ma, Sheng Liu, and Jian Zhang. 2009. Volume Computation for Boolean Combination of Linear Arithmetic Constraints. In International Conference on Automated Deduction. Springer, Montreal, Canada, 453-468.","journal-title":"Canada"},{"key":"e_1_3_2_2_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/2566486.2568023"},{"key":"e_1_3_2_2_25_1","doi-asserted-by":"publisher","DOI":"10.1145\/3059009.3059026"},{"key":"e_1_3_2_2_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/1953048.2078195"},{"key":"e_1_3_2_2_27_1","first-page":"547","volume-title":"Building Program Vector Representations for Deep Learning. In International Conference on Knowledge Science, Engineering and Management. Springer","author":"Peng Hao","year":"2015","unstructured":"Hao Peng , Lili Mou , Ge Li , Yuxuan Liu , Lu Zhang , and Zhi Jin . 2015 . Building Program Vector Representations for Deep Learning. In International Conference on Knowledge Science, Engineering and Management. Springer , Chongqing, China , 547 - 553 . Hao Peng, Lili Mou, Ge Li, Yuxuan Liu, Lu Zhang, and Zhi Jin. 2015. Building Program Vector Representations for Deep Learning. In International Conference on Knowledge Science, Engineering and Management. Springer, Chongqing, China, 547-553."},{"key":"e_1_3_2_2_28_1","first-page":"1093","volume-title":"Proceedings of the 32Nd International Conference on International Conference on Machine Learning -","volume":"37","author":"Piech Chris","year":"2015","unstructured":"Chris Piech , Jonathan Huang , Andy Nguyen , Mike Phulsuksombati , Mehran Sahami , and Leonidas Guibas . 2015 . Learning Program Embeddings to Propagate Feedback on Student Code . In Proceedings of the 32Nd International Conference on International Conference on Machine Learning - Volume 37 (ICML'15). JMLR.org, Lille, France , 1093 - 1102 . http:\/\/dl.acm.org\/citation.cfm?id=3045118.3045235. Chris Piech, Jonathan Huang, Andy Nguyen, Mike Phulsuksombati, Mehran Sahami, and Leonidas Guibas. 2015. Learning Program Embeddings to Propagate Feedback on Student Code. In Proceedings of the 32Nd International Conference on International Conference on Machine Learning - Volume 37 (ICML'15). JMLR.org, Lille, France, 1093-1102. http:\/\/dl.acm.org\/citation.cfm?id=3045118.3045235."},{"key":"e_1_3_2_2_29_1","first-page":"1016","article-title":"Finding Plagiarisms Among a Set of Programs with JPlag","volume":"8","author":"Prechelt Lutz","year":"2002","unstructured":"Lutz Prechelt , Guido Malpohl , and Michael Philippsen . 2002 . Finding Plagiarisms Among a Set of Programs with JPlag . Journal of Universal Computer Science 8 , 11 (2002), 1016 . Lutz Prechelt, Guido Malpohl, and Michael Philippsen. 2002. Finding Plagiarisms Among a Set of Programs with JPlag. Journal of Universal Computer Science 8, 11 (2002), 1016.","journal-title":"Journal of Universal Computer Science"},{"key":"e_1_3_2_2_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/2984043.2989222"},{"key":"e_1_3_2_2_31_1","first-page":"290","volume-title":"Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI '09)","author":"Hu Zvonimir","unstructured":"Zvonimir Rakamari? and Alan J. Hu . 2009. A Scalable Memory Model for Low-Level Code . In Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI '09) . Springer-Verlag, Berlin, Heidelberg , 290 - 304 . Zvonimir Rakamari? and Alan J. Hu. 2009. A Scalable Memory Model for Low-Level Code. In Proceedings of the 10th International Conference on Verification, Model Checking, and Abstract Interpretation (VMCAI '09). Springer-Verlag, Berlin, Heidelberg, 290-304."},{"key":"e_1_3_2_2_32_1","volume-title":"Automatic Generation of Programming Feedback: A Data-driven Approach. In The First Workshop on AI-supported Education for Computer Science (AIEDCS","volume":"50","author":"Rivers Kelly","year":"2013","unstructured":"Kelly Rivers and Kenneth R Koedinger . 2013 . Automatic Generation of Programming Feedback: A Data-driven Approach. In The First Workshop on AI-supported Education for Computer Science (AIEDCS 2013), Vol. 50 . Kelly Rivers and Kenneth R Koedinger. 2013. Automatic Generation of Programming Feedback: A Data-driven Approach. In The First Workshop on AI-supported Education for Computer Science (AIEDCS 2013), Vol. 50."},{"key":"e_1_3_2_2_33_1","volume-title":"Koedinger","author":"Rivers Kelly","year":"2015","unstructured":"Kelly Rivers and Kenneth R . Koedinger . 2015 . Data-Driven Hint Generation in Vast Solution Spaces: a Self-Improving Python Programming Tutor. International Journal of Artificial Intelligence in Education ( 2015), 1-28. Kelly Rivers and Kenneth R. Koedinger. 2015. Data-Driven Hint Generation in Vast Solution Spaces: a Self-Improving Python Programming Tutor. International Journal of Artificial Intelligence in Education (2015), 1-28."},{"key":"e_1_3_2_2_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/872757.872770"},{"key":"e_1_3_2_2_35_1","doi-asserted-by":"publisher","DOI":"10.1145\/2499370.2462195"},{"key":"e_1_3_2_2_36_1","first-page":"583","article-title":"Cluster Ensembles--a Knowledge Reuse Framework for Combining Multiple Partitions","author":"Strehl Alexander","year":"2002","unstructured":"Alexander Strehl and Joydeep Ghosh . 2002 . Cluster Ensembles--a Knowledge Reuse Framework for Combining Multiple Partitions . Journal of machine learning research 3 , Dec (2002), 583 - 617 . Alexander Strehl and Joydeep Ghosh. 2002. Cluster Ensembles--a Knowledge Reuse Framework for Combining Multiple Partitions. Journal of machine learning research 3, Dec (2002), 583-617.","journal-title":"Journal of machine learning research 3"},{"key":"e_1_3_2_2_37_1","volume-title":"International Symposium on Future Software Technology","volume":"20","author":"Tamada Haruaki","year":"2004","unstructured":"Haruaki Tamada , Keiji Okamoto , Masahide Nakamura , Akito Monden , and Ken-ichi Matsumoto. 2004 . Dynamic Software Birthmarks to Detect the Theft of Windows Applications . In International Symposium on Future Software Technology , Vol. 20 . Citeseer. Haruaki Tamada, Keiji Okamoto, Masahide Nakamura, Akito Monden, and Ken-ichi Matsumoto. 2004. Dynamic Software Birthmarks to Detect the Theft of Windows Applications. In International Symposium on Future Software Technology, Vol. 20. Citeseer."},{"key":"e_1_3_2_2_38_1","doi-asserted-by":"publisher","DOI":"10.1007\/11814948_38"},{"key":"e_1_3_2_2_39_1","first-page":"317","volume-title":"Proceedings of the Sixth Australasian Conference on Computing Education -","volume":"30","author":"Truong Nghi","year":"2004","unstructured":"Nghi Truong , Paul Roe , and Peter Bancroft . 2004 . Static Analysis of Students' Java Programs . In Proceedings of the Sixth Australasian Conference on Computing Education - Volume 30 (ACE '04). Australian Computer Society, Inc., Darlinghurst, Australia, Australia , 317 - 325 . http:\/\/dl.acm.org\/citation.cfm?id=979968.980011. Nghi Truong, Paul Roe, and Peter Bancroft. 2004. Static Analysis of Students' Java Programs. In Proceedings of the Sixth Australasian Conference on Computing Education - Volume 30 (ACE '04). Australian Computer Society, Inc., Darlinghurst, Australia, Australia, 317-325. http:\/\/dl.acm.org\/citation.cfm?id=979968.980011."},{"key":"e_1_3_2_2_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/3192366.3192384"},{"key":"e_1_3_2_2_41_1","volume-title":"Dynamic Neural Program Embeddings for Program Repair. In International Conference on Learning Representations.","author":"Wang Ke","year":"2018","unstructured":"Ke Wang , Zhendong Su , and Rishabh Singh . 2018 . Dynamic Neural Program Embeddings for Program Repair. In International Conference on Learning Representations. Ke Wang, Zhendong Su, and Rishabh Singh. 2018. Dynamic Neural Program Embeddings for Program Repair. In International Conference on Learning Representations."},{"key":"e_1_3_2_2_42_1","doi-asserted-by":"publisher","DOI":"10.1145\/1653662.1653696"},{"key":"e_1_3_2_2_43_1","doi-asserted-by":"publisher","DOI":"10.1109\/ACSAC.2009.24"},{"key":"e_1_3_2_2_44_1","doi-asserted-by":"publisher","DOI":"10.1007\/11499107_24"},{"key":"e_1_3_2_2_45_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2003.1191799"},{"key":"e_1_3_2_2_46_1","doi-asserted-by":"publisher","DOI":"10.1002\/spe.4380210706"}],"event":{"name":"PLDI '19: 40th ACM SIGPLAN Conference on Programming Language Design and Implementation","location":"Phoenix AZ USA","acronym":"PLDI '19","sponsor":["SIGPLAN ACM Special Interest Group on Programming Languages"]},"container-title":["Proceedings of the 40th ACM SIGPLAN Conference on Programming Language Design and Implementation"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3314221.3314629","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3314221.3314629","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/3314221.3314629","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,17]],"date-time":"2025-06-17T23:53:22Z","timestamp":1750204402000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/3314221.3314629"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019,6,8]]},"references-count":46,"alternative-id":["10.1145\/3314221.3314629","10.1145\/3314221"],"URL":"https:\/\/doi.org\/10.1145\/3314221.3314629","relation":{},"subject":[],"published":{"date-parts":[[2019,6,8]]},"assertion":[{"value":"2019-06-08","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}