Deriving annotations for tight calculation of execution time

DOI10.1007/BFB0002886MaRDI QIDQ4537143zbMATH OpenFDO

Authors Andreas Ermedahl, Jan Gustafsson

Publication date 25 June 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/BFB0002886

Mathematics Subject Classification ID

Theory of software (68N99) Computing methodologies and applications (68U99)

Recommendations

• A theory for execution-time derivation in real-time programs
• New Developments in WCET Analysis
• Calculating WCET estimates from timed traces
• Linear approximation of execution-time constraints
• Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution

Cited in

(5)

• A theory for execution-time derivation in real-time programs
• Binding-Time Annotations without Binding-Time Analysis
• Computation of WCET by detecting feasible paths
• A compiler framework for the reduction of worst-case execution times
• A method for computing the number of iterations in data dependent loops

This page was built for publication: Deriving annotations for tight calculation of execution time

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q4537143)