complang Seminarliteratur 2007 S
complang Seminarliteratur 2007 S
A) Linear Flow Constraints
- Peter Puschner and Anton V. Schedl
Computing Maximum Task Execution Times --
A Graph-Based Approach
Journal of Real-Time Systems, 1997, Vol.13, 67-91
- Yau-Tsun Steven Li and Sharad Malik
Performance Analysis of Embedded Software Using Implicit
Path Enumeration, Proc. 32nd ACM/IEEE Design
Automation Conference, 1995, 456-461
- Jakob Engblom and Andreas Ermedahl
Modeling Complex Flows for Worst-Case Execution
Time Analysis, Proc. 21st IEEE Real-Time Systems Symposium (RTSS),
2000
- Florian Martin and Martin Alt and Reinhard Wilhelm and Christian
Ferdinand
Analysis of Loops,
Proc.7th International Conference on Compiler Construction,
1998,
Lecture Notes in Computer Science Vol.1383
B) Equations with Event Markers
- Moyer Chen
A Timing Analysis Language - (TAL),
Programmer's Manual, Dept. of Computer Science, University of Texas, 1987
- Aloysius K. Mok and Prasanna Amerasinghe and Moyer Chen
and Kamtorn Tantisirivat
Evaluating Tight Execution Time Bounds of Programs by
Annotations, Proc. 6th IEEE Worksop on Real-Time Operating Systems and
Software,1989, 74-80
C) Symbolic Annotations
- Johann Blieberger
Discrete Loops and Worst Case Performance
Computer Languages, 1994
Vol.20,3, 193-212
D) Regular Expressions
- Chang Y. Park
Predicting Program Execution Times by Analyzing Static and
Dynamic Program Paths, Real-Time Systems, 1993, Vol.5,1, 31-62
- Chang Y. Park and Alan C. Shaw
Experiments with a Program Timing Tool based on a
Source-Level Timing Schema, Computer, 1991, Vol.24,5, 48-57
- Alan C. Shaw
Reasoning about time in higher level language software, IEEE Transactions on Software Engineering, 1989,
Vol.15,7, 875-889
E) The Bound-T Annotation Language
- Niklas Holsti and Thomas Langbacka and Sami Saarinen
Worst-Case Execution Time Analysis for Digital Signal
Processors, European Signal Processing Conference 2000 (EUSIPCO 2000),
Space Systems Finland Ltd
F) Data Value Assertions
- Roderick Chapman and Alan Burns and Andy Wellings
Integrated Program Proof and Worst-case Timing Analysis of SPARK
Ada, Proc. ACM Workshop on Language, Compiler and Tool Support for
Real-time Systems, 1994, K1-K11
- Roderick Chapman and Alan Burns and Andy Wellings
Combining Static Worst-Case Timing Analysis and Program
Proof, Real-Time Systems, 1996, Vol.11,2, 145-171