2016

The competition report can be found Download here (PDF, 377 KB)

Winners

• Best problem submission: Daniel Grahl, for suggesting "Strassen's algorithm", which inspired the matrix multiplication challenge.
  
• Distinguished user-assistance tool feature: Alexander J. Summers and Malte Schwerhoff (Viper) for their support of quantified permissions.
  
• Best student team (2x): Martin Clochard (Why3), Léon Gondelman & Mário Pereira (Why3)
  
• Best team: Bart Jacobs (VeriFast)

Challenges

Download Challenge 1 - Matrix Multiplication (PDF, 69 KB)

Download Challenge 2 - Binary Tree Traversal (PDF, 96 KB)

Download Challenge 3 - Static Tree Barriers (PDF, 108 KB)

Solutions

This page contains links to the solutions developed by participants during the competition, and polished afterwards. Solutions may be updated as time goes on.

• external page Gidon Ernst (KIV)
• Bart Jacobs (VeriFast): files attached to this page
  
  • Download matmul.java (JAVA, 5 KB) - Challenge 1: Task 1
  • Download tree_barrier.java (JAVA, 10 KB) - Challenge 2: all tasks, but not the bonus
  • Download tree_traversal.java (JAVA, 4 KB) - Challenge 3: Task 1 

See also Bart Jacob's external page paper in the proceedings of FTfJP 2016.

• Luca Weibel and Christiaan Dirkx (Dafny) - Download Challenge 1 (DFY, 2 KB) attached to this page
• Combined solutions of external page Martin Clochard (Why3), Léon Gondelman & Mário Pereira (Why3)
• Jan Friso Groote (mCRL2) - Download Challenge1.zip (ZIP, 5 KB), Download Challenge2.zip (ZIP, 6 KB), Download Challenge3.zip (ZIP, 246 KB)
  
• Stephen Siegel (CIVL) - Challenge 1: Download task 1 (CVL, 2 KB), Download task 2 (CVL, 970 Bytes), Download task 3 (CVL, 5 KB), Download Challenge 2 (CVL, 2 KB), and Download Challenge 3 (CVL, 3 KB) attached to this page, see also Stephen Siegel's external page paper in Siglog (volume 4, number 2, April 2017)

The challenges will be published after the event.

RULES

1. Solutions are to be submitted per email.
   
2.  Submissions must state the version of the verification system used (for development versions, internal revision, timestamp, or similar unique id).
3. 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.
4. It is allowed to modify the verification system during the competition. This is to be noted in the solution(s)
5. All techniques used must be general-purpose, and are expected to extend usefully to new unseen problems
6. Internet access is allowed, but using the interget to search for problem solutions is not.
7. Involvement of other people beyond those on the team is not allowed.
8. 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.)