A hoare-like proof system for analysing the computation time of programs |
| |
Affiliation: | Institute of Electronic Systems, Aalborg University Centre, DK-9000 Aalborg, Denmark |
| |
Abstract: | Versions of Hoare logic have been introduced to prove partial and total correctness properties of programs. In this paper it is shown how a Hoare-like proof system for while programs may be extended to prove properties of the computation time as well. It should be stressed that the system does not require the programs to be modified by inserting explicit operations upon a clock variable. We generalize the notions of arithmetically sound and complete and show that the proof system satisfies these. Also we derive formal rules corresponding to the informal rules for determining the computation time of while programs. The applicability of the proof system is illustrated by an example, the bubble sorting algorithm. |
| |
Keywords: | |
本文献已被 ScienceDirect 等数据库收录! |
|