{"id":"https://openalex.org/W4405182676","doi":"https://doi.org/10.1145/3658644.3691386","title":"Poster: Formally Verified Binary Lifting to P-Code","display_name":"Poster: Formally Verified Binary Lifting to P-Code","publication_year":2024,"publication_date":"2024-12-02","ids":{"openalex":"https://openalex.org/W4405182676","doi":"https://doi.org/10.1145/3658644.3691386"},"language":"en","primary_location":{"id":"doi:10.1145/3658644.3691386","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3658644.3691386","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3658644.3691386","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://dl.acm.org/doi/pdf/10.1145/3658644.3691386","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5011564290","display_name":"Nico Naus","orcid":"https://orcid.org/0000-0003-3442-1543"},"institutions":[{"id":"https://openalex.org/I7876267","display_name":"Open University of the Netherlands","ror":"https://ror.org/018dfmf50","country_code":"NL","type":"education","lineage":["https://openalex.org/I7876267"]},{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["NL","US"],"is_corresponding":true,"raw_author_name":"Nico Naus","raw_affiliation_strings":["Open University & Virginia Tech, Heerlen, Netherlands"],"raw_orcid":"https://orcid.org/0000-0003-3442-1543","affiliations":[{"raw_affiliation_string":"Open University & Virginia Tech, Heerlen, Netherlands","institution_ids":["https://openalex.org/I7876267","https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5067135306","display_name":"Freek Verbeek","orcid":"https://orcid.org/0000-0002-6625-1123"},"institutions":[{"id":"https://openalex.org/I7876267","display_name":"Open University of the Netherlands","ror":"https://ror.org/018dfmf50","country_code":"NL","type":"education","lineage":["https://openalex.org/I7876267"]},{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["NL","US"],"is_corresponding":false,"raw_author_name":"Freek Verbeek","raw_affiliation_strings":["Open University & Virginia Tech, Heerlen, Netherlands"],"raw_orcid":"https://orcid.org/0000-0002-6625-1123","affiliations":[{"raw_affiliation_string":"Open University & Virginia Tech, Heerlen, Netherlands","institution_ids":["https://openalex.org/I7876267","https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5115061042","display_name":"Sagar Atla","orcid":null},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sagar Atla","raw_affiliation_strings":["Virginia Tech, Blacksburg, USA"],"raw_orcid":"https://orcid.org/0009-0000-4086-6173","affiliations":[{"raw_affiliation_string":"Virginia Tech, Blacksburg, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5067528153","display_name":"Binoy Ravindran","orcid":"https://orcid.org/0000-0002-8663-739X"},"institutions":[{"id":"https://openalex.org/I859038795","display_name":"Virginia Tech","ror":"https://ror.org/02smfhw86","country_code":"US","type":"education","lineage":["https://openalex.org/I859038795"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Binoy Ravindran","raw_affiliation_strings":["Virginia Tech, Blacksburg, USA"],"raw_orcid":"https://orcid.org/0000-0002-8663-739X","affiliations":[{"raw_affiliation_string":"Virginia Tech, Blacksburg, USA","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5011564290"],"corresponding_institution_ids":["https://openalex.org/I7876267","https://openalex.org/I859038795"],"apc_list":null,"apc_paid":null,"fwci":0.3311,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.68563379,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":null,"issue":null,"first_page":"4973","last_page":"4975"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11269","display_name":"Algorithms and Data Compression","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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.9980999827384949,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"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/T10142","display_name":"Formal Methods in Verification","score":0.9980000257492065,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6863695979118347},{"id":"https://openalex.org/keywords/binary-number","display_name":"Binary number","score":0.5993534326553345},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.5910496115684509},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.5184321403503418},{"id":"https://openalex.org/keywords/binary-code","display_name":"Binary code","score":0.48047083616256714},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.4138222932815552},{"id":"https://openalex.org/keywords/arithmetic","display_name":"Arithmetic","score":0.27524858713150024},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1613439917564392}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6863695979118347},{"id":"https://openalex.org/C48372109","wikidata":"https://www.wikidata.org/wiki/Q3913","display_name":"Binary number","level":2,"score":0.5993534326553345},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5910496115684509},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5184321403503418},{"id":"https://openalex.org/C63435697","wikidata":"https://www.wikidata.org/wiki/Q864135","display_name":"Binary code","level":3,"score":0.48047083616256714},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.4138222932815552},{"id":"https://openalex.org/C94375191","wikidata":"https://www.wikidata.org/wiki/Q11205","display_name":"Arithmetic","level":1,"score":0.27524858713150024},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1613439917564392},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1145/3658644.3691386","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3658644.3691386","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3658644.3691386","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},{"id":"pmh:oai:research.ou.nl:publications/f42bf041-7c4a-4e73-a2cd-75de800110b5","is_oa":false,"landing_page_url":"https://research.ou.nl/en/publications/f42bf041-7c4a-4e73-a2cd-75de800110b5","pdf_url":null,"source":{"id":"https://openalex.org/S4406922485","display_name":"Open University of the Netherlands Research Portal","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Naus, N, Verbeek, F, Atla, S & Ravindran, B 2024, Poster: Formally Verified Binary Lifting to P-Code. in B Luo, X Liao & J Xu (eds), CCS '24 : Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security. ACM Digital Library, pp. 4973-4975, ACM SIGNAC Conference on Computer and Communications Security, Salt Lake City, United States, 14/10/24. https://doi.org/10.1145/3658644.3691386","raw_type":"info:eu-repo/semantics/publishedVersion"}],"best_oa_location":{"id":"doi:10.1145/3658644.3691386","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3658644.3691386","pdf_url":"https://dl.acm.org/doi/pdf/10.1145/3658644.3691386","source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 2024 on ACM SIGSAC Conference on Computer and Communications Security","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":true,"grobid_xml":false},"content_urls":{"pdf":"https://content.openalex.org/works/W4405182676.pdf"},"referenced_works_count":7,"referenced_works":["https://openalex.org/W2047764386","https://openalex.org/W2345585541","https://openalex.org/W2914982603","https://openalex.org/W3033606455","https://openalex.org/W4238567305","https://openalex.org/W4281659951","https://openalex.org/W6873342648"],"related_works":["https://openalex.org/W2056396287","https://openalex.org/W2134880816","https://openalex.org/W2111298487","https://openalex.org/W2510680828","https://openalex.org/W2055498716","https://openalex.org/W1984130439","https://openalex.org/W4386075138","https://openalex.org/W2371359060","https://openalex.org/W2562873141","https://openalex.org/W2279238589"],"abstract_inverted_index":{"Analysis":[0],"of":[1,25,37,82,85,104,178],"binary":[2],"software":[3,9],"plays":[4],"a":[5,34,119,169],"critical":[6],"role":[7],"in":[8,102,159,196],"security.":[10],"Reverse":[11],"engineers":[12],"analyze":[13],"binaries":[14],"to":[15,98,127,143,149,200],"discover":[16],"vulnerabilities,":[17],"patch":[18],"legacy":[19],"software,":[20],"and":[21,39,53,135,162,181],"detect":[22],"malware.":[23],"Most":[24],"the":[26,63,80,94,99,105,123,133,163,189,201],"reverse":[27,51,197],"engineering":[28,52,198],"tools":[29,60],"have":[30,55],"been":[31],"developed":[32],"from":[33,96],"practical":[35],"point":[36],"view,":[38],"do":[40],"not":[41,68],"provide":[42,195],"any":[43],"guarantees":[44,174,191],"with":[45],"their":[46],"results.":[47],"Recently,":[48],"formally":[49],"verified":[50],"decompilation":[54,88],"gained":[56],"traction.":[57],"These":[58],"formal":[59,179,193],"are":[61,117],"for":[62,71],"most":[64,106],"part":[65,84],"proof-of-concept":[66],"systems":[67],"yet":[69],"suitable":[70],"real-world":[72],"reverse-engineering":[73],"tasks.":[74],"In":[75],"this":[76],"poster,":[77],"we":[78,172],"explore":[79],"idea":[81],"formalizing":[83],"an":[86],"existing":[87],"tool":[89],"instead.":[90],"We":[91,116,138],"focus":[92],"on":[93],"lifting":[95,164,182],"assembly":[97,134],"IR":[100],"P-Code":[101,136,161],"one":[103],"popular":[107],"decompilers,":[108],"Ghidra.":[109],"This":[110,153,186],"step":[111],"occurs":[112],"immediately":[113],"after":[114],"disassembly.":[115],"developing":[118],"proof":[120],"system":[121,177],"inside":[122],"Isabelle":[124],"theorem":[125,170],"prover,":[126,171],"automatically":[128],"prove":[129],"semantical":[130],"equivalence":[131],"between":[132],"instructions.":[137],"leverage":[139],"machine-learned":[140],"x86-64":[141],"semantics,":[142],"stay":[144],"as":[145,147],"close":[146],"possible":[148],"actual":[150],"CPU":[151],"behavior.":[152],"approach":[154],"has":[155],"uncovered":[156],"several":[157],"shortcomings":[158],"Ghidra's":[160],"it":[165],"performs.":[166],"By":[167],"using":[168],"obtain":[173],"that":[175,192],"our":[176],"semantics":[180],"is":[183],"internally":[184],"consistent.":[185],"work":[187],"brings":[188],"powerful":[190],"methods":[194],"research":[199],"real":[202],"world.":[203]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-03-27T05:58:40.876381","created_date":"2025-10-10T00:00:00"}