Segment Abstraction for Worst-Case Execution Time Analysis

DOI10.1007/978-3-662-46669-8_5MaRDI QIDQ2802432zbMATH OpenOpenAlexFDO

Authors Pavol Černý, Laura Kovács, Arjun Radhakrishna, Jakob Zwirchmayr, Thomas A. Henzinger

Publication date 26 April 2016

Published in Programming Languages and Systems (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-662-46669-8_5

Mathematics Subject Classification ID

Data structures (68P05) Mathematical aspects of software engineering (specification, verification, metrics, requirements, etc.) (68N30)

Recommendations

• Data-flow frameworks for worst-case execution time analysis
• Timing analysis of parallel software using abstract execution

Cited in

(11)

• On the modular integration of abstract semantics for WCET analysis
• Data-flow frameworks for worst-case execution time analysis
• scientific article; zbMATH DE number 7204445 (Why is no real title available?)
• Accelerating worst case execution time analysis of timed automata models with cyclic behaviour
• Quantum weakest preconditions for reasoning about expected runtimes of quantum programs
• scientific article; zbMATH DE number 2017362 (Why is no real title available?)
• Symbolic WCET analysis of programs containing input-dependent branches
• Calculating WCET estimates from timed traces
• New Developments in WCET Analysis
• Refinement of worst-case execution time bounds by graph pruning
• Static analysis of binary code with memory indirections using polyhedra

This page was built for publication: Segment Abstraction for Worst-Case Execution Time Analysis

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