Realistic Worst-Case Execution Time Analysis in the Context of Pervasive System Verification

DOI10.1007/978-3-540-71322-7_3MaRDI QIDQ3593068zbMATH OpenOpenAlexFDO

Authors Steffen Knapp, Wolfgang J. Paul

Publication date 24 September 2007

Published in Program Analysis and Compilation, Theory and Practice (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-540-71322-7_3

Mathematics Subject Classification ID

Distributed systems (68M14) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30) Specification and verification (program logics, model checking, etc.) (68Q60)

Recommendations

• Correct Hardware Design and Verification Methods
• Pervasive verification of distributed real-time systems
• Correct Hardware Design and Verification Methods
• Replacing conjectures by positive knowledge: inferring proven precise worst-case execution time bounds using symbolic execution
• Scalable and precise refinement of cache timing analysis via path-sensitive verification

Cited in

(4)

• Proving the correctness of client/server software
• Pervasive verification of distributed real-time systems
• Correct Hardware Design and Verification Methods
• Proving fairness and implementation correctness of a microkernel scheduler

This page was built for publication: Realistic Worst-Case Execution Time Analysis in the Context of Pervasive System Verification

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