Counting solutions to Presburger formulas: how and why
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
Performance analysis of embedded software using implicit path enumeration
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Component-based software engineering: putting the pieces together
Component-based software engineering: putting the pieces together
OM '01 Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems
Automatic discovery of linear restraints among variables of a program
POPL '78 Proceedings of the 5th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
POPL '77 Proceedings of the 4th ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Deriving Annotations for Tight Calculation of Execution Time
Euro-Par '97 Proceedings of the Third International Euro-Par Conference on Parallel Processing
Scope-Tree: A Program Representation for Symbolic Worst-Case Execution Time Analysis
ECRTS '02 Proceedings of the 14th Euromicro Conference on Real-Time Systems
SaveCCM - A Component Model for Safety-Critical Real-Time Systems
EUROMICRO '04 Proceedings of the 30th EUROMICRO Conference
Component-based software engineering for embedded systems
Proceedings of the 27th international conference on Software engineering
Applying Static WCET Analysis to Automotive Communication Software
ECRTS '05 Proceedings of the 17th Euromicro Conference on Real-Time Systems
Higher-Order and Symbolic Computation
Generalizing parametric timing analysis
Proceedings of the 2007 ACM SIGPLAN/SIGBED conference on Languages, compilers, and tools for embedded systems
The worst-case execution-time problem—overview of methods and survey of tools
ACM Transactions on Embedded Computing Systems (TECS)
Parametric Timing Analysis for Complex Architectures
RTCSA '08 Proceedings of the 2008 14th IEEE International Conference on Embedded and Real-Time Computing Systems and Applications
SPEED: precise and efficient static estimation of program computational complexity
Proceedings of the 36th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Static timing analysis of real-time operating system code
ISoLA'04 Proceedings of the First international conference on Leveraging Applications of Formal Methods
| Hi-index | 0.00 |
Static WCET analysis is a process dedicated to derive a safe upper bound of the worst-case execution time of a program. In many real-time systems, however, a constant global WCET estimate is not always so useful since a program may behave very differently depending on its configuration or mode. A parametric WCET analysis derives the upper bound as a formula rather than a constant. This paper presents a new algorithm that can obtain a safe parametric estimate of the WCET of a program. This algorithm is evaluated on a large set of benchmarks and compared to a previous approach to parametric WCET calculation. The evaluation shows that the new algorithm, to the cost of some imprecision, scales much better and can handle more realistic programs than the previous approach.