Loading...
Please wait, while we are loading the content...
Similar Documents
Worst-case timing analysis via finding longest paths in spark ada basic-path graphs (1994).
| Content Provider | CiteSeerX |
|---|---|
| Author | Chapman, Roderick |
| Abstract | The SPARK Proof and Timing System (SPATS) is a collection of software tools developed to assist the static analysis of safetycritical and hard real-time software. SPATS integrates both classical program proof and worst-case execution time analysis through analysis of a program's basic-path control-flow graph. A new algorithm has been developed that transforms a cyclic basicpath graph into a path-expression that can be evaluated for worstcase timing assuming suitable bounds on each loop are available. This paper describes and offers a proof of the new algorithm, followed by examples of its application. Keywords: path expression, longest path, worst-case timing analysis, hard real-time, safety-critical, Ada. 2 1. Introduction The need for static worst-case timing analysis of hard real-time and safety-critical software has been well-known for several years. 1-4 The goal of a timing analysis system is to produce predicted worst-case execution times (henceforth `WCET') which are both ... |
| File Format | |
| Publisher Date | 1994-01-01 |
| Access Restriction | Open |
| Subject Keyword | New Algorithm Worst-case Timing Analysis Several Year Classical Program Proof Timing System Timing Analysis System Hard Real-time Software Cyclic Basicpath Graph Static Worst-case Timing Analysis Spark Proof Static Analysis Basic-path Control-flow Graph Worstcase Timing Path Expression Hard Real-time Safety-critical Software Predicted Worst-case Execution Time Worst-case Execution Time Analysis Software Tool Suitable Bound |
| Content Type | Text |
| Resource Type | Article |
