{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:19:26Z","timestamp":1750306766371,"version":"3.41.0"},"reference-count":39,"publisher":"Association for Computing Machinery (ACM)","issue":"2","license":[{"start":{"date-parts":[[2013,7,1]],"date-time":"2013-07-01T00:00:00Z","timestamp":1372636800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/501100000266","name":"Engineering and Physical Sciences Research Council","doi-asserted-by":"publisher","award":["EP\/F01044, EP\/F059442"],"award-info":[{"award-number":["EP\/F01044, EP\/F059442"]}],"id":[{"id":"10.13039\/501100000266","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100007656","name":"Loyola University Chicago","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100007656","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000143","name":"Division of Computing and Communication Foundations","doi-asserted-by":"publisher","award":["CCF 0916081"],"award-info":[{"award-number":["CCF 0916081"]}],"id":[{"id":"10.13039\/100000143","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Program. Lang. Syst."],"published-print":{"date-parts":[[2013,7]]},"abstract":"<jats:p>\n            Several authors have found evidence of large dependence clusters in the source code of a diverse range of systems, domains, and programming languages. This raises the question of how we might efficiently locate the fragments of code that give rise to large dependence clusters. We introduce an algorithm for the identification of\n            <jats:italic>linchpin<\/jats:italic>\n            vertices, which hold together large dependence clusters, and prove correctness properties for the algorithm\u2019s primary innovations. We also report the results of an empirical study concerning the reduction in analysis time that our algorithm yields over its predecessor using a collection of 38 programs containing almost half a million lines of code. Our empirical findings indicate improvements of almost two orders of magnitude, making it possible to process larger programs for which it would have previously been impractical.\n          <\/jats:p>","DOI":"10.1145\/2491522.2491524","type":"journal-article","created":{"date-parts":[[2013,7,30]],"date-time":"2013-07-30T13:35:22Z","timestamp":1375191322000},"page":"1-35","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":2,"title":["Efficient Identification of Linchpin Vertices in Dependence Clusters"],"prefix":"10.1145","volume":"35","author":[{"given":"David","family":"Binkley","sequence":"first","affiliation":[{"name":"Loyola University Maryland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Nicolas","family":"Gold","sequence":"additional","affiliation":[{"name":"University College London"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Harman","sequence":"additional","affiliation":[{"name":"University College London"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Syed","family":"Islam","sequence":"additional","affiliation":[{"name":"University College London"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jens","family":"Krinke","sequence":"additional","affiliation":[{"name":"University College London"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Zheng","family":"Li","sequence":"additional","affiliation":[{"name":"Beijing University of Chemical Technology"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1985793.1985898"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.5555\/827253.827735"},{"volume-title":"Proceedings of the 23rd IEEE International Conference on Software Maintenance (ICSM\u201907)","author":"Besz\u00e9des","key":"e_1_2_1_4_1","unstructured":"Besz\u00e9des, \u00c1., Gergely, T., J\u00e1sz, J., Toth, G., Gyim\u00f3thy, T., and Rajlich, V. 2007. Computation of static execute after relation with applications to software maintenance. In Proceedings of the 23rd IEEE International Conference on Software Maintenance (ICSM\u201907). IEEE, 295--304."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2005.58"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2009.18"},{"volume-title":"Proceedings of the 4th International ERCIM Workshop on Software Evolution and Evolvability (Evol\u201908)","author":"Binkley D.","key":"e_1_2_1_7_1","unstructured":"Binkley, D., Gold, N., Harman, M., Li, Z., Mahdavi, K., and Wegener, J. 2008. Dependence anti patterns. In Proceedings of the 4th International ERCIM Workshop on Software Evolution and Evolvability (Evol\u201908). 25--34."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2009.03.038"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/176454.176473"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1109\/FOSE.2007.27"},{"volume-title":"Dagstuhl Seminar Proceedings, Number 05451","author":"Black S.","key":"e_1_2_1_11_1","unstructured":"Black, S., Counsell, S., Hall, T., and Wernick, P. 2006. Using program slicing to identify faults in software. In Beyond Program Slicing, D. W. Binkley, M. Harman, and J. Krinke Eds., Dagstuhl Seminar Proceedings, Number 05451, Internationales Begegnungs- und Forschungszentrum f\u00fcr Informatik (IBFI), Schloss Dagstuhl, Germany."},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1109\/SEAA.2009.94"},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.5555\/511193.511196"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.5555\/876902.881283"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1558607.1558658"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2003.1183929"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/277650.277667"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1109\/32.83912"},{"key":"e_1_2_1_19_1","unstructured":"Grammatech Inc. 2002. The codesurfer slicing system."},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1002\/smr.533"},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1596527.1596528"},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1145\/77606.77608"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1879211.1879227"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1145\/1806672.1806683"},{"key":"e_1_2_1_25_1","doi-asserted-by":"publisher","DOI":"10.1016\/0020-0190(88)90054-3"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.5555\/951949.952188"},{"volume-title":"Proceedings of the Arrowhead Conference on Human Complex Systems.","author":"Madey G.","key":"e_1_2_1_27_1","unstructured":"Madey, G., Freeh, V., Tynan, R., and Hoffman, C. 2003. An analysis of open source software development using social network theory and agent-based modeling. In Proceedings of the Arrowhead Conference on Human Complex Systems."},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2006.31"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2010.26"},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/1117454.1117460"},{"key":"e_1_2_1_31_1","unstructured":"Reps T. and Yang W. 1988. The semantics of program slicing. Tech. rep. 777 University of Wisconsin."},{"key":"e_1_2_1_32_1","doi-asserted-by":"publisher","DOI":"10.1145\/222124.222138"},{"key":"e_1_2_1_33_1","doi-asserted-by":"publisher","DOI":"10.1145\/199448.199462"},{"volume-title":"Software Engineering 2007 - Beitr\u00e4ge zu den Workshops, Fachtagung des GIFachbereichs Softwaretechnik, W.-G","author":"Savernik L.","key":"e_1_2_1_34_1","unstructured":"Savernik, L. 2007. Entwicklung eines automatischen Verfahrens zur Aufl\u00f6sung statischer zyklischer Abh\u00e4ngigkeiten in Softwaresystemen (in German). In Software Engineering 2007 - Beitr\u00e4ge zu den Workshops, Fachtagung des GIFachbereichs Softwaretechnik, W.-G. Bleek, H. Schwentner, and H. Z\u00fcllighoven Eds., LNI Series, vol. 106. GI, 357--360."},{"key":"e_1_2_1_35_1","unstructured":"Sharir M. and Pnueli A. 1981. Two Approaches to Interprocedural Data Flow Analysis. Prentice-Hall Englewood Cliffs NJ."},{"key":"e_1_2_1_36_1","doi-asserted-by":"publisher","DOI":"10.1109\/CSMR.2007.53"},{"key":"e_1_2_1_37_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2003.1205178"},{"key":"e_1_2_1_38_1","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.1984.5010248"},{"key":"e_1_2_1_39_1","doi-asserted-by":"publisher","DOI":"10.1145\/301618.301647"},{"key":"e_1_2_1_40_1","doi-asserted-by":"publisher","DOI":"10.1145\/1572272.1572296"}],"container-title":["ACM Transactions on Programming Languages and Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491522.2491524","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2491522.2491524","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:28:50Z","timestamp":1750231730000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2491522.2491524"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013,7]]},"references-count":39,"journal-issue":{"issue":"2","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["10.1145\/2491522.2491524"],"URL":"https:\/\/doi.org\/10.1145\/2491522.2491524","relation":{},"ISSN":["0164-0925","1558-4593"],"issn-type":[{"type":"print","value":"0164-0925"},{"type":"electronic","value":"1558-4593"}],"subject":[],"published":{"date-parts":[[2013,7]]},"assertion":[{"value":"2012-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-04-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-07-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}