Share 'Refinement of Worst-Case Execution Time Bounds by Graph Pruning'
Florian Brandner and Alexander Jordan.
Refinement of Worst-Case Execution Time Bounds by Graph Pruning.
Computer Languages, Systems & Structures (COMLAN), 2014.
As real-time systems increase in complexity to provide more and more functionality and perform more demanding computations, the problem of statically analyzing the Worst-Case…
You can share this news item in two ways…
Share this link:
Send it with your computer's email program: Email this