{"id":"https://openalex.org/W4231939190","doi":"https://doi.org/10.1109/emsoft.2013.6658594","title":"Simple analysis of partial worst-case execution paths on general control flow graphs","display_name":"Simple analysis of partial worst-case execution paths on general control flow graphs","publication_year":2013,"publication_date":"2013-09-01","ids":{"openalex":"https://openalex.org/W4231939190","doi":"https://doi.org/10.1109/emsoft.2013.6658594"},"language":"en","primary_location":{"id":"doi:10.1109/emsoft.2013.6658594","is_oa":false,"landing_page_url":"https://doi.org/10.1109/emsoft.2013.6658594","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":true,"oa_status":"gold","oa_url":"https://zenodo.org/record/3430900","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5071652664","display_name":"Jan C. Kleinsorge","orcid":null},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":true,"raw_author_name":"Jan C. Kleinsorge","raw_affiliation_strings":["TU Dortmund"],"affiliations":[{"raw_affiliation_string":"TU Dortmund","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5043343760","display_name":"Heiko Falk","orcid":"https://orcid.org/0000-0003-1196-0122"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Heiko Falk","raw_affiliation_strings":["TU Dortmund"],"affiliations":[{"raw_affiliation_string":"TU Dortmund","institution_ids":["https://openalex.org/I200332995"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5088968038","display_name":"Peter Marwedel","orcid":"https://orcid.org/0000-0001-5923-9145"},"institutions":[{"id":"https://openalex.org/I200332995","display_name":"TU Dortmund University","ror":"https://ror.org/01k97gp34","country_code":"DE","type":"education","lineage":["https://openalex.org/I200332995"]}],"countries":["DE"],"is_corresponding":false,"raw_author_name":"Peter Marwedel","raw_affiliation_strings":["TU Dortmund"],"affiliations":[{"raw_affiliation_string":"TU Dortmund","institution_ids":["https://openalex.org/I200332995"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5071652664"],"corresponding_institution_ids":["https://openalex.org/I200332995"],"apc_list":null,"apc_paid":null,"fwci":0.56157031,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.74771651,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":96},"biblio":{"volume":"18","issue":null,"first_page":"1","last_page":"10"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998999834060669,"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/T10933","display_name":"Real-Time Systems Scheduling","score":0.9998999834060669,"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/T10904","display_name":"Embedded Systems Design Techniques","score":0.9955000281333923,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.9954000115394592,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7500588893890381},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6956460475921631},{"id":"https://openalex.org/keywords/control-flow","display_name":"Control flow","score":0.6377425193786621},{"id":"https://openalex.org/keywords/control-flow-graph","display_name":"Control flow graph","score":0.6060026288032532},{"id":"https://openalex.org/keywords/simple","display_name":"Simple (philosophy)","score":0.5660991072654724},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5248156785964966},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.5058712363243103},{"id":"https://openalex.org/keywords/longest-path-problem","display_name":"Longest path problem","score":0.5046576261520386},{"id":"https://openalex.org/keywords/data-flow-analysis","display_name":"Data-flow analysis","score":0.5008769035339355},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.48450562357902527},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.42944034934043884},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3851788341999054},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.3420506715774536},{"id":"https://openalex.org/keywords/data-flow-diagram","display_name":"Data flow diagram","score":0.25489598512649536},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.21902009844779968},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.20639953017234802}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7500588893890381},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6956460475921631},{"id":"https://openalex.org/C160191386","wikidata":"https://www.wikidata.org/wiki/Q868299","display_name":"Control flow","level":2,"score":0.6377425193786621},{"id":"https://openalex.org/C27458966","wikidata":"https://www.wikidata.org/wiki/Q1187693","display_name":"Control flow graph","level":2,"score":0.6060026288032532},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.5660991072654724},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5248156785964966},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5058712363243103},{"id":"https://openalex.org/C1465435","wikidata":"https://www.wikidata.org/wiki/Q2916352","display_name":"Longest path problem","level":4,"score":0.5046576261520386},{"id":"https://openalex.org/C88468194","wikidata":"https://www.wikidata.org/wiki/Q1172416","display_name":"Data-flow analysis","level":3,"score":0.5008769035339355},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.48450562357902527},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.42944034934043884},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3851788341999054},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3420506715774536},{"id":"https://openalex.org/C489000","wikidata":"https://www.wikidata.org/wiki/Q747385","display_name":"Data flow diagram","level":2,"score":0.25489598512649536},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.21902009844779968},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.20639953017234802},{"id":"https://openalex.org/C111472728","wikidata":"https://www.wikidata.org/wiki/Q9471","display_name":"Epistemology","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/emsoft.2013.6658594","is_oa":false,"landing_page_url":"https://doi.org/10.1109/emsoft.2013.6658594","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:zenodo.org:3430900","is_oa":true,"landing_page_url":"https://zenodo.org/record/3430900","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"}],"best_oa_location":{"id":"pmh:oai:zenodo.org:3430900","is_oa":true,"landing_page_url":"https://zenodo.org/record/3430900","pdf_url":null,"source":null,"license":"other-oa","license_id":"https://openalex.org/licenses/other-oa","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/conferencePaper"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":20,"referenced_works":["https://openalex.org/W1497049916","https://openalex.org/W2007427290","https://openalex.org/W2010194128","https://openalex.org/W2054253211","https://openalex.org/W2076285066","https://openalex.org/W2078508340","https://openalex.org/W2082318969","https://openalex.org/W2104066885","https://openalex.org/W2114067856","https://openalex.org/W2119257015","https://openalex.org/W2138952175","https://openalex.org/W2140183411","https://openalex.org/W2143109439","https://openalex.org/W2156093251","https://openalex.org/W2156120741","https://openalex.org/W2306258011","https://openalex.org/W2752061190","https://openalex.org/W4213060235","https://openalex.org/W4246219036","https://openalex.org/W6677084613"],"related_works":["https://openalex.org/W1999711970","https://openalex.org/W2166895275","https://openalex.org/W2151163382","https://openalex.org/W2998775986","https://openalex.org/W1971022286","https://openalex.org/W1484884871","https://openalex.org/W1565879960","https://openalex.org/W3022519409","https://openalex.org/W94523631","https://openalex.org/W1848579875"],"abstract_inverted_index":{"One":[0],"of":[1,191],"the":[2,13,18,51,82,169,189],"most":[3,20],"important":[4],"computations":[5,48],"in":[6,24],"static":[7],"worst-case":[8,174],"execution":[9,22,204],"time":[10],"analyses":[11,76,102],"is":[12,28,59,164,181,195],"path":[14,23,35,47,124],"analysis":[15,125,153],"which":[16,194],"computes":[17],"potentially":[19],"time-consuming":[21],"a":[25,116,121,157],"program.":[26],"This":[27],"typically":[29],"done":[30],"either":[31],"with":[32,45,73,143],"an":[33,40],"implicit":[34],"computation":[36,190],"based":[37],"on":[38,50,128],"solving":[39,185],"integer":[41],"linear":[42,83],"program,":[43],"or":[44,98,103,107],"explicit":[46,123],"directly":[49],"program's":[52],"control":[53,131,145,158],"flow":[54,132,149,159],"graph.":[55],"The":[56,86,152],"former":[57],"approach":[58],"powerful":[60],"and":[61,70,120,137,147,167,188,203],"comparably":[62],"simple":[63,136],"to":[64,68,71,78,81,92,141,161,171,201],"use":[65],"but":[66],"hard":[67],"extend":[69],"combine":[72],"other":[74],"program":[75],"due":[77],"its":[79],"restriction":[80],"equation":[84],"model.":[85],"latter":[87],"approaches":[88],"are":[89],"often":[90],"restricted":[91],"well-structured":[93],"graphs,":[94],"suffer":[95],"from":[96,176],"inaccuracy":[97],"require":[99,156],"nontrivial":[100],"structural":[101],"graph":[104,160],"transformations":[105],"upfront":[106],"during":[108],"their":[109],"computations.":[110],"In":[111],"this":[112],"paper,":[113],"we":[114],"propose":[115,135],"generalized":[117],"computational":[118],"model":[119],"comprehensive":[122],"that":[126],"operates":[127],"arbitrary":[129,177],"directed":[130],"graphs.":[133],"We":[134],"yet":[138],"effective":[139],"techniques":[140],"deal":[142],"unstructured":[144],"flows":[146],"complex":[148],"fact":[150],"models.":[151],"does":[154],"not":[155],"be":[162],"mutable,":[163],"non-recursive,":[165],"fast,":[166],"provides":[168],"means":[170],"compute":[172],"all":[173],"paths":[175],"source":[178],"nodes.":[179],"It":[180],"well":[182],"suited":[183],"for":[184,198],"local":[186],"problems":[187,199],"partial":[192],"solutions,":[193],"highly":[196],"relevant":[197],"related":[200],"scheduling":[202],"modes":[205],"alike.":[206]},"counts_by_year":[{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2015,"cited_by_count":2}],"updated_date":"2026-02-05T00:54:17.221276","created_date":"2022-05-12T00:00:00"}