Segment Abstraction for Worst-Case Execution Time Analysis

DOI10.1007/978-3-662-46669-8_5zbMATH Open1335.68049OpenAlexW1774237421MaRDI QIDQ2802432FDOQ2802432

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

Recommendations

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

Mathematics Subject Classification ID

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

Cited In (11)

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

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)