Performance analysis of embedded software using implicit path enumeration
DAC '95 Proceedings of the 32nd annual ACM/IEEE Design Automation Conference
Bounding Pipeline and Instruction Cache Performance
IEEE Transactions on Computers
Worst Case Execution Time Analysis for a Processor withBranch Prediction
Real-Time Systems - Special issue on worst-case execution-time analysis
Using symbolic execution for verifying safety-critical systems
Proceedings of the 8th European software engineering conference held jointly with 9th ACM SIGSOFT international symposium on Foundations of software engineering
Testing real-time systems using genetic algorithms
Software Quality Control
Declarative Bias in Equation Discovery
ICML '97 Proceedings of the Fourteenth International Conference on Machine Learning
ILP '96 Selected Papers from the 6th International Workshop on Inductive Logic Programming
A study of branch prediction strategies
ISCA '81 Proceedings of the 8th annual symposium on Computer Architecture
Analysis of the Execution Time Unpredictability caused by Dynamic Branch Prediction
RTAS '03 Proceedings of the The 9th IEEE Real-Time and Embedded Technology and Applications Symposium
Dynamically discovering likely program invariants
Dynamically discovering likely program invariants
Search-based software test data generation: a survey: Research Articles
Software Testing, Verification & Reliability
Hi-index | 0.00 |
The problem of determining the Worse Case Execution Time (WCET) of a piece of code is a fundamental one in the Real Time Systems community. Existing methods either try to gain this information by analysis of the program code or by running extensive timing analyses. This paper presents a new approach to the problem based on using Machine Learning in the form of ILP to infer program properties based on sample executions of the code. Additionally, significant improvements in the range of functions learnable and the time taken for learning can be made by the application of more advanced ILP techniques.