Finding DU-Paths for Testing of Multi-Tasking Real-Time Systems using WCET Analysis

Authors Daniel Sundmark, Anders Petterson, Christer Sandberg, Andreas Ermedahl, Henrik Thane



PDF
Thumbnail PDF

File

OASIcs.WCET.2007.1191.pdf
  • Filesize: 225 kB
  • 6 pages

Document Identifiers

Author Details

Daniel Sundmark
Anders Petterson
Christer Sandberg
Andreas Ermedahl
Henrik Thane

Cite As Get BibTex

Daniel Sundmark, Anders Petterson, Christer Sandberg, Andreas Ermedahl, and Henrik Thane. Finding DU-Paths for Testing of Multi-Tasking Real-Time Systems using WCET Analysis. In 7th International Workshop on Worst-Case Execution Time Analysis (WCET'07). Open Access Series in Informatics (OASIcs), Volume 6, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2007) https://doi.org/10.4230/OASIcs.WCET.2007.1191

Abstract

Memory corruption is one of the most common
software failures. For sequential software and multi-
tasking software with synchronized data accesses, it has
been shown that program faults causing memory cor-
ruption can be detected by analyzing the relations be-
tween defines and uses of variables (DU-based testing).
However, such methods are insufficient in preemptive
systems, since they lack the ability to detect inter-task
shared variable dependencies. In this paper, we propose
the use of a system level shared variable DU analy-
sis of preemptive multi-tasking real-time software. By
deriving temporal attributes of each access to shared
data using WCET analysis, and combining this infor-
mation with the real-time schedule information, our
method also detects inter-task shared variable depen-
dencies. The paper also describes how we extended the
SWEET tool to derive these temporal attributes.

Subject Classification

Keywords
  • Testing
  • Real-time systems
  • WCET analysis
  • data flow

Metrics

  • Access Statistics
  • Total Accesses (updated on a weekly basis)
    0
    PDF Downloads
Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail