architectural Analysis Global Bound Analysis

B Reconstructs a control flow graph from the binary. B Determines invariants for the values in registers and in memory. B Determines constraints on the control flow, by B determining loop bounds, and B identifying infeasible paths. B Determines bounds on execution times of basic blocks. B Based on an abstract model of the microarchitecture, includ-ing detailed models of B the pipeline, and B the memory hierarchy. B Determines a worst-case path and an upper bound on the execution time. B Usually formulated as integer linear program. Jan Reineke Timing Analysis and Timing Predictability 2. April 2012 7 / 54 Reconstructs a control-flow graph from the binary. Determines invariants for the values in registers and in memory. Determines invariants on the control flow, by • Determining loop bounds, • Identifying infeasible paths. Determines bound on execution times of program fragments. Determines a worst-case path and an upper bound on the WCET