Symbolic worst case execution times

DOI10.1007/978-3-642-23283-1_5MaRDI QIDQ3105743zbMATH OpenOpenAlexFDO

Authors Ernst Althaus, Sebastian Altmeyer, Rouven Naujoks

Publication date 6 January 2012

Published in Theoretical Aspects of Computing – ICTAC 2011 (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-642-23283-1_5

Mathematics Subject Classification ID

Performance evaluation, queueing, and scheduling in the context of computer systems (68M20)

Recommendations

• Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution
• Calculation of symbolic running times in embedded real-time systems.
• Linear approximation of execution-time constraints
• Data-flow frameworks for worst-case execution time analysis
• Symbolic WCET analysis of programs containing input-dependent branches

Cites work

• scientific article; zbMATH DE number 3177183 (Why is no real title available?)
• scientific article; zbMATH DE number 2017362 (Why is no real title available?)
• Parametric integer programming

Cited in

(8)

• Data-flow frameworks for worst-case execution time analysis
• Criticality: static profiling for real-time programs
• Refinement of worst-case execution time bounds by graph pruning
• Bounding the execution time of software in realtime systems
• scientific article; zbMATH DE number 1107559 (Why is no real title available?)
• Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution
• Symbolic WCET analysis of programs containing input-dependent branches
• Calculation of symbolic running times in embedded real-time systems.

This page was built for publication: Symbolic worst case execution times

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