Towards a Flow Analysis for Embedded System C Programs

Authors:
Jan Gustafsson;Andreas Ermedahl;Björn Lisper
Affiliations:
Dept. of Computer Science and Electronics, M§alardalen University, V§aster¢as, Sweden;Dept. of Computer Science and Electronics, M§alardalen University, V§aster¢as, Sweden;Dept. of Computer Science and Electronics, M§alardalen University, V§aster¢as, Sweden
Venue:
WORDS '05 Proceedings of the 10th IEEE International Workshop on Object-Oriented Real-Time Dependable Systems
Year:
2005

Citing 0
Cited 7

Faster WCET flow analysis by program slicing

Proceedings of the 2006 ACM SIGPLAN/SIGBED conference on Language, compilers, and tool support for embedded systems
The worst-case execution-time problem—overview of methods and survey of tools

ACM Transactions on Embedded Computing Systems (TECS)
A useful bounded resource functional language

SOFSEM'08 Proceedings of the 34th conference on Current trends in theory and practice of computer science
Symbolic simulation on complicated loops for WCET path analysis

EMSOFT '11 Proceedings of the ninth ACM international conference on Embedded software
Failure-Dependent timing analysis - a new methodology for probabilistic worst-case execution time analysis

MMB'12/DFT'12 Proceedings of the 16th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
Fully Bounded Polyhedral Analysis of Integers with Wrapping

Electronic Notes in Theoretical Computer Science (ENTCS)
Path-sensitive resource analysis compliant with assertions

Proceedings of the Eleventh ACM International Conference on Embedded Software

Quantified Score

Hi-index	0.00

Visualization

Abstract

Reliable program Worst-Case Execution Time (WCET) estimates are a key component when designing and verifying real-time systems. One way to derive such estimates is by static WCET analysis methods, relying on mathematical models of the software and hardware involved. This paper describes an approach to static flow analysis for deriving information on the possible execution paths of C programs. This includes upper bounds for loops, execution dependencies between different code parts and safe determination of possible pointer values. The method builds upon abstract interpretation, a classical program analysis technique, which is adopted to calculate flow information and to handle the specific properties of the C programming language.