A complete mechanization of correctness of a string-preprocessing algorithm
Formal Methods in System Design
| Hi-index | 0.00 |
We report on a mechanization of a correctness proof ofa string-preprocessing algorithm. This preprocessing algorithmis employed in Boyer-Moore's pattern matching algorithm.The mechanization is carried out using the PVS system.The correctness proof being mechanized has been formulatedin Linear Time Temporal Logic. It consists of fourteenlemmata which are related to safety properties and twoadditional lemmata dealing with liveness properties. Theentire mechanization of the safety and liveness parts hasbeen completed. In this paper we mainly focus on mechanizationof the safety part. In a future paper we will addressour proof of the liveness part in more detail.