Abstract

this paper self-contained, a simplified version of the theory is outlined in 1.7. The general idea of mechanising Hoare logics by generating verification conditions and then feeding them to a theorem prover is standard [3, 5, 13]. The particular approach used here was originally developed for non-timed Hoare logics [4]. Verification conditions are described in 1.6. The main contribution of this paper is to make the use of STAs for reasoning about data-processing algorithms much easier by defining a Hoare logic on top of them. 1.3 Timed Hoare specifications

Citations