{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,7]],"date-time":"2024-09-07T12:59:53Z","timestamp":1725713993037},"reference-count":25,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1109\/scam.2009.18","type":"proceedings-article","created":{"date-parts":[[2009,10,7]],"date-time":"2009-10-07T12:03:18Z","timestamp":1254916998000},"page":"89-98","source":"Crossref","is-referenced-by-count":12,"title":["Identifying 'Linchpin Vertices' That Cause Large Dependence Clusters"],"prefix":"10.1109","author":[{"given":"David","family":"Binkley","sequence":"first","affiliation":[]},{"given":"Mark","family":"Harman","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"19","doi-asserted-by":"publisher","DOI":"10.1145\/277631.277638"},{"key":"17","doi-asserted-by":"publisher","DOI":"10.1145\/77606.77608"},{"journal-title":"Program Flow Analysis Theory and Applications","year":"1981","key":"18"},{"key":"15","doi-asserted-by":"publisher","DOI":"10.1145\/1287624.1287647"},{"key":"16","doi-asserted-by":"publisher","DOI":"10.1016\/j.infsof.2005.06.001"},{"year":"2002","key":"13"},{"key":"14","doi-asserted-by":"publisher","DOI":"10.1145\/1596527.1596528"},{"key":"11","article-title":"crafting a compiler","author":"fischer","year":"1988","journal-title":"Benjamin\/Cummings Series in Computer Science"},{"key":"12","doi-asserted-by":"publisher","DOI":"10.1109\/32.83912"},{"key":"21","doi-asserted-by":"publisher","DOI":"10.1109\/ICSM.2003.1235437"},{"key":"20","article-title":"unsupervised link discovery in multirelational data via rarity analysis","author":"lin","year":"2003","journal-title":"ICDM International Conference on Data Mining"},{"key":"22","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2006.31"},{"key":"23","doi-asserted-by":"publisher","DOI":"10.1145\/1117454.1117460"},{"key":"24","first-page":"389","article-title":"solving demand versions of interprocedural analysis problems","author":"reps","year":"1994","journal-title":"Compiler Construction 5th International Conference volume 786 of Lecture Notes in Computer Science"},{"key":"25","doi-asserted-by":"publisher","DOI":"10.1109\/TSE.2003.1205178"},{"key":"3","doi-asserted-by":"publisher","DOI":"10.1109\/ASEW.2008.4686318"},{"year":"0","key":"2"},{"key":"10","doi-asserted-by":"publisher","DOI":"10.1145\/24039.24041"},{"year":"0","key":"1"},{"key":"7","doi-asserted-by":"publisher","DOI":"10.1002\/smr.233"},{"key":"6","doi-asserted-by":"publisher","DOI":"10.1109\/SCAM.2006.7"},{"key":"5","doi-asserted-by":"publisher","DOI":"10.1016\/j.jss.2009.03.038"},{"year":"0","key":"4"},{"year":"0","key":"9"},{"key":"8","first-page":"50","article-title":"program slice browser","author":"deng","year":"2001","journal-title":"9th IEEE International Workshop on Program Compren-hesion"}],"event":{"name":"2009 Ninth IEEE International Working Conference on Source Code Analysis and Manipulation","start":{"date-parts":[[2009,9,20]]},"location":"Edmonton, Alberta, Canada","end":{"date-parts":[[2009,9,21]]}},"container-title":["2009 Ninth IEEE International Working Conference on Source Code Analysis and Manipulation"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/5279860\/5279861\/05279963.pdf?arnumber=5279963","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2017,3,18]],"date-time":"2017-03-18T22:58:08Z","timestamp":1489877888000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/5279963\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"references-count":25,"URL":"https:\/\/doi.org\/10.1109\/scam.2009.18","relation":{},"subject":[],"published":{"date-parts":[[2009]]}}}