Artigo Acesso aberto Revisado por pares

Implementation-level verification of algorithms with KeY

2013; Springer Science+Business Media; Volume: 17; Issue: 6 Linguagem: Inglês

10.1007/s10009-013-0293-y

ISSN

1433-2787

Autores

Daniel Bruns, Wojciech Mostowski, Mattias Ulbrich,

Tópico(s)

Security and Verification in Computing

Resumo

We give an account on the authors’ experience and results from the software verification competition held at the Formal Methods 2012 conference. Competitions like this are meant to provide a benchmark for verification systems. It consisted of three algorithms which the authors have implemented in Java, specified with the Java Modeling Language, and verified using the KeY system. Building on our solutions, we argue that verification systems which target implementations in real-world programming languages better have powerful abstraction capabilities. Regarding the KeY tool, we explain features which, driven by the competition, have been freshly implemented to accommodate for these demands.

Referência(s)