Advertisement

Abstract Execution for Event-Driven Systems – An Application from Automotive/Infotainment Development

  • Klaus Birken
Part of the Lecture Notes in Computer Science book series (LNCS, volume 7610)

Abstract

Event-driven systems are ubiquitous – in technical as well as non-technical domains. Often these systems are safety-critical, and static analysis methods are applied in order to reduce risks and increase quality. The Abstract Execution analysis method provides valuable results for imperative programs, which are used for WCET analysis. In this paper, an enhancement for Abstract Execution is presented, which allows handling the concurrent program flow of event-driven systems. An abstract event queue is defined which is able to represent multiple concrete event queues. This queue handling is embedded into the Abstract Execution engine without further changes to the original algorithm. A elaborated real-world example will be shown, which applies the new analysis method to the model-based development of on-board diagnostics software in the Automotive/Infotainment domain.

Keywords

Abstract execution static analysis event-driven concurrency onboard diagnostics automotive infotainment 

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Gustafsson, J., et al.: Automatic derivation of loop bounds and infeasible paths for WCET analysis using Abstract Execution. In: Proceedings of the 27th IEEE Real-Time Systems Symposium (RTSS 2006). IEEE Computer Society, Rio de Janeiro (2006)Google Scholar
  2. 2.
    Ermedahl, A., Gustafsson, J., Lisper, B.: Deriving WCET Bounds by Abstract Execution. In: Proceedings of the 11th International Workshop on Worst-Case Execution Time Analysis (WCET 2011), Porto, Portugal (2011)Google Scholar
  3. 3.
    Clarke, E.M., Heinle, W.: Modular translation of Statecharts to SMV. Technical report, Carnegie Mellon University (2000)Google Scholar
  4. 4.
    Cousot, P., Cousot, R.: Abstract interpretation: a unified lattice model for static analysis of programs by construction or approximation of fixpoints. In: Conference Record of the Sixth Annual ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, Los Angeles, California, pp. 238–252 (1977)Google Scholar
  5. 5.
    Ratiu, D., Völter, M., Schätz, B., Kolb, B.: Language Engineering as an Enabler for Incremental Formal Analysis. In: Proceedings of FORMSERA 2012 Workshop (2012)Google Scholar
  6. 6.
    Eclipse platform, http://www.eclipse.org
  7. 7.
    El-Far, I.K., Whittaker, J.A.: Model-based Software Testing. In: Encyclopedia on Software Engineering. Wiley (2001)Google Scholar
  8. 8.

Copyright information

© Springer-Verlag Berlin Heidelberg 2012

Authors and Affiliations

  • Klaus Birken
    • 1
  1. 1.Harman/Becker Automotive SystemsFilderstadtGermany

Personalised recommendations