AutoProof meets some verification challenges

VerifyThis 2012

DOI: 10.1007/s10009-014-0300-y

Cite this article as:
Tschannen, J., Furia, C.A. & Nordio, M. Int J Softw Tools Technol Transfer (2015) 17: 745. doi:10.1007/s10009-014-0300-y
  • 98 Downloads

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.

Keywords

Automated Program verification Verification challenges Experience report Eiffel Functional correctness 

Copyright information

© Springer-Verlag Berlin Heidelberg 2014

Authors and Affiliations

  • Julian Tschannen
    • 1
  • Carlo A. Furia
    • 1
  • Martin Nordio
    • 1
  1. 1.Chair of Software EngineeringETH ZurichZurichSwitzerland

Personalised recommendations