{"id":"https://openalex.org/W3017122865","doi":"https://doi.org/10.1007/978-3-030-45237-7_6","title":"Highly Automated Formal Proofs over Memory Usage of Assembly Code","display_name":"Highly Automated Formal Proofs over Memory Usage of Assembly Code","publication_year":2020,"publication_date":"2020-01-01","ids":{"openalex":"https://openalex.org/W3017122865","doi":"https://doi.org/10.1007/978-3-030-45237-7_6","mag":"3017122865"},"language":"en","primary_location":{"id":"doi:10.1007/978-3-030-45237-7_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-45237-7_6","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-45237-7_6.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"hybrid","oa_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-45237-7_6.pdf","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","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":true,"raw_author_name":"Freek Verbeek","raw_affiliation_strings":["Open University of The Netherlands, Heerlen, The Netherlands","Virginia Tech, Blacksburg, VA, USA","Virginia Tech, Blacksburg, USA"],"raw_orcid":"https://orcid.org/0000-0002-6625-1123","affiliations":[{"raw_affiliation_string":"Open University of The Netherlands, Heerlen, The Netherlands","institution_ids":["https://openalex.org/I7876267"]},{"raw_affiliation_string":"Virginia Tech, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"Virginia Tech, Blacksburg, USA","institution_ids":["https://openalex.org/I859038795"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5072984588","display_name":"Joshua A. Bockenek","orcid":"https://orcid.org/0000-0002-1055-8003"},"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":"Joshua A. Bockenek","raw_affiliation_strings":["Virginia Tech, Blacksburg, VA, USA","Virginia Tech, Blacksburg, USA"],"raw_orcid":"https://orcid.org/0000-0002-1055-8003","affiliations":[{"raw_affiliation_string":"Virginia Tech, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]},{"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, VA, USA","Virginia Tech, Blacksburg, USA"],"raw_orcid":"https://orcid.org/0000-0002-8663-739X","affiliations":[{"raw_affiliation_string":"Virginia Tech, Blacksburg, VA, USA","institution_ids":["https://openalex.org/I859038795"]},{"raw_affiliation_string":"Virginia Tech, Blacksburg, USA","institution_ids":["https://openalex.org/I859038795"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5067135306"],"corresponding_institution_ids":["https://openalex.org/I7876267","https://openalex.org/I859038795"],"apc_list":{"value":5000,"currency":"EUR","value_usd":5392},"apc_paid":{"value":5000,"currency":"EUR","value_usd":5392},"fwci":null,"has_fulltext":true,"cited_by_count":3,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"98","last_page":"117"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11424","display_name":"Security and Verification in Computing","score":0.9995999932289124,"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/T11424","display_name":"Security and Verification in Computing","score":0.9995999932289124,"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.9976999759674072,"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.995199978351593,"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.8633780479431152},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.6408380270004272},{"id":"https://openalex.org/keywords/mathematical-proof","display_name":"Mathematical proof","score":0.6397712230682373},{"id":"https://openalex.org/keywords/control-flow","display_name":"Control flow","score":0.5131831765174866},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4497997462749481},{"id":"https://openalex.org/keywords/formal-verification","display_name":"Formal verification","score":0.43234026432037354},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.419596403837204}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8633780479431152},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.6408380270004272},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.6397712230682373},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.5131831765174866},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4497997462749481},{"id":"https://openalex.org/C111498074","wikidata":"https://www.wikidata.org/wiki/Q173326","display_name":"Formal verification","level":2,"score":0.43234026432037354},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.419596403837204},{"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}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1007/978-3-030-45237-7_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-45237-7_6","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-45237-7_6.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},{"id":"pmh:oai:pubmedcentral.nih.gov:7480695","is_oa":true,"landing_page_url":"https://www.ncbi.nlm.nih.gov/pmc/articles/7480695","pdf_url":null,"source":{"id":"https://openalex.org/S2764455111","display_name":"PubMed Central","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1299303238","host_organization_name":"National Institutes of Health","host_organization_lineage":["https://openalex.org/I1299303238"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Tools and Algorithms for the Construction and Analysis of Systems","raw_type":"Text"},{"id":"pmh:oai:research.ou.nl:publications/d69f26b7-9b07-46cd-922a-ed11d45c2cb6","is_oa":true,"landing_page_url":"https://hdl.handle.net/1820/d69f26b7-9b07-46cd-922a-ed11d45c2cb6","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Verbeek, F, Bockenek, J & Ravindran, B 2020, Highly Automated Formal Proofs over Memory Usage of Assembly Code. in A Biere & D Parker (eds), Tools and Algorithms for the Construction and Analysis of Systems : 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25\u201330, 2020, Proceedings, Part II. Springer Open, Cham, Lecture Notes in Computer Science (LNCS) series, vol. 12079, pp. 98-117, (Cancelled) 26th International Conference on Tools and Algorithms for the Construction and Analysis of Systems, Dublin, Ireland, 25/04/20. https://doi.org/10.1007/978-3-030-45237-7_6","raw_type":"info:eu-repo/semantics/publishedVersion"},{"id":"pmh:ou:oai:research.ou.nl:publications/d69f26b7-9b07-46cd-922a-ed11d45c2cb6","is_oa":true,"landing_page_url":"https://research.ou.nl/en/publications/d69f26b7-9b07-46cd-922a-ed11d45c2cb6","pdf_url":null,"source":{"id":"https://openalex.org/S4306401843","display_name":"Data Archiving and Networked Services (DANS)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1322597698","host_organization_name":"Royal Netherlands Academy of Arts and Sciences","host_organization_lineage":["https://openalex.org/I1322597698"],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Tools and Algorithms for the Construction and Analysis of Systems: 26th International Conference, TACAS 2020, Held as Part of the European Joint Conferences on Theory and Practice of Software, ETAPS 2020, Dublin, Ireland, April 25\u201330, 2020, Proceedings, Part II, 98 - 117","raw_type":"info:eu-repo/semantics/conferencepaper"}],"best_oa_location":{"id":"doi:10.1007/978-3-030-45237-7_6","is_oa":true,"landing_page_url":"https://doi.org/10.1007/978-3-030-45237-7_6","pdf_url":"https://link.springer.com/content/pdf/10.1007%2F978-3-030-45237-7_6.pdf","source":{"id":"https://openalex.org/S106296714","display_name":"Lecture notes in computer science","issn_l":"0302-9743","issn":["0302-9743","1611-3349"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319900","host_organization_name":"Springer Science+Business Media","host_organization_lineage":["https://openalex.org/P4310319900","https://openalex.org/P4310319965"],"host_organization_lineage_names":["Springer Science+Business Media","Springer Nature"],"type":"book series"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Lecture Notes in Computer Science","raw_type":"book-chapter"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W3017122865.pdf","grobid_xml":"https://content.openalex.org/works/W3017122865.grobid-xml"},"referenced_works_count":65,"referenced_works":["https://openalex.org/W17195072","https://openalex.org/W81956812","https://openalex.org/W147835410","https://openalex.org/W1480909796","https://openalex.org/W1484808823","https://openalex.org/W1495368328","https://openalex.org/W1515278398","https://openalex.org/W1550115315","https://openalex.org/W1558972950","https://openalex.org/W1568717897","https://openalex.org/W1618673950","https://openalex.org/W1823377586","https://openalex.org/W1863850585","https://openalex.org/W1893552753","https://openalex.org/W1903577715","https://openalex.org/W1924086464","https://openalex.org/W1943070836","https://openalex.org/W1965348053","https://openalex.org/W1986453394","https://openalex.org/W2006731094","https://openalex.org/W2034711041","https://openalex.org/W2047764386","https://openalex.org/W2060335091","https://openalex.org/W2069300761","https://openalex.org/W2084715426","https://openalex.org/W2087527532","https://openalex.org/W2091621003","https://openalex.org/W2094059804","https://openalex.org/W2097223122","https://openalex.org/W2106192381","https://openalex.org/W2110425399","https://openalex.org/W2119251836","https://openalex.org/W2126823808","https://openalex.org/W2128812925","https://openalex.org/W2129487583","https://openalex.org/W2131750946","https://openalex.org/W2136310957","https://openalex.org/W2137628566","https://openalex.org/W2146455667","https://openalex.org/W2154985136","https://openalex.org/W2163347957","https://openalex.org/W2170612356","https://openalex.org/W2288285441","https://openalex.org/W2290529759","https://openalex.org/W2339276203","https://openalex.org/W2395305208","https://openalex.org/W2513825548","https://openalex.org/W2596377803","https://openalex.org/W2624503265","https://openalex.org/W2765363641","https://openalex.org/W2907501963","https://openalex.org/W2971166970","https://openalex.org/W2987907651","https://openalex.org/W3146075203","https://openalex.org/W4211008702","https://openalex.org/W4233756595","https://openalex.org/W4237009090","https://openalex.org/W4238065626","https://openalex.org/W4244598184","https://openalex.org/W4249776997","https://openalex.org/W4250846042","https://openalex.org/W4251912342","https://openalex.org/W4253178675","https://openalex.org/W6609050015","https://openalex.org/W6848219043"],"related_works":["https://openalex.org/W2808944898","https://openalex.org/W3196207352","https://openalex.org/W2951724202","https://openalex.org/W3084261076","https://openalex.org/W1996614773","https://openalex.org/W4387820098","https://openalex.org/W2576399385","https://openalex.org/W2963408011","https://openalex.org/W4236324517","https://openalex.org/W155536188"],"abstract_inverted_index":{"Abstract":[0],"We":[1],"present":[2],"a":[3,7,20,65,92,109],"methodology":[4,135],"for":[5,41],"generating":[6,80],"characterization":[8],"of":[9,36,60,64,97,108],"the":[10,24,29,61,98,106],"memory":[11,31,37,89],"used":[12,51],"by":[13,79],"an":[14],"assembly":[15,25,45,145],"program,":[16],"as":[17,19,58],"well":[18],"formal":[21,34],"proof":[22,35],"that":[23],"is":[26,39,70],"bounded":[27],"to":[28,52,140],"generated":[30],"regions.":[32],"A":[33],"usage":[38],"required":[40],"compositional":[42],"reasoning":[43],"over":[44,130],"programs.":[46],"Moreover,":[47],"it":[48],"can":[49],"be":[50],"prove":[53],"low-level":[54],"security":[55],"properties,":[56],"such":[57],"integrity":[59],"return":[62],"address":[63],"function.":[66],"Our":[67],"verification":[68],"method":[69],"based":[71],"on":[72,88],"interactive":[73],"theorem":[74],"proving,":[75],"but":[76],"provides":[77],"automation":[78],"pre-":[81],"and":[82,86,115,119,123,127],"postconditions,":[83],"invariants,":[84],"control-flow,":[85],"assumptions":[87],"layout.":[90],"As":[91],"case":[93],"study,":[94],"three":[95],"binaries":[96,104],"Xen":[99],"hypervisor":[100],"are":[101,105],"disassembled.":[102],"These":[103],"result":[107],"complex":[110,118],"build-chain":[111],"compiling":[112],"production":[113],"code,":[114],"contain":[116],"various":[117],"nested":[120],"loops,":[121],"large":[122],"compound":[124],"data":[125],"structures,":[126],"functions":[128],"with":[129],"100":[131],"basic":[132],"blocks.":[133],"The":[134],"has":[136],"been":[137],"successfully":[138],"applied":[139],"251":[141],"functions,":[142],"covering":[143],"12,252":[144],"instructions.":[146]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}