mdh.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Algorithms for Infeasible Path Calculation
Mälardalen University, Department of Computer Science and Electronics.ORCID iD: 0000-0001-6571-0175
Mälardalen University, Department of Computer Science and Electronics.
Mälardalen University, Department of Computer Science and Electronics.ORCID iD: 0000-0001-5297-6548
2006 (English)In: OpenAccess Series in InformaticsVolume 4, 2006, 2006Conference paper, Published paper (Refereed)
Abstract [en]

Static Worst-Case Execution Time (WCET) analysis is a technique to derive upper bounds for the execution times of programs. Such bounds are crucial when designing and verifying real-time systems. A key component in static WCET analysis is to derive flow information, such as loop bounds and infeasible paths. Such flow information can be provided as either as annotations by the user, can be automatically calculated by a flow analysis, or by a combination of both. To make the analysis as simple, automatic and safe as possible, this flow information should be calculated automatically with no or very limited user interaction. In this paper we present three novel algorithms to calculate infeasible paths. The algorithms are all designed to be simple and efficient, both in terms of generated flow facts and in analysis running time. The algorithms have been implemented and tested for a set of WCET benchmarks programs.

Place, publisher, year, edition, pages
2006.
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:mdh:diva-6924Scopus ID: 2-s2.0-84880146184ISBN: 9783939897033 (print)OAI: oai:DiVA.org:mdh-6924DiVA, id: diva2:236934
Conference
6th International Workshop on Worst-Case Execution Time Analysis, WCET 2006; Dresden; Germany; 4 July 2006 through 4 July 2006
Available from: 2009-09-25 Created: 2009-09-25 Last updated: 2015-08-26Bibliographically approved

Open Access in DiVA

No full text in DiVA

Scopus

Authority records BETA

Gustafsson, JanLisper, Björn

Search in DiVA

By author/editor
Gustafsson, JanErmedahl, AndreasLisper, Björn
By organisation
Department of Computer Science and Electronics
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

isbn
urn-nbn

Altmetric score

isbn
urn-nbn
Total: 18 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf