{"id":"https://openalex.org/W2058898825","doi":"https://doi.org/10.1145/1375634.1375656","title":"Analysing memory resource bounds for low-level programs","display_name":"Analysing memory resource bounds for low-level programs","publication_year":2008,"publication_date":"2008-06-07","ids":{"openalex":"https://openalex.org/W2058898825","doi":"https://doi.org/10.1145/1375634.1375656","mag":"2058898825"},"language":"en","primary_location":{"id":"doi:10.1145/1375634.1375656","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1375634.1375656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th international symposium on Memory management","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://durham-repository.worktribe.com/output/1161355","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5047181479","display_name":"Wei-Ngan Chin","orcid":"https://orcid.org/0000-0002-9660-5682"},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":true,"raw_author_name":"Wei-Ngan Chin","raw_affiliation_strings":["National University of Singapore, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069174535","display_name":"Huu Hai Nguyen","orcid":null},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Huu Hai Nguyen","raw_affiliation_strings":["National University of Singapore, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5036625175","display_name":"Corneliu Popeea","orcid":null},"institutions":[{"id":"https://openalex.org/I165932596","display_name":"National University of Singapore","ror":"https://ror.org/01tgyzw49","country_code":"SG","type":"education","lineage":["https://openalex.org/I165932596"]}],"countries":["SG"],"is_corresponding":false,"raw_author_name":"Corneliu Popeea","raw_affiliation_strings":["National University of Singapore, Singapore, Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore, Singapore, Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5042013137","display_name":"Shengchao Qin","orcid":"https://orcid.org/0000-0003-3028-8191"},"institutions":[{"id":"https://openalex.org/I190082696","display_name":"Durham University","ror":"https://ror.org/01v29qb04","country_code":"GB","type":"education","lineage":["https://openalex.org/I190082696"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Shengchao Qin","raw_affiliation_strings":["Durham University, Durham, United Kingdom"],"affiliations":[{"raw_affiliation_string":"Durham University, Durham, United Kingdom","institution_ids":["https://openalex.org/I190082696"]}]}],"institutions":[],"countries_distinct_count":2,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5047181479"],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":14.7946,"has_fulltext":false,"cited_by_count":58,"citation_normalized_percentile":{"value":0.99227942,"is_in_top_1_percent":true,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"151","last_page":"160"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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"}},"topics":[{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.9995999932289124,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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.9988999962806702,"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.8514337539672852},{"id":"https://openalex.org/keywords/memory-address","display_name":"Memory address","score":0.5512623190879822},{"id":"https://openalex.org/keywords/heap","display_name":"Heap (data structure)","score":0.529519259929657},{"id":"https://openalex.org/keywords/memory-leak","display_name":"Memory leak","score":0.5128081440925598},{"id":"https://openalex.org/keywords/recursion","display_name":"Recursion (computer science)","score":0.46561551094055176},{"id":"https://openalex.org/keywords/memory-protection","display_name":"Memory protection","score":0.42641258239746094},{"id":"https://openalex.org/keywords/overlay","display_name":"Overlay","score":0.41476017236709595},{"id":"https://openalex.org/keywords/memory-model","display_name":"Memory model","score":0.41176629066467285},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3694879412651062},{"id":"https://openalex.org/keywords/memory-management","display_name":"Memory management","score":0.36362263560295105},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.36025097966194153},{"id":"https://openalex.org/keywords/flat-memory-model","display_name":"Flat memory model","score":0.3527761995792389},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.294775128364563},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.2659832239151001},{"id":"https://openalex.org/keywords/semiconductor-memory","display_name":"Semiconductor memory","score":0.20921900868415833},{"id":"https://openalex.org/keywords/shared-memory","display_name":"Shared memory","score":0.20634078979492188},{"id":"https://openalex.org/keywords/operating-system","display_name":"Operating system","score":0.18944713473320007}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8514337539672852},{"id":"https://openalex.org/C153247305","wikidata":"https://www.wikidata.org/wiki/Q835713","display_name":"Memory address","level":3,"score":0.5512623190879822},{"id":"https://openalex.org/C134757568","wikidata":"https://www.wikidata.org/wiki/Q274089","display_name":"Heap (data structure)","level":2,"score":0.529519259929657},{"id":"https://openalex.org/C156731835","wikidata":"https://www.wikidata.org/wiki/Q751740","display_name":"Memory leak","level":4,"score":0.5128081440925598},{"id":"https://openalex.org/C168773036","wikidata":"https://www.wikidata.org/wiki/Q264164","display_name":"Recursion (computer science)","level":2,"score":0.46561551094055176},{"id":"https://openalex.org/C18131444","wikidata":"https://www.wikidata.org/wiki/Q163585","display_name":"Memory protection","level":5,"score":0.42641258239746094},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.41476017236709595},{"id":"https://openalex.org/C12186640","wikidata":"https://www.wikidata.org/wiki/Q6815743","display_name":"Memory model","level":3,"score":0.41176629066467285},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3694879412651062},{"id":"https://openalex.org/C176649486","wikidata":"https://www.wikidata.org/wiki/Q2308807","display_name":"Memory management","level":3,"score":0.36362263560295105},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.36025097966194153},{"id":"https://openalex.org/C57863822","wikidata":"https://www.wikidata.org/wiki/Q905488","display_name":"Flat memory model","level":4,"score":0.3527761995792389},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.294775128364563},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2659832239151001},{"id":"https://openalex.org/C98986596","wikidata":"https://www.wikidata.org/wiki/Q1143031","display_name":"Semiconductor memory","level":2,"score":0.20921900868415833},{"id":"https://openalex.org/C133875982","wikidata":"https://www.wikidata.org/wiki/Q764810","display_name":"Shared memory","level":2,"score":0.20634078979492188},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.18944713473320007}],"mesh":[],"locations_count":6,"locations":[{"id":"doi:10.1145/1375634.1375656","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1375634.1375656","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 7th international symposium on Memory management","raw_type":"proceedings-article"},{"id":"pmh:oai:dro.dur.ac.uk.OAI2:6246","is_oa":false,"landing_page_url":"http://dro.dur.ac.uk/6246/","pdf_url":null,"source":{"id":"https://openalex.org/S4377196258","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"acceptedVersion","is_accepted":true,"is_published":false,"raw_source_name":"(2008). 2008 International Symposium on Memory Management, ISMM\u201908, 7-8 June 2008, Tucson, AZ ; proceedings. New York: Association for Computing Machinery, pp. 151-160","raw_type":"Book chapter"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.224.3208","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.224.3208","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://rw4.cs.uni-saarland.de/teaching/spa10/papers/membounds.pdf","raw_type":"text"},{"id":"pmh:oai:durham-repository.worktribe.com:1161355","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1161355","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":null,"raw_type":"Presentation / Conference Contribution"},{"id":"pmh:oai:https://research.tees.ac.uk/ws/oai:openaire_cris_publications/4b5725d3-85f9-405e-97d1-05a70db62a9b","is_oa":false,"landing_page_url":"https://research.tees.ac.uk/en/publications/4b5725d3-85f9-405e-97d1-05a70db62a9b","pdf_url":null,"source":{"id":"https://openalex.org/S4306401198","display_name":"TeesRep (Teesside University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I874055015","host_organization_name":"Teesside University","host_organization_lineage":["https://openalex.org/I874055015"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Chin, W-N, Nguyen, H H, Popeea, C & Qin, S 2008, Analysing memory resource bounds for low-level programs. in Proceedings of the 7th international symposium on Memory management. ACM, pp. 151-160, 7th International Symposium on Memory Management, Tucson, Arizona, United States, 7/06/08. https://doi.org/10.1145/1375634.1375656","raw_type":"contributionToPeriodical"},{"id":"pmh:oai:tees.openrepository.com:10149/113881","is_oa":false,"landing_page_url":"http://hdl.handle.net/10149/113881","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Meetings and Proceedings"}],"best_oa_location":{"id":"pmh:oai:durham-repository.worktribe.com:1161355","is_oa":true,"landing_page_url":"https://durham-repository.worktribe.com/output/1161355","pdf_url":null,"source":{"id":"https://openalex.org/S4306400188","display_name":"Durham Research Online (Durham University)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I190082696","host_organization_name":"Durham University","host_organization_lineage":["https://openalex.org/I190082696"],"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":null,"raw_type":"Presentation / Conference Contribution"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G1379105237","display_name":null,"funder_award_id":"EP/E021948/1","funder_id":"https://openalex.org/F4320334627","funder_display_name":"Engineering and Physical Sciences Research Council"}],"funders":[{"id":"https://openalex.org/F4320334627","display_name":"Engineering and Physical Sciences Research Council","ror":"https://ror.org/0439y7842"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":28,"referenced_works":["https://openalex.org/W174108390","https://openalex.org/W1480779880","https://openalex.org/W1544023751","https://openalex.org/W1568194905","https://openalex.org/W1570919259","https://openalex.org/W1583095677","https://openalex.org/W1590648473","https://openalex.org/W1686420892","https://openalex.org/W1844529821","https://openalex.org/W1959256509","https://openalex.org/W1983134029","https://openalex.org/W1997712902","https://openalex.org/W2017752225","https://openalex.org/W2035216234","https://openalex.org/W2055814018","https://openalex.org/W2068055184","https://openalex.org/W2107089133","https://openalex.org/W2110908283","https://openalex.org/W2121707639","https://openalex.org/W2127184104","https://openalex.org/W2132331020","https://openalex.org/W2132661148","https://openalex.org/W2135909143","https://openalex.org/W2167789628","https://openalex.org/W3140353777","https://openalex.org/W4285719527","https://openalex.org/W6635467523","https://openalex.org/W6638687553"],"related_works":["https://openalex.org/W3210309940","https://openalex.org/W2121519027","https://openalex.org/W2978936965","https://openalex.org/W2170922286","https://openalex.org/W4210676563","https://openalex.org/W2203922256","https://openalex.org/W116159913","https://openalex.org/W2959540566","https://openalex.org/W2069024374","https://openalex.org/W4313907802"],"abstract_inverted_index":{"Embedded":[0],"systems":[1,9,18],"are":[2,10],"becoming":[3],"more":[4],"widely":[5],"used":[6],"but":[7],"these":[8,17],"often":[11],"resource":[12,37],"constrained.":[13],"Programming":[14],"models":[15],"for":[16,42,95,113],"should":[19],"take":[20],"into":[21],"formal":[22],"consideration":[23],"resources":[24],"such":[25],"as":[26],"stack":[27],"and":[28,90,97,116],"heap.":[29],"In":[30],"this":[31],"paper,":[32],"we":[33,67],"show":[34],"how":[35],"memory":[36,50,87,103,111,124],"bounds":[38],"can":[39,107],"be":[40],"inferred":[41],"assembly-level":[43],"programs.":[44],"Our":[45,77],"inference":[46],"process":[47],"captures":[48],"the":[49,58],"needs":[51],"of":[52,57,61],"each":[53],"method":[54],"in":[55,102],"terms":[56],"symbolic":[59],"values":[60],"its":[62],"parameters.":[63],"For":[64],"better":[65],"precision,":[66],"infer":[68],"path-sensitive":[69],"information":[70],"through":[71],"a":[72,82],"novel":[73],"guarded":[74],"expression":[75],"format.":[76],"current":[78],"proposal":[79,106],"relies":[80],"on":[81,110],"Presburger":[83],"solver":[84],"to":[85,91],"capture":[86],"requirements":[88],"symbolically,":[89],"perform":[92],"fixpoint":[93],"analysis":[94],"loops":[96],"recursion.":[98],"Apart":[99],"from":[100],"safety":[101],"adequacy,":[104],"our":[105],"provide":[108],"estimate":[109],"costs":[112],"embedded":[114],"devices":[115],"improve":[117],"performance":[118],"via":[119],"fewer":[120],"runtime":[121],"checks":[122],"against":[123],"bound.":[125]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2020,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":8}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}