{"id":"https://openalex.org/W2602804099","doi":"https://doi.org/10.1145/3052973.3052974","title":"BinSequence","display_name":"BinSequence","publication_year":2017,"publication_date":"2017-03-31","ids":{"openalex":"https://openalex.org/W2602804099","doi":"https://doi.org/10.1145/3052973.3052974","mag":"2602804099"},"language":"en","primary_location":{"id":"doi:10.1145/3052973.3052974","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3052973.3052974","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security","raw_type":"proceedings-article"},"type":"article","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/A5101998852","display_name":"He Huang","orcid":"https://orcid.org/0000-0003-2768-6607"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":true,"raw_author_name":"He Huang","raw_affiliation_strings":["Concordia University, Montreal, PQ, Canada"],"affiliations":[{"raw_affiliation_string":"Concordia University, Montreal, PQ, Canada","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5085765243","display_name":"Amr Youssef","orcid":"https://orcid.org/0000-0002-4284-8646"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Amr M. Youssef","raw_affiliation_strings":["Concordia University, Montreal, PQ, Canada"],"affiliations":[{"raw_affiliation_string":"Concordia University, Montreal, PQ, Canada","institution_ids":["https://openalex.org/I60158472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5028605138","display_name":"Mourad Debbabi","orcid":"https://orcid.org/0000-0003-3015-3043"},"institutions":[{"id":"https://openalex.org/I60158472","display_name":"Concordia University","ror":"https://ror.org/0420zvk78","country_code":"CA","type":"education","lineage":["https://openalex.org/I60158472"]}],"countries":["CA"],"is_corresponding":false,"raw_author_name":"Mourad Debbabi","raw_affiliation_strings":["Concordia University, Montreal, PQ, Canada"],"affiliations":[{"raw_affiliation_string":"Concordia University, Montreal, PQ, Canada","institution_ids":["https://openalex.org/I60158472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5101998852"],"corresponding_institution_ids":["https://openalex.org/I60158472"],"apc_list":null,"apc_paid":null,"fwci":9.1165,"has_fulltext":false,"cited_by_count":69,"citation_normalized_percentile":{"value":0.9779655,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"155","last_page":"166"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10260","display_name":"Software Engineering Research","score":0.9998999834060669,"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":0.9998999834060669,"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/T11241","display_name":"Advanced Malware Detection Techniques","score":0.9995999932289124,"subfield":{"id":"https://openalex.org/subfields/1711","display_name":"Signal Processing"},"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/T10743","display_name":"Software Testing and Debugging Techniques","score":0.9983000159263611,"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/computer-science","display_name":"Computer science","score":0.8612139821052551},{"id":"https://openalex.org/keywords/longest-common-subsequence-problem","display_name":"Longest common subsequence problem","score":0.5896051526069641},{"id":"https://openalex.org/keywords/compiler","display_name":"Compiler","score":0.5856041312217712},{"id":"https://openalex.org/keywords/block","display_name":"Block (permutation group theory)","score":0.5109159350395203},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.5094817280769348},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.49721530079841614},{"id":"https://openalex.org/keywords/reuse","display_name":"Reuse","score":0.465051531791687},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.4387809634208679},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.4372170567512512},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.432748019695282},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.42498844861984253},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.3711150586605072},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.2739116847515106}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8612139821052551},{"id":"https://openalex.org/C120098539","wikidata":"https://www.wikidata.org/wiki/Q141001","display_name":"Longest common subsequence problem","level":2,"score":0.5896051526069641},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.5856041312217712},{"id":"https://openalex.org/C2777210771","wikidata":"https://www.wikidata.org/wiki/Q4927124","display_name":"Block (permutation group theory)","level":2,"score":0.5109159350395203},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.5094817280769348},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.49721530079841614},{"id":"https://openalex.org/C206588197","wikidata":"https://www.wikidata.org/wiki/Q846574","display_name":"Reuse","level":2,"score":0.465051531791687},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.4387809634208679},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.4372170567512512},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.432748019695282},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.42498844861984253},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3711150586605072},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.2739116847515106},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","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/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0},{"id":"https://openalex.org/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3052973.3052974","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3052973.3052974","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2017 ACM on Asia Conference on Computer and Communications Security","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[{"id":"https://openalex.org/F4320330045","display_name":"Minist\u00e8re de la D\u00e9fense Nationale","ror":"https://ror.org/035rreb34"},{"id":"https://openalex.org/F4320334593","display_name":"Natural Sciences and Engineering Research Council of Canada","ror":"https://ror.org/01h531d29"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":17,"referenced_works":["https://openalex.org/W1507039213","https://openalex.org/W1604459715","https://openalex.org/W1690253345","https://openalex.org/W1736726159","https://openalex.org/W1940252083","https://openalex.org/W2009614414","https://openalex.org/W2012604743","https://openalex.org/W2029491280","https://openalex.org/W2041839827","https://openalex.org/W2048693719","https://openalex.org/W2082594235","https://openalex.org/W2098262260","https://openalex.org/W2112725702","https://openalex.org/W2141461755","https://openalex.org/W2145065594","https://openalex.org/W3105656675","https://openalex.org/W4301005547"],"related_works":["https://openalex.org/W2192862863","https://openalex.org/W1497385637","https://openalex.org/W2369288331","https://openalex.org/W2044422526","https://openalex.org/W2519339279","https://openalex.org/W2467097043","https://openalex.org/W2086733238","https://openalex.org/W2004605222","https://openalex.org/W2104078272","https://openalex.org/W1512248002"],"abstract_inverted_index":{"Code":[0],"reuse":[1],"detection":[2],"is":[3,154],"a":[4,62,129,144],"key":[5],"technique":[6],"in":[7],"reverse":[8],"engineering.":[9],"However,":[10],"existing":[11],"source":[12],"code":[13,39,147],"similarity":[14,161],"comparison":[15],"techniques":[16],"are":[17],"not":[18],"applicable":[19,109],"to":[20,33,66,110],"binary":[21],"code.":[22],"Moreover,":[23],"compilers":[24,49],"have":[25],"made":[26],"this":[27,58],"problem":[28],"even":[29,50],"more":[30],"difficult":[31],"due":[32],"the":[34,48,53,81,88,99,124],"fact":[35],"that":[36,142],"different":[37],"assembly":[38,146,164],"and":[40,92,133,156,184],"control":[41],"flow":[42],"structures":[43],"can":[44,157],"be":[45],"generated":[46],"by":[47,79],"when":[51],"implementing":[52],"same":[54],"functionality.":[55],"To":[56,105],"address":[57],"problem,":[59],"we":[60,114,127],"present":[61,174],"fuzzy":[63],"matching":[64],"approach":[65,108],"compare":[67],"two":[68],"functions.":[69],"We":[70,96,172],"first":[71],"obtain":[72],"an":[73,116,167],"initial":[74],"mapping":[75,101],"between":[76],"basic":[77,89],"blocks":[78],"leveraging":[80],"concept":[82],"of":[83,151,163,169],"longest":[84],"common":[85],"subsequence":[86],"on":[87,123],"block":[90],"level":[91],"execution":[93],"path":[94],"level.":[95],"then":[97],"extend":[98],"achieved":[100],"using":[102,120],"neighborhood":[103],"exploration.":[104],"make":[106],"our":[107],"large":[111,145],"data":[112],"sets,":[113],"designed":[115],"effective":[117],"filtering":[118],"process":[119],"Minhashing.":[121],"Based":[122],"proposed":[125],"approach,":[126],"implemented":[128],"tool":[130],"named":[131],"BinSequence":[132,153],"conducted":[134],"extensive":[135],"experiments":[136],"with":[137,149,166],"it.":[138],"Our":[139],"results":[140],"show":[141],"given":[143],"repository":[148],"millions":[150],"functions,":[152],"efficient":[155],"attain":[158],"high":[159],"quality":[160],"ranking":[162],"functions":[165],"accuracy":[168],"above":[170],"90%.":[171],"also":[173],"several":[175],"practical":[176],"use":[177],"cases":[178],"including":[179],"patch":[180],"analysis,":[181],"malware":[182],"analysis":[183],"bug":[185],"search.":[186]},"counts_by_year":[{"year":2025,"cited_by_count":9},{"year":2024,"cited_by_count":14},{"year":2023,"cited_by_count":10},{"year":2022,"cited_by_count":10},{"year":2021,"cited_by_count":8},{"year":2020,"cited_by_count":8},{"year":2019,"cited_by_count":6},{"year":2018,"cited_by_count":2},{"year":2017,"cited_by_count":2}],"updated_date":"2026-04-02T15:55:50.835912","created_date":"2017-04-07T00:00:00"}
