AutoProofmeets some verification challenges
AutoProofis an automatic verifier for functional properties of programs written in Eiffel. This paper illustrates some of AutoProofs capabilities when tackling the three challenges of the VerifyThis verification competition held at FM 2012, as well as on three other problems proposed in related events. AutoProofs design focuses on making it practically applicable with reduced user effort. Tackling the challenges demonstrates to what extent this design goal is met in the current implementation: while some of AutoProofs current limitations prevent us from verifying the complete specification of the prefix sum and binary search tree algorithms, we can still prove some partial properties on interesting special cases, but with the advantage of requiring little or no specification.
verification challenges eiffel automated program verification experience report functional correctness