{"id":"https://openalex.org/W2096491586","doi":"https://doi.org/10.1109/wcre.2001.957835","title":"Identifying similar code with program dependence graphs","display_name":"Identifying similar code with program dependence graphs","publication_year":2002,"publication_date":"2002-11-13","ids":{"openalex":"https://openalex.org/W2096491586","doi":"https://doi.org/10.1109/wcre.2001.957835","mag":"2096491586"},"language":"en","primary_location":{"id":"doi:10.1109/wcre.2001.957835","doi":"https://doi.org/10.1109/wcre.2001.957835","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcre.2001.957835","pdf_url":null,"source":{"id":"https://openalex.org/S4210227819","display_name":"Working Conference on Reverse Engineering (WCRE)","issn_l":"1095-1350","issn":["1095-1350","2375-5369"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings Eighth Working Conference on Reverse Engineering","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5056241360","display_name":"Jens Krinke","orcid":"https://orcid.org/0000-0003-1009-2861","observed_orcids":["https://orcid.org/0000-0003-1009-2861"]},"institutions":[{"id":"https://openalex.org/I186354981","display_name":"University of Passau","ror":"https://ror.org/05ydjnb78","country_code":"DE","type":"education","lineage":["https://openalex.org/I186354981"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"J. Krinke","raw_affiliation_strings":["Lehrstuhl Softwaresysteme, Universit\u00e4t Passau, Passau, Germany","Lehrstuhl Softwaresysteme, Passau Univ., Germany"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Lehrstuhl Softwaresysteme, Universit\u00e4t Passau, Passau, Germany","institution_ids":["https://openalex.org/I186354981"]},{"raw_affiliation_string":"Lehrstuhl Softwaresysteme, Passau Univ., Germany","institution_ids":["https://openalex.org/I186354981"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5056241360"],"corresponding_institution_ids":["https://openalex.org/I186354981"],"apc_list":null,"apc_paid":null,"fwci":12.8747,"has_fulltext":false,"cited_by_count":633,"citation_normalized_percentile":{"value":0.99141631,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":99,"max":100},"biblio":{"volume":null,"issue":null,"first_page":"301","last_page":"309"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":1.0,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12292","display_name":"Graph Theory and Algorithms","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10126","display_name":"Logic, programming, and type systems","score":0.0,"subfield":{"id":"https://openalex.org/subfields/1712","display_name":"Software"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/program-dependence-graph","display_name":"program dependence graph","score":0.9729999899864197},{"id":"https://openalex.org/keywords/subgraph-isomorphism","display_name":"subgraph isomorphism","score":0.7379999756813049},{"id":"https://openalex.org/keywords/data-flow","display_name":"data flow","score":0.5759999752044678},{"id":"https://openalex.org/keywords/programming-language-semantics","display_name":"program semantics","score":0.4429999887943268},{"id":"https://openalex.org/keywords/code-similarity","display_name":"code similarity","score":0.3959999978542328},{"id":"https://openalex.org/keywords/np-hardness","display_name":"NP-hardness","score":0.39100000262260437}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.774556577205658},{"id":"https://openalex.org/C184337299","wikidata":"https://www.wikidata.org/wiki/Q1437428","display_name":"Semantics (computer science)","level":2,"score":0.582289457321167},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.552688717842102},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5361008644104004},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5161648392677307},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5130180716514587},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.44737210869789124},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.4419773519039154},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.4243661165237427},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.31745314598083496},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/wcre.2001.957835","doi":"https://doi.org/10.1109/wcre.2001.957835","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wcre.2001.957835","pdf_url":null,"source":{"id":"https://openalex.org/S4210227819","display_name":"Working Conference on Reverse Engineering (WCRE)","issn_l":"1095-1350","issn":["1095-1350","2375-5369"],"is_oa":false,"is_in_doaj":false,"is_core":true,"listed_in":["cwts-core","jufo-1"],"host_organization":"https://openalex.org/P4310319808","host_organization_name":"Institute of Electrical and Electronics Engineers","host_organization_lineage":["https://openalex.org/P4310319808"],"host_organization_lineage_names":["Institute of Electrical and Electronics Engineers"],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings Eighth Working Conference on Reverse Engineering","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.23.4224","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.23.4224","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.infosun.fmi.uni-passau.de/st/papers/ast01/ast01.ps.gz","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.9.6778","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.9.6778","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.fernuni-hagen.de/ST/publications/ast01.pdf","raw_type":"text"},{"id":"pmh:oai:eprints.ucl.ac.uk.OAI2:191949","doi":null,"is_oa":false,"landing_page_url":"http://discovery.ucl.ac.uk/191949/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400024","display_name":"UCL Discovery (University College London)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I45129253","host_organization_name":"University College London","host_organization_lineage":["https://openalex.org/I45129253"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"In: Burd, E and Aiken, P and Koschke, R, (eds.) EIGHTH WORKING CONFERENCE ON REVERSE ENGINEERING, PROCEEDINGS. (pp. 301 - 309). IEEE COMPUTER SOC (2001)","raw_type":"Proceedings paper"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1593203335","https://openalex.org/W1698439592","https://openalex.org/W1966403183","https://openalex.org/W2060613917","https://openalex.org/W2064625489","https://openalex.org/W2092483417","https://openalex.org/W2109943392","https://openalex.org/W2128698639","https://openalex.org/W2146483864","https://openalex.org/W2157532207","https://openalex.org/W2160708437","https://openalex.org/W2162992371","https://openalex.org/W2163840964","https://openalex.org/W2169044454"],"related_works":["https://openalex.org/W989526527","https://openalex.org/W2523849919","https://openalex.org/W7119445794","https://openalex.org/W1555339952","https://openalex.org/W2493322072","https://openalex.org/W2567134703","https://openalex.org/W2083278176","https://openalex.org/W1529878801","https://openalex.org/W7096690873","https://openalex.org/W1977328072"],"abstract_inverted_index":{"We":[0],"present":[1],"an":[2,44],"approach":[3,20,61,76],"to":[4],"identifying":[5],"similar":[6,13],"code":[7],"in":[8,15,65],"programs":[9,36],"based":[10],"on":[11,23],"finding":[12],"subgraphs":[14],"attributed":[16],"directed":[17],"graphs.":[18],"This":[19],"is":[21,53,62,77],"used":[22],"program":[24],"dependence":[25],"graphs":[26],"and":[27,58,79],"therefore":[28],"considers":[29],"not":[30],"only":[31],"the":[32,39,47,75,85,90],"syntactic":[33],"structure":[34],"of":[35,46,69,89],"but":[37],"also":[38],"data":[40],"flow":[41],"within":[42],"(as":[43],"abstraction":[45],"semantics).":[48],"As":[49],"a":[50],"result,":[51],"there":[52],"no":[54],"tradeoff":[55],"between":[56],"precision":[57],"recall;":[59],"our":[60,70],"very":[63,81],"good":[64,82],"both.":[66],"An":[67],"evaluation":[68],"prototype":[71],"implementation":[72],"shows":[73],"that":[74],"feasible":[78],"gives":[80],"results":[83],"despite":[84],"non":[86],"polynomial":[87],"complexity":[88],"problem.":[91]},"counts_by_year":[{"year":2026,"cited_by_count":9},{"year":2025,"cited_by_count":13},{"year":2024,"cited_by_count":14},{"year":2023,"cited_by_count":23},{"year":2022,"cited_by_count":21},{"year":2021,"cited_by_count":30},{"year":2020,"cited_by_count":34},{"year":2019,"cited_by_count":30},{"year":2018,"cited_by_count":32},{"year":2017,"cited_by_count":29},{"year":2016,"cited_by_count":41},{"year":2015,"cited_by_count":39},{"year":2014,"cited_by_count":36},{"year":2013,"cited_by_count":42},{"year":2012,"cited_by_count":37}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}