{"id":"https://openalex.org/W4233575364","doi":"https://doi.org/10.1109/emsoft.2013.6658593","title":"Path-sensitive resource analysis compliant with assertions","display_name":"Path-sensitive resource analysis compliant with assertions","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W4233575364","doi":"https://doi.org/10.1109/emsoft.2013.6658593"},"language":"en","primary_location":{"id":"doi:10.1109/emsoft.2013.6658593","is_oa":false,"landing_page_url":"https://doi.org/10.1109/emsoft.2013.6658593","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Proceedings of the International Conference on Embedded Software (EMSOFT)","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/A5042378793","display_name":"Duc-Hiep Chu","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":true,"raw_author_name":"Duc-Hiep Chu","raw_affiliation_strings":["National University of Singapore"],"affiliations":[{"raw_affiliation_string":"National University of Singapore","institution_ids":["https://openalex.org/I165932596"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5058689103","display_name":"Joxan Jaffar","orcid":"https://orcid.org/0000-0001-9988-6144"},"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":"Joxan Jaffar","raw_affiliation_strings":["National University of Singapore, joxa"],"affiliations":[{"raw_affiliation_string":"National University of Singapore, joxa","institution_ids":["https://openalex.org/I165932596"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5042378793"],"corresponding_institution_ids":["https://openalex.org/I165932596"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.35104009,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9998000264167786,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9995999932289124,"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/T10142","display_name":"Formal Methods in Verification","score":0.9994999766349792,"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.8295687437057495},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.5939674377441406},{"id":"https://openalex.org/keywords/bounding-overwatch","display_name":"Bounding overwatch","score":0.5788350701332092},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5746644735336304},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4820355176925659},{"id":"https://openalex.org/keywords/loop","display_name":"Loop (graph theory)","score":0.46832090616226196},{"id":"https://openalex.org/keywords/search-tree","display_name":"Search tree","score":0.4547306001186371},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.4515877068042755},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.42962753772735596},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3840734660625458},{"id":"https://openalex.org/keywords/programming-language","display_name":"Programming language","score":0.17362099885940552},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.169332355260849},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1263253390789032}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8295687437057495},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.5939674377441406},{"id":"https://openalex.org/C63584917","wikidata":"https://www.wikidata.org/wiki/Q333286","display_name":"Bounding overwatch","level":2,"score":0.5788350701332092},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5746644735336304},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4820355176925659},{"id":"https://openalex.org/C184670325","wikidata":"https://www.wikidata.org/wiki/Q512604","display_name":"Loop (graph theory)","level":2,"score":0.46832090616226196},{"id":"https://openalex.org/C207024777","wikidata":"https://www.wikidata.org/wiki/Q621673","display_name":"Search tree","level":3,"score":0.4547306001186371},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.4515877068042755},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.42962753772735596},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3840734660625458},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.17362099885940552},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.169332355260849},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1263253390789032},{"id":"https://openalex.org/C94625758","wikidata":"https://www.wikidata.org/wiki/Q7163","display_name":"Politics","level":2,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0},{"id":"https://openalex.org/C199539241","wikidata":"https://www.wikidata.org/wiki/Q7748","display_name":"Law","level":1,"score":0.0},{"id":"https://openalex.org/C17744445","wikidata":"https://www.wikidata.org/wiki/Q36442","display_name":"Political science","level":0,"score":0.0},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/emsoft.2013.6658593","is_oa":false,"landing_page_url":"https://doi.org/10.1109/emsoft.2013.6658593","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2013 Proceedings of the International Conference on Embedded Software (EMSOFT)","raw_type":"proceedings-article"},{"id":"pmh:oai:scholarbank.nus.edu.sg:10635/78281","is_oa":false,"landing_page_url":"http://scholarbank.nus.edu.sg/handle/10635/78281","pdf_url":null,"source":{"id":"https://openalex.org/S7407052290","display_name":"National University of Singapore","issn_l":null,"issn":[],"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":"Scopus","raw_type":"Conference Paper"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.5099999904632568,"id":"https://metadata.un.org/sdg/8","display_name":"Decent work and economic growth"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":23,"referenced_works":["https://openalex.org/W1546818998","https://openalex.org/W1593319293","https://openalex.org/W1595437973","https://openalex.org/W1762252016","https://openalex.org/W2043100293","https://openalex.org/W2058479406","https://openalex.org/W2060498389","https://openalex.org/W2066210260","https://openalex.org/W2099473014","https://openalex.org/W2113085322","https://openalex.org/W2114633883","https://openalex.org/W2122917953","https://openalex.org/W2138952175","https://openalex.org/W2139107688","https://openalex.org/W2139381299","https://openalex.org/W2145105471","https://openalex.org/W2147661183","https://openalex.org/W2149504019","https://openalex.org/W2159373783","https://openalex.org/W4242321992","https://openalex.org/W6635586397","https://openalex.org/W6677097317","https://openalex.org/W6681951400"],"related_works":["https://openalex.org/W4382866738","https://openalex.org/W2227684440","https://openalex.org/W2739550867","https://openalex.org/W2156833871","https://openalex.org/W2359807192","https://openalex.org/W2174962524","https://openalex.org/W2083751087","https://openalex.org/W48124421","https://openalex.org/W2915699561","https://openalex.org/W2157743338"],"abstract_inverted_index":{"We":[0,78,111],"consider":[1],"the":[2,6,43,52,55,63,98,108,117,136,166,176,182,186,191,195,203],"problem":[3],"of":[4,10,45,54,119,150,178,217],"bounding":[5],"worst-case":[7,192],"resource":[8],"usage":[9],"programs,":[11],"where":[12,116],"assertions":[13,85,96,204],"about":[14],"valid":[15],"program":[16,23],"executions":[17],"may":[18],"be":[19,30,49,60,101],"enforced":[20],"at":[21,175],"selected":[22],"points.":[24],"It":[25],"is":[26,36,67,92,122,142,149,173,212],"folklore":[27],"that":[28,80,93,160,201],"to":[29,34,75,100,163,165,189],"precise,":[31],"path-sensitivity":[32],"(up":[33],"loops)":[35,106],"needed.":[37],"This":[38,138],"entails":[39],"unrolling":[40,135],"loops":[41],"in":[42,62,124,134,194,209],"manner":[44],"symbolic":[46,145],"simulation.":[47],"To":[48],"tractable,":[50],"however,":[51],"treatment":[53,118],"individual":[56],"loop":[57,121],"iterations":[58],"must":[59],"greedy":[61,132],"sense":[64],"once":[65],"analysis":[66,99],"finished":[68],"on":[69],"one":[70],"iteration,":[71],"we":[72],"cannot":[73],"backtrack":[74],"change":[76],"it.":[77],"show":[79],"under":[81],"these":[82],"conditions,":[83],"enforcing":[84],"produces":[86],"unsound":[87],"results.":[88],"The":[89,127],"fundamental":[90],"reason":[91],"complying":[94],"with":[95,105],"requires":[97],"fully":[102],"sensitive":[103],"(also":[104],"wrt.":[107],"assertion":[109],"variables.":[110],"then":[112],"present":[113],"an":[114,215],"algorithm":[115],"each":[120],"separated":[123],"two":[125],"phases.":[126],"first":[128],"phase":[129,139,184],"uses":[130],"a":[131,144,218],"strategy":[133],"loop.":[137],"explores":[140],"what":[141],"conceptually":[143],"execution":[146],"tree,":[147,197],"which":[148],"enormous":[151],"size,":[152],"while":[153],"eliminates":[154],"infeasible":[155],"paths":[156,159,200],"and":[157],"dominated":[158],"guaranteed":[161],"not":[162],"contribute":[164],"worst":[167],"case":[168],"bound.":[169],"A":[170],"compact":[171],"representation":[172],"produced":[174],"end":[177],"this":[179],"phase.":[180],"Finally,":[181],"second":[183],"attacks":[185],"remaining":[187],"problem,":[188],"determine":[190],"path":[193],"simplified":[196],"excluding":[198],"all":[199],"violate":[202],"from":[205],"bound":[206],"calculation.":[207],"Scalability,":[208],"both":[210],"phases,":[211],"achieved":[213],"via":[214],"adaptation":[216],"dynamic":[219],"programming":[220],"algorithm.":[221]},"counts_by_year":[],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}