Skip to main content
SpringerLink
Log in

SWEET – A Tool for WCET Flow Analysis (Extended Abstract)

  • Conference paper
Leveraging Applications of Formal Methods, Verification and Validation. Specialized Techniques and Applications (ISoLA 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8803))

Abstract

Worst-Case Execution Time (WCET) analysis [14] aims to estimate the longest possible execution time for a piece of code executing uninterrupted on a particular hardware. Such WCET estimates are used when analysing real-time systems with respect to possible deadline violations. For safety-critical real-time systems, safe (surely not underestimating) estimates are desirable. Such estimates can be produced by a static WCET analysis that takes all possible execution paths and corresponding hardware states into account.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Altenbernd, P., Ermedahl, A., Lisper, B., Gustafsson, J.: Automatic generation of timing models for timing analysis of high-level code. In: Faucou, S. (ed.) Proc. 19th International Conference on Real-Time and Network Systems (RTNS 2011), Nantes, France (Sepember 2011)

    Google Scholar 

  2. Ballabriga, C., Cassé, H., Rochange, C., Sainrat, P.: OTAWA: An open toolbox for adaptive WCET analysis. In: Min, S.L., Pettit, R., Puschner, P., Ungerer, T. (eds.) SEUS 2010. LNCS, vol. 6399, pp. 35–46. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  3. Colin, A., Puaut, I.: A modular and retargetable framework for tree-based WCET analysis. In: Proc. 13th Euromicro Conference on Real-Time Systems (ECRTS 2001) (June 2001)

    Google Scholar 

  4. Ermedahl, A., Gustafsson, J., Lisper, B.: Deriving WCET bounds by abstract execution. In: Healy, C. (ed.) Proc. 11th International Workshop on Worst-Case Execution Time Analysis (WCET 2011), Porto, Portugal (July 2011)

    Google Scholar 

  5. Ferdinand, C., Heckmann, R., Franzen, B.: Static memory and timing analysis of embedded systems code. In: 3rd European Symposium on Verification and Validation of Software Systems (VVSS 2007), Eindhoven, The Netherlands, pp. 153–163. No. 07-04 in TUE Computer Science Reports (March 2007)

    Google Scholar 

  6. Gustafsson, J., Ermedahl, A., Lisper, B., Sandberg, C., Källberg, L.: ALF – a language for WCET flow analysis. In: Holsti, N. (ed.) Proc. 9th International Workshop on Worst-Case Execution Time Analysis (WCET 2009), pp. 1–11. OCG, Dublin (2009)

    Google Scholar 

  7. Gustafsson, J., Ermedahl, A., Sandberg, C., Lisper, B.: Automatic derivation of loop bounds and infeasible paths for WCET analysis using abstract execution. In: Proc. 27th IEEE Real-Time Systems Symposium (RTSS 2006), pp. 57–66. IEEE Computer Society, Rio de Janeiro (2006)

    Chapter  Google Scholar 

  8. Holsti, N., Saarinen, S.: Status of the Bound-T WCET tool. In: Proc. 2nd International Workshop on Worst-Case Execution Time Analysis, WCET 2002 (2002)

    Google Scholar 

  9. Huber, B., Puffitsch, W., Puschner, P.: Towards an open timing analysis platform. In: Healy, C. (ed.) Proc. 11th International Workshop on Worst-Case Execution Time Analysis (WCET 2011), Porto, Portugal (July 2011)

    Google Scholar 

  10. Li, X., Liang, Y., Mitra, T., Roychoudhury, A.: Chronos: A timing analyzer for embedded software. Science of Computer Programming 69(1-3), 56–67 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Prantl, A., Schordan, M., Knoop, J.: TuBound – a conceptually new tool for worst-case execution time analysis. In: Kirner, R. (ed.) Proc. 8th International Workshop on Worst-Case Execution Time Analysis (WCET 2008), Prague, Czech Republic, pp. 141–148 (July 2008)

    Google Scholar 

  12. Puschner, P.P., Schedl, A.V.: Computing maximum task execution times – a graph-based approach. Journal of Real-Time Systems 13(1), 67–91 (1997)

    Article  Google Scholar 

  13. SWEET home page (2011), http://www.mrtc.mdh.se/projects/wcet/sweet/

  14. Wilhelm, R., Engblom, J., Ermedahl, A., Holsti, N., Thesing, S., Whalley, D., Bernat, G., Ferdinand, C., Heckmann, R., Mitra, T., Mueller, F., Puaut, I., Puschner, P., Staschulat, J., Stenström, P.: The worst-case execution time problem — overview of methods and survey of tools. ACM Transactions on Embedded Computing Systems (TECS) 7(3), 1–53 (2008)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Innovation, Design, and Engineering, Mälardalen University, SE-721 23, Västerås, Sweden

    Björn Lisper

Authors
  1. Björn Lisper
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. University of Limerick, Ireland

    Tiziana Margaria

  2. TU Dortmund, Germany

    Bernhard Steffen

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Lisper, B. (2014). SWEET – A Tool for WCET Flow Analysis (Extended Abstract). In: Margaria, T., Steffen, B. (eds) Leveraging Applications of Formal Methods, Verification and Validation. Specialized Techniques and Applications. ISoLA 2014. Lecture Notes in Computer Science, vol 8803. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-45231-8_38

Download citation

  • DOI: https://doi.org/10.1007/978-3-662-45231-8_38

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-662-45230-1

  • Online ISBN: 978-3-662-45231-8

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation