Graph algorithms and NP-completeness
Graph algorithms and NP-completeness
Compilers: principles, techniques, and tools
Compilers: principles, techniques, and tools
Real-time Euclid: a language for reliable real-time systems
IEEE Transactions on Software Engineering - Special issue on reliability and safety in real-time process control
Elimination algorithms for data flow analysis
ACM Computing Surveys (CSUR)
Theory of recursive functions and effective computability
Theory of recursive functions and effective computability
Algorithm design: a recursion transformation framework
Algorithm design: a recursion transformation framework
Algorithms
Reasoning About Time in Higher-Level Language Software
IEEE Transactions on Software Engineering
Calculating the maximum, execution time of real-time programs
Real-Time Systems
Object-oriented real-time language design: constructs for timing constraints
OOPSLA/ECOOP '90 Proceedings of the European conference on object-oriented programming on Object-oriented programming systems, languages, and applications
Properties of data flow frameworks: a unified model
Acta Informatica
Analyzing Hard-Real-Time Programs for Guaranteed Schedulability
IEEE Transactions on Software Engineering
A safe approximate algorithm for interprocedural aliasing
PLDI '92 Proceedings of the ACM SIGPLAN 1992 conference on Programming language design and implementation
Array privatization for parallel execution of loops
ICS '92 Proceedings of the 6th international conference on Supercomputing
Array-data flow analysis and its use in array privatization
POPL '93 Proceedings of the 20th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Journal of Algorithms
A partial evaluator for the Maruti hard real-time system
Real-Time Systems - Special issue: Real-time languages and language-level timing tools and analysis
Predicting program execution times by analyzing static and dynamic program paths
Real-Time Systems - Special issue: Real-time languages and language-level timing tools and analysis
Undecidability of static analysis
ACM Letters on Programming Languages and Systems (LOPLAS)
Interprocedural may-alias analysis for pointers: beyond k-limiting
PLDI '94 Proceedings of the ACM SIGPLAN 1994 conference on Programming language design and implementation
The undecidability of aliasing
ACM Transactions on Programming Languages and Systems (TOPLAS)
A retargetable technique for predicting execution time of code segments
Real-Time Systems - Special issue: dependability of real-time software
Performance analysis of embedded software using implicit path enumeration
LCTES '95 Proceedings of the ACM SIGPLAN 1995 workshop on Languages, compilers, & tools for real-time systems
PLDI '96 Proceedings of the ACM SIGPLAN 1996 conference on Programming language design and implementation
Discrete loops and worst case performance
Computer Languages
Worst-case space and time complexity of recursive procedures
Real-Time Systems
Combining static worst-case timing analysis and program proof
Real-Time Systems
Efficient program analysis using DJ graphs
Efficient program analysis using DJ graphs
Computing Maximum Task Execution Times — A Graph-BasedApproach
Real-Time Systems
Symbolic evaluation for parallelizing compilers
ICS '97 Proceedings of the 11th international conference on Supercomputing
A new framework for elimination-based data flow analysis using DJ graphs
ACM Transactions on Programming Languages and Systems (TOPLAS)
Global Data Flow Analysis and Iterative Algorithms
Journal of the ACM (JACM)
A Fast and Usually Linear Algorithm for Global Flow Analysis
Journal of the ACM (JACM)
A Unified Approach to Path Problems
Journal of the ACM (JACM)
Fast Algorithms for Solving Path Problems
Journal of the ACM (JACM)
Symbolic pointer analysis for detecting memory leaks
PEPM '00 Proceedings of the 2000 ACM SIGPLAN workshop on Partial evaluation and semantics-based program manipulation
Symbolic Cache Analysis for Real-Time Systems
Real-Time Systems - Special issue on worst-case execution-time analysis
A program data flow analysis procedure
Communications of the ACM
An axiomatic basis for computer programming
Communications of the ACM
Real-time properties of indirect recursive procedures
Information and Computation
A unified approach to global program optimization
POPL '73 Proceedings of the 1st annual ACM SIGACT-SIGPLAN symposium on Principles of programming languages
Constructing Predictable Real Time Systems
Constructing Predictable Real Time Systems
Concrete Math
Symbolic Reaching Definitions Analysis of Ada Programs
Ada-Europe '98 Proceedings of the 1998 Ada-Europe International Conference on Reliable Software Technologies
Symbolic Data Flow Analysis for Detecting Deadlocks in Ada Tasking Programs
Ada-Europe '00 Proceedings of the 5th Ada-Europe International Conference on Reliable Software Technologies
Integrating the timing analysis of pipelining and instruction caching
RTSS '95 Proceedings of the 16th IEEE Real-Time Systems Symposium
Symbolic Cache Analysis for Real-Time Systems
Real-Time Systems - Special issue on worst-case execution-time analysis
Real-time properties of indirect recursive procedures
Information and Computation
Automatic Accurate Cost-Bound Analysis for High-Level Languages
IEEE Transactions on Computers
Average case analysis of DJ graphs
Journal of Discrete Algorithms
A Framework for CFG-Based Static Program Analysis of Ada Programs
Ada-Europe '08 Proceedings of the 13th Ada-Europe international conference on Reliable Software Technologies
Eliminating redundant range checks in GNAT using symbolic evaluation
Ada-Europe'03 Proceedings of the 8th Ada-Europe international conference on Reliable software technologies
A new elimination-based data flow analysis framework using annotated decomposition trees
CC'07 Proceedings of the 16th international conference on Compiler construction
Advanced symbolic analysis for compilers: new techniques and algorithms for symbolic program analysis and optimization
Symbolic analysis of imperative programming languages
JMLC'06 Proceedings of the 7th joint conference on Modular Programming Languages
A symbolic analysis framework for static analysis of imperative programming languages
Journal of Systems and Software
| Hi-index | 0.00 |
The purpose of this paper is to introduce frameworks based on data-flow equations which estimate the worst-case execution time (WCET) of real-time programs. These frameworks allow several different WCET analysis techniques with various precisions, which range from naïve approaches to exact analysis, provided exact knowledge on the program behavior is available. In addition, data-flow frameworks can also be used for symbolic analysis based on information derived automatically from the source code of the program.