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
Faster WCET Flow Analysis by Program Slicing
Mälardalen University, Department of Computer Science and Electronics.
Mälardalen University, Department of Computer Science and Electronics.
Mälardalen University, Department of Computer Science and Electronics.ORCID iD: 0000-0001-6571-0175
Mälardalen University, Department of Computer Science and Electronics.ORCID iD: 0000-0001-5297-6548
2006 (English)In: ACM SIGPLAN Notices, Volume 41, Issue 7, July 2006, 2006, Vol. 41, p. 103-112Conference 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. WCET analysis needs a program flow analysis to derive constraints on the possible execution paths of the analysed program, like iteration bounds for loops and dependences between conditionals.Current WCET analysis tools typically obtain flow information through manual annotations. Better support for automatic flow analysis would eliminate much of the need for this laborious work. However, to automatically derive high-quality flow information is hard, and solution techniques with large time and space complexity are often required.In this paper we describe how to use program slicing to reduce the computational need of flow analysis methods. The slicing identifes statements and variables which are guaranteed not to influence the program flow. When these are removed, the calculation time of our different flow analyses decreases, in some cases considerably.We also show how program slicing can be used to identify the input variables and globals that control the outcome of a particular loop or conditional. This should be valuable aid when performing WCET analysis and systematic testing of large and complex real-time programs.

Place, publisher, year, edition, pages
2006. Vol. 41, p. 103-112
National Category
Computer Systems
Identifiers
URN: urn:nbn:se:mdh:diva-6923DOI: 10.1145/1159974.1134666ISI: 000202972200013Scopus ID: 2-s2.0-33749028206ISBN: 1-59593-362-X (print)OAI: oai:DiVA.org:mdh-6923DiVA, id: diva2:236933
Conference
ACM SIGPLAN Conference on Languages, Compilers and Tools for Embedded Systems (LCTES2006), Ottawa, Canada
Available from: 2009-09-25 Created: 2009-09-25 Last updated: 2016-01-11Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records BETA

Gustafsson, JanLisper, Björn

Search in DiVA

By author/editor
Ermedahl, AndreasGustafsson, JanLisper, Björn
By organisation
Department of Computer Science and Electronics
Computer Systems

Search outside of DiVA

GoogleGoogle Scholar

doi
isbn
urn-nbn

Altmetric score

doi
isbn
urn-nbn
Total: 21 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