2016
DOI: 10.1007/s10009-016-0438-x
|View full text |Cite
|
Sign up to set email alerts
|

VerifyThis 2015

Abstract: VerifyThis 2015 was a one-day program verification competition which took place on April 12th, 2015 in London, UK, as part of the European Joint Conferences on Theory and Practice of Software (ETAPS 2015). It was the fourth instalment in the VerifyThis competition series. This article provides an overview of the VerifyThis 2015 event, the challenges that were posed during the competition, and a high-level overview of the solutions to these challenges. It concludes with the results of the competition and some i… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1

Citation Types

0
3
0

Year Published

2017
2017
2020
2020

Publication Types

Select...
6
1

Relationship

5
2

Authors

Journals

citations
Cited by 11 publications
(3 citation statements)
references
References 20 publications
0
3
0
Order By: Relevance
“…We illustrate this on the parallel GCD challenge from the VerifyThis 2015 program verification competition [11]. The standard sequential Euclidean algorithm is described as a function gcd which, given two positive integers a and b, gcd To prove that the parallel algorithm computes gcd(a, b) we first model gcd as a process algebra term, named pargcd, by using two actions, named decrX and decrY.…”
Section: Verification Highlightsmentioning
confidence: 99%
“…We illustrate this on the parallel GCD challenge from the VerifyThis 2015 program verification competition [11]. The standard sequential Euclidean algorithm is described as a function gcd which, given two positive integers a and b, gcd To prove that the parallel algorithm computes gcd(a, b) we first model gcd as a process algebra term, named pargcd, by using two actions, named decrX and decrY.…”
Section: Verification Highlightsmentioning
confidence: 99%
“…This progress can be witnessed for example by the development of large, non-trivial case studies, such as the verification of the Tim-Sort implementation in the shipped Java libraries [9], or the parallel nested depth first search [23]. Another evidence of the progress of program verification tools are the outcomes of program competitions, such as VerifyThis [12][13][14][15][16] and VSComp [8,18], where we see a steady increase in the complexity of challenges that have been posed (and solved). However, program verification competitions encourage competition rather than collaboration, and moreover they always impose a strict time constraint, ranging from 90 min per challenge (Ver-ifyThis), to a time-span of 2 days for 4 challenges (VSComp).…”
Section: Introductionmentioning
confidence: 99%
“…In the formal methods community similar kind of contests exist, for instance the VerifyThis [5] challenge. However, this contest relies on physical presence of participants and manual grading of solutions.…”
mentioning
confidence: 99%