AutoProof meets some verification challenges
| Autor: | Martin Nordio, Julian Tschannen, Carlo A. Furia |
|---|---|
| Rok vydání: | 2014 |
| Předmět: |
Functional verification
Computer science business.industry Programming language Automated Program verification Verification challenges Experience report Eiffel Functional correctness computer.software_genre Binary search tree Theory of computation Prefix sum Verification Software engineering business computer Software Information Systems computer.programming_language |
| Zdroj: | International Journal on Software Tools for Technology Transfer, 17 (6) |
| ISSN: | 1433-2787 1433-2779 |
| DOI: | 10.1007/s10009-014-0300-y |
| Popis: | 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. International Journal on Software Tools for Technology Transfer, 17 (6) ISSN:1433-2779 ISSN:1433-2787 |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|
Full text from SpringerLink