2017
verifyThis 2017 was organized by Wojciech Mostowski, Mattias Ulbrich
The competition report can be found Downloadhere (PDF, 478 KB)vertical_align_bottom
Winners
Best Student Team: Joint winners
Tool: KIV
PhD Students: Jörg Pfähler & Stefan Bodenmüller, University of Augsburg
Tool: Why3
PhD Students: Mario Parreira Pereira & Raphael Rieu-Helft, LRI, Université Paris-Sud.
Best Overall Team:
Tool: Why3
Jean-Christophe Filliâtre, CNRS
Distinguished user-assistance tool feature:
Tool: CIVL
Feature: Comparison of two programs for functional equivalence
Stephen Siegel, University of Delaware
Best Challenge Submitted:
Radu Grigore, University of Kent
Tree Buffer Challenge, Based on his paper in CAV 2015
Challenges
The competition will offer a number of challenges presented in natural language and pseudo code.
Competition Challenges
Challenge 1: 11.00 - 12.30
DownloadChallenge Sheet (PDF, 88 KB)vertical_align_bottom
DownloadPseudocode (PDF, 35 KB)vertical_align_bottom
external pageLink to the JDK implementationcall_made
Additional Challenge:
In case you end up bored, here is a followup to the Why3-Challenge from Jean-Christophe's presentation: Let's go 2-dimensional.
DownloadChallenge Sheet (PDF, 87 KB)vertical_align_bottom
Challenge 3: 14.00 - 15.30
DownloadChallenge Sheet (PDF, 87 KB)vertical_align_bottom
Challenge 4: 16.00 - 17.30
DownloadChallenge Sheet (PDF, 92 KB)vertical_align_bottom
Solutions
1. Stephen Siegel (CIVL)
Downloadsolution challenge 1 (TXT, 6 KB)vertical_align_bottom, updated solution Downloadchallenge 1 (CVL, 2 KB)vertical_align_bottom
Downloadsolution challenge 3 (TXT, 10 KB)vertical_align_bottom
Downloadsolution challenge 4 (TXT, 7 KB)vertical_align_bottom
2. Jon Mediero Iturrioz (Dafny)
Downloadsolution challenge 1 (TXT, 1 KB)vertical_align_bottom
Downloadsolution challenge2 (TXT, 2 KB)vertical_align_bottom,
Downloadsolution challenge 3 (TXT, 2 KB)vertical_align_bottom
3. Lionel Blatter, Jean-Christophe Léchenet (Frama-C)
Downloadsolution challenge 1 (C, 5 KB)vertical_align_bottom, Downloadaddendum (PDF, 8 KB)vertical_align_bottom to solution challenge 1,
updated solution Downloadchallenge 1 (C, 9 KB)vertical_align_bottom
Downloadsolution challenge 2 (C, 3 KB)vertical_align_bottom, updated solution Downloadchallenge 2 (C, 3 KB)vertical_align_bottom
Downloadsolution challenge 3 (C, 3 KB)vertical_align_bottom
solution challenge 4 (Downloadcoq (V, 3 KB)vertical_align_bottom, DownloadFrama_C (C, 2 KB)vertical_align_bottom)
4. Mihai Herda (KeY)
Downloadsolution challenge 1 (JAVA, 3 KB)vertical_align_bottom
solution challenge 2 (Download1 (JAVA, 2 KB)vertical_align_bottom, Download2 (PROOF, 266 KB)vertical_align_bottom, Download3 (PROOF, 103 KB)vertical_align_bottom)
Downloadsolution challenge 3 (JAVA, 2 KB)vertical_align_bottom
5. Michael Kirsten, Jonas Schiffl (KeY)
Downloadsolution challenge 1 (JAVA, 2 KB)vertical_align_bottom (Downloadsignature (ASC, 836 Bytes)vertical_align_bottom), updated solution Downloadchallenge 1 (GZ, 1.4 MB)vertical_align_bottom, Downloadsignature (ASC, 834 Bytes)vertical_align_bottom,
Downloadsolution challenge 3 (JAVA, 3 KB)vertical_align_bottom (Downloadsignature (ASC, 836 Bytes)vertical_align_bottom, Downloadcomment (TXT, 408 Bytes)vertical_align_bottom)
Downloadsolution challenge 4 (JAVA, 3 KB)vertical_align_bottom (Downloadsignature (ASC, 836 Bytes)vertical_align_bottom)
6. Stefan Bodenmüller, Jörg Pfähler (KIV)
external pagesolution challenge 1call_made
Downloadsolution challenge 2 (TXT, 389 Bytes)vertical_align_bottom
external pagecompleted and updated solution for all challengescall_made
7. Marieke Huisman, Wytse Oortwijn (VerCors)
Downloadsolution challenge 1 (PVL, 3 KB)vertical_align_bottom
solution challenge 2 (Downloada (PVL, 2 KB)vertical_align_bottom, Downloadb (PVL, 1 KB)vertical_align_bottom) Downloadcomment (TXT, 142 Bytes)vertical_align_bottom
Downloadsolution challenge 4 (PVL, 3 KB)vertical_align_bottom
8. Jean-Christophe Filliâtre (Why3)
Downloadsolution challenge 1 (MLW, 4 KB)vertical_align_bottom, Downloadcomment (TXT, 156 Bytes)vertical_align_bottom,
Downloadsolution challenge 2 (MLW, 4 KB)vertical_align_bottom, Downloadcomment challenge2 (TXT, 438 Bytes)vertical_align_bottom
Downloadsolution challenge3 (MLW, 6 KB)vertical_align_bottom (DownloadKadane_2d (MLW, 3 KB)vertical_align_bottom) Downloadcomment (TXT, 471 Bytes)vertical_align_bottom
Downloadsolution challenge 4 (MLW, 4 KB)vertical_align_bottom (Downloadcomment (TXT, 374 Bytes)vertical_align_bottom)
9. Léon Gondelman, Marc Schoolderman (Why3)
Downloadsolution challenge 1 (MLW, 2 KB)vertical_align_bottom, (Downloadcomment (TXT, 358 Bytes)vertical_align_bottom)
Downloadsolution challenge 2 (MLW, 2 KB)vertical_align_bottom, (Downloadcomment (TXT, 131 Bytes)vertical_align_bottom)
Downloadsolution challenge 3 (MLW, 2 KB)vertical_align_bottom (Downloadcomment (TXT, 97 Bytes)vertical_align_bottom)
10. Mário Pereira, Raphael Rieu-Helft (Why3)
Downloadsolution challenge 1 (MLW, 2 KB)vertical_align_bottom
Downloadsolution challenge 3 (MLW, 4 KB)vertical_align_bottom,
updated solution Downloadchallenge 3 (MLW, 5 KB)vertical_align_bottom
Downloadsolution challenge 4 (MLW, 3 KB)vertical_align_bottom
Rules
Solutions are to be submitted per email to
- Submissions must state the version of the verification system used (for development versions, internal revision, timestamp, or similar unique id).
- The main rule of the competition is no cheating is allowed. The judges may penalize or disqualify entrants in case of unfair competition behavior and may adjust the competition rules to prevent future abuse.
- It is allowed to modify the verification system during the competition. This is to be noted in the solution(s)
- All techniques used must be general-purpose, and are expected to extend usefully to new unseen problems
- Internet access is allowed, but using the interget to search for problem solutions is not.
- Involvement of other people beyond those on the team is not allowed.
- While care is taken to ensure correctness of the reference implementations supplied with problem descriptions, the organizers do not guarantee that they are indeed correct.
(We acknowledge Geoff Sutcliffe for inspiring/suggesting some of these rules.)