{"id":"https://openalex.org/W59298299","doi":null,"title":"Fully Automatic, Parametric Worst-Case Execution Time Analysis","display_name":"Fully Automatic, Parametric Worst-Case Execution Time Analysis","publication_year":null,"publication_date":null,"ids":{"openalex":"https://openalex.org/W59298299","mag":"59298299"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.3897","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.3897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mrtc.mdh.se/publications/0531.ps","raw_type":"text"},"volume":null,"type":"article","is_traditional":true,"indexed_in":[],"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/A5062612658","display_name":"Bj\u00f6rn Lisper","orcid":"https://orcid.org/0000-0001-5297-6548","observed_orcids":["https://orcid.org/0000-0001-5297-6548"]},"institutions":[{"id":"https://openalex.org/I82509713","display_name":"M\u00e4lardalen University","ror":"https://ror.org/033vfbz75","country_code":"SE","type":"education","lineage":["https://openalex.org/I82509713"]}],"countries":["SE"],"is_corresponding":true,"raw_author_name":"Bj\u00f6rn Lisper","raw_affiliation_strings":["M\u00e4lardalen University College"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"M\u00e4lardalen University College","institution_ids":["https://openalex.org/I82509713"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":["https://openalex.org/A5062612658"],"corresponding_institution_ids":["https://openalex.org/I82509713"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":93,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10933","display_name":"Real-Time Systems Scheduling","score":0.5942000150680542,"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.5942000150680542,"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/T10126","display_name":"Logic, programming, and type systems","score":0.22660000622272491,"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"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.08720000088214874,"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/worst-case-execution-time","display_name":"worst-case execution time","score":0.8989999890327454},{"id":"https://openalex.org/keywords/abstract-interpretation","display_name":"abstract interpretation","score":0.6549999713897705},{"id":"https://openalex.org/keywords/automatic-program-analysis","display_name":"automatic program analysis","score":0.36399999260902405}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7766892910003662},{"id":"https://openalex.org/C117251300","wikidata":"https://www.wikidata.org/wiki/Q1849855","display_name":"Parametric statistics","level":2,"score":0.7333396077156067},{"id":"https://openalex.org/C2780654840","wikidata":"https://www.wikidata.org/wiki/Q333341","display_name":"Abstract interpretation","level":2,"score":0.7041128277778625},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6255397200584412},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.5676506161689758},{"id":"https://openalex.org/C200130814","wikidata":"https://www.wikidata.org/wiki/Q362858","display_name":"Worst-case execution time","level":3,"score":0.5433983206748962},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5062071681022644},{"id":"https://openalex.org/C97137487","wikidata":"https://www.wikidata.org/wiki/Q729138","display_name":"Integer (computer science)","level":2,"score":0.4933556616306305},{"id":"https://openalex.org/C2989134064","wikidata":"https://www.wikidata.org/wiki/Q288510","display_name":"Execution time","level":2,"score":0.4795893728733063},{"id":"https://openalex.org/C97686452","wikidata":"https://www.wikidata.org/wiki/Q7604153","display_name":"Static analysis","level":2,"score":0.46991196274757385},{"id":"https://openalex.org/C98183937","wikidata":"https://www.wikidata.org/wiki/Q2112188","display_name":"Program analysis","level":2,"score":0.4607670307159424},{"id":"https://openalex.org/C54829058","wikidata":"https://www.wikidata.org/wiki/Q172937","display_name":"Polyhedron","level":2,"score":0.42402228713035583},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.2846773862838745},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.2380395531654358},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.18638703227043152},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.13594695925712585},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.1128101646900177},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.12.3897","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.3897","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mrtc.mdh.se/publications/0531.ps","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.5.1545","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.5.1545","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mrtc.mdh.se/publications/0629.pdf","raw_type":"text"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.99.8092","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.99.8092","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.mrtc.mdh.se/publications/0531.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":22,"referenced_works":["https://openalex.org/W114165006","https://openalex.org/W199049734","https://openalex.org/W1491178396","https://openalex.org/W1526316702","https://openalex.org/W1540110476","https://openalex.org/W1585404558","https://openalex.org/W1595437973","https://openalex.org/W1786408328","https://openalex.org/W1963547452","https://openalex.org/W1963741373","https://openalex.org/W1966345332","https://openalex.org/W1967249911","https://openalex.org/W2006053872","https://openalex.org/W2043100293","https://openalex.org/W2114178125","https://openalex.org/W2132661148","https://openalex.org/W2140183411","https://openalex.org/W2156093251","https://openalex.org/W2165820775","https://openalex.org/W2171518785","https://openalex.org/W2293624369","https://openalex.org/W2340604309"],"related_works":["https://openalex.org/W2760523689","https://openalex.org/W3015706089","https://openalex.org/W1175047725","https://openalex.org/W2775065827","https://openalex.org/W4207091291","https://openalex.org/W2097940635","https://openalex.org/W2144686287","https://openalex.org/W3215253772","https://openalex.org/W7100871641","https://openalex.org/W2110398474"],"abstract_inverted_index":{"Worst-Case":[0],"Execution":[1],"Time":[2],"(WCET)":[3],"analysis":[4,23],"means":[5],"to":[6,12,43,72,82,93,116],"compute":[7],"a":[8,17,54,79,89],"safe":[9],"upper":[10,26,114],"bound":[11],"the":[13,44,95],"execution":[14],"time":[15],"of":[16,19,40,99,106],"piece":[18],"code.":[20],"Parametric":[21],"WCET":[22,60,100],"yields":[24],"symbolic":[25,80,90],"bounds:":[27],"expressions":[28],"that":[29],"may":[30,35],"contain":[31],"parameters.":[32],"These":[33],"parameters":[34,42],"represent,":[36],"for":[37,50,56],"instance,":[38],"values":[39],"input":[41],"program,":[45],"or":[46],"maximal":[47],"iteration":[48,118],"counts":[49,119],"loops.":[51],"We":[52],"describe":[53],"technique":[55,92,103],"fully":[57],"automatic":[58],"parametric":[59,74],"analysis,":[61],"which":[62],"is":[63,104],"based":[64],"on":[65,76],"known":[66],"mathematical":[67],"methods:":[68],"an":[69],"abstract":[70],"interpretation":[71],"calculate":[73],"constraints":[75],"program":[77],"flow,":[78],"method":[81],"count":[83],"integer":[84],"points":[85],"in":[86],"polyhedra,":[87],"and":[88,110],"ILP":[91],"solve":[94],"subsequent":[96],"IPET":[97],"calculation":[98],"bound.":[101],"The":[102],"capable":[105],"handling":[107],"unstructured":[108],"code,":[109],"it":[111],"can":[112],"find":[113],"bounds":[115],"loop":[117],"automatically.":[120],"1":[121]},"counts_by_year":[{"year":2023,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":3},{"year":2019,"cited_by_count":3},{"year":2016,"cited_by_count":4},{"year":2015,"cited_by_count":3},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":1},{"year":2012,"cited_by_count":7}],"updated_date":"2026-11-12T12:28:57.059296","created_date":"2016-06-24T00:00:00"}