AutoProof meets some verification challenges
OPEN ACCESS
Author / Producer
Date
2015-11
Publication Type
Journal Article
ETH Bibliography
yes
Citations
Altmetric
OPEN ACCESS
Data
Rights / License
Abstract
AutoProof is an automatic verifier for functional properties of programs written in Eiffel. This paper illustrates some of AutoProof’s 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. AutoProof ’s 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 AutoProof’s 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.
Permanent link
Publication status
published
External links
Editor
Book title
Volume
17 (6)
Pages / Article No.
745 - 755
Publisher
Springer
Event
Edition / version
Methods
Software
Geographic location
Date collected
Date created
Subject
Automated Program verification; Verification challenges; Experience report; Eiffel; Functional correctness
Organisational unit
03594 - Meyer, Bertrand (emeritus)
Notes
It was possible to publish this article open access thanks to a Swiss National Licence with the publisher.