Refinement of worst-case execution time bounds by graph pruning

DOI10.1016/J.CL.2014.09.001MaRDI QIDQ2339158zbMATH OpenOpenAlexFDO

Authors Florian Brandner, Alexander I. Jordan

Publication date 31 March 2015

Published in Computer Languages, Systems \& Structures (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/j.cl.2014.09.001

zbMATH Keywords

iterative refinementworst-case execution time analysisgraph pruning

Mathematics Subject Classification ID

Graph theory (including graph drawing) in computer science (68R10) 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
• Segment Abstraction for Worst-Case Execution Time Analysis
• Scalable and precise refinement of cache timing analysis via path-sensitive verification
• New Developments in WCET Analysis
• Symbolic worst case execution times

Cites work

• scientific article; zbMATH DE number 1324833 (Why is no real title available?)
• Criticality: static profiling for real-time programs
• Programming Languages and Systems

Cited in

(2)

• Criticality: static profiling for real-time programs
• Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution

This page was built for publication: Refinement of worst-case execution time bounds by graph pruning

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