{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,31]],"date-time":"2025-12-31T12:17:06Z","timestamp":1767183426941,"version":"3.41.0"},"publisher-location":"New York, NY, USA","reference-count":27,"publisher":"ACM","license":[{"start":{"date-parts":[[2014,11,11]],"date-time":"2014-11-11T00:00:00Z","timestamp":1415664000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":[],"published-print":{"date-parts":[[2014,11,11]]},"DOI":"10.1145\/2635868.2635912","type":"proceedings-article","created":{"date-parts":[[2014,11,4]],"date-time":"2014-11-04T21:44:36Z","timestamp":1415137476000},"page":"41-51","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":46,"title":["Feedback generation for performance problems in introductory programming assignments"],"prefix":"10.1145","author":[{"given":"Sumit","family":"Gulwani","sequence":"first","affiliation":[{"name":"Microsoft Research, USA"}]},{"given":"Ivan","family":"Radi\u010dek","sequence":"additional","affiliation":[{"name":"Vienna University of Technology, Austria"}]},{"given":"Florian","family":"Zuleger","sequence":"additional","affiliation":[{"name":"Vienna University of Technology, Austria"}]}],"member":"320","published-online":{"date-parts":[[2014,11,11]]},"reference":[{"key":"e_1_3_2_1_1_1","unstructured":"Making Programs Efficient. http:\/\/pexforfun.com\/makingprogramsefficient.  Making Programs Efficient. http:\/\/pexforfun.com\/makingprogramsefficient."},{"key":"e_1_3_2_1_2_1","unstructured":"Microsoft \u201dRoslyn\u201d CTP. http: \/\/msdn.microsoft.com\/en-us\/vstudio\/roslyn.aspx.  Microsoft \u201dRoslyn\u201d CTP. http: \/\/msdn.microsoft.com\/en-us\/vstudio\/roslyn.aspx."},{"key":"e_1_3_2_1_3_1","unstructured":"Pex for fun. http:\/\/www.pexforfun.com\/.  Pex for fun. http:\/\/www.pexforfun.com\/."},{"key":"e_1_3_2_1_4_1","volume-title":"a system to debug student programs. Artif. Intell., 15(1-2)","author":"Adam A.","year":"1980","unstructured":"A. Adam and J.-P. H. Laurent . LAURA , a system to debug student programs. Artif. Intell., 15(1-2) , 1980 . A. Adam and J.-P. H. Laurent. LAURA, a system to debug student programs. Artif. Intell., 15(1-2), 1980."},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0020-0190(97)00209-3"},{"key":"e_1_3_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/ASE.2009.87"},{"key":"e_1_3_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287681"},{"key":"e_1_3_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1145\/2634273"},{"key":"e_1_3_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/1480881.1480898"},{"key":"e_1_3_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/2635868.2635912"},{"key":"e_1_3_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806596.1806630"},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1328438.1328459"},{"key":"e_1_3_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/1930464.1930480"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/268084.268210"},{"issue":"2","key":"e_1_3_2_1_15_1","volume":"1","author":"Masters K.","year":"2011","unstructured":"K. Masters . A brief guide to understanding MOOCs. The Internet Journal of Medical Education , 1 ( 2 ), 2011 . K. Masters. A brief guide to understanding MOOCs. The Internet Journal of Medical Education, 1(2), 2011.","journal-title":"MOOCs. The Internet Journal of Medical Education"},{"key":"e_1_3_2_1_16_1","volume-title":"USA","author":"Milner R.","year":"1971","unstructured":"R. Milner . An algebraic definition of simulation between programs. Technical report, Stanford, CA , USA , 1971 . R. Milner. An algebraic definition of simulation between programs. Technical report, Stanford, CA, USA, 1971."},{"key":"e_1_3_2_1_17_1","first-page":"3","author":"Murray W. R.","year":"1987","unstructured":"W. R. Murray . Automatic program debugging for intelligent tutoring systems. Computational Intelligence , 3 , 1987 . W. R. Murray. Automatic program debugging for intelligent tutoring systems. Computational Intelligence, 3, 1987.","journal-title":"Computational Intelligence"},{"key":"e_1_3_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491411.2491416"},{"key":"e_1_3_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486862"},{"key":"e_1_3_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/377435.377666"},{"key":"e_1_3_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/2491956.2462195"},{"key":"e_1_3_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/1999747.1999832"},{"key":"e_1_3_2_1_23_1","volume-title":"CAA","author":"Striewe M.","year":"2013","unstructured":"M. Striewe and M. Goedicke . Trace alignment for automated tutoring . In CAA , 2013 . M. Striewe and M. Goedicke. Trace alignment for automated tutoring. In CAA, 2013."},{"key":"e_1_3_2_1_24_1","first-page":"153","volume-title":"TAP","author":"Tillmann N.","year":"2008","unstructured":"N. Tillmann and J. de Halleux . Pex-white box test generation for .NET . In TAP , pages 134\u2013 153 , 2008 . N. Tillmann and J. de Halleux. Pex-white box test generation for .NET. In TAP, pages 134\u2013153, 2008."},{"key":"e_1_3_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.5555\/2486788.2486941"},{"key":"e_1_3_2_1_26_1","first-page":"101","volume-title":"ISAAC","author":"Uno T.","year":"1997","unstructured":"T. Uno . Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs . In ISAAC , pages 92\u2013 101 , 1997 . T. Uno. Algorithms for enumerating all perfect, maximum and maximal matchings in bipartite graphs. In ISAAC, pages 92\u2013101, 1997."},{"key":"e_1_3_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.5555\/2041552.2041574"}],"event":{"name":"SIGSOFT\/FSE'14: 22nd ACM SIGSOFT Symposium on the Foundations of Software Engineering","sponsor":["SIGSOFT ACM Special Interest Group on Software Engineering"],"location":"Hong Kong China","acronym":"SIGSOFT\/FSE'14"},"container-title":["Proceedings of the 22nd ACM SIGSOFT International Symposium on Foundations of Software Engineering"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2635868.2635912","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2635868.2635912","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T19:03:44Z","timestamp":1750273424000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2635868.2635912"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11,11]]},"references-count":27,"alternative-id":["10.1145\/2635868.2635912","10.1145\/2635868"],"URL":"https:\/\/doi.org\/10.1145\/2635868.2635912","relation":{},"subject":[],"published":{"date-parts":[[2014,11,11]]},"assertion":[{"value":"2014-11-11","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}