Symbolic WCET analysis of programs containing input-dependent branches

zbMATH Open1098.68551MaRDI QIDQ5478263FDOQ5478263

Authors: Mengluo Ji, Zhichang Qi, Huaimin Wang 

Publication date: 12 July 2006

Recommendations

• Data-flow frameworks for worst-case execution time analysis
• Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution
• Symbolic Loop Bound Computation for WCET Analysis
• Symbolic worst case execution times
• Segment Abstraction for Worst-Case Execution Time Analysis

zbMATH Keywords

real-time systemsoftware engineeringprogram analysis

Mathematics Subject Classification ID

Theory of software (68N99)

Cited In (4)

• Symbolic worst case execution times
• Symbolic Loop Bound Computation for WCET Analysis
• Data-flow frameworks for worst-case execution time analysis
• Calculation of symbolic running times in embedded real-time systems.

This page was built for publication: Symbolic WCET analysis of programs containing input-dependent branches

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