Mechanization of a proof of string-preprocessing in Boyer-Moore's pattern matching algorithm

Besta, M.; Stomp, Frank A.

doi:10.1109/iceccs.2002.1181499

Cited by 3 publications

(1 citation statement)

References 13 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The safety property and the two liveness properties mentioned above allow us to conclude that the preprocessing algorithm meets its specification. In [3] we have focused on the mechanization of the safety proofs. In the current paper we discuss the mechanization of all the safety and liveness proofs in detail.…”

Section: Introductionmentioning

confidence: 99%

A Complete Mechanization of Correctness of a String-Preprocessing Algorithm

Besta

Stomp

2005

Form Method Syst Des

View full text Add to dashboard Cite

We report on mechanization of a correctness proof of a string-preprocessing algorithm. This preprocessing algorithm is employed in Boyer-Moore's pattern matching algorithm. The mechanization is carried out using the PVS system. The correctness proof being mechanized has been formulated in Linear Time Temporal Logic. It consists of fourteen lemmata which are related to safety properties and two additional lemmata dealing with liveness properties. The entire mechanization of the safety and liveness parts has been completed. Several small errors and omissions were found in the handwritten proof and corrected. Yet, the manual correctness proof of the string-preprocessing algorithm was found to satisfy the usual mathematical validity. We conclude that the string-preprocessing algorithm in Boyer-Moore's pattern matching algorithm, corrected a number of times because of flaws, does not contain any more undiscovered errors.

show abstract

Section: Introductionmentioning

confidence: 99%