This paper presents a proof system for reasoning about execution time bounds core imperative programming language. Proof systems are defined three different scenarios: approximations of the worst-case time, exact reasoning, and less pessimistic estimation using amortized analysis. We define Hoare logic cases prove its soundness with respect to an annotated cost-aware operational semantics. Fina...

In an embedded real-time system (ERTS), tasks (software) are typically executed on a multicore shared-memory platform (hardware). The number of cores is usually small, contrasted with larger complex that share data to collaborate. Since most ERTSs safety-critical, it crucial rigorously verify their software against various requirements under the actual hardware constraints (concurrent access da...

This essay is divided in four parts: In section (I) I explain why I think detecting hot-spots in verification is complicated and in particular, more complicated than detection when developing crude software. In section (II) I introduce the factors I think mostly affect performance in verification. In section (III) I propose a method to find functions that are most promising to be optimized. Fin...