What is the main purpose of competitions?

Competitions are widely acknowledged as a means of improving the available tools, increasing the visibility of their strengths, and establishing a publicly available set of benchmark problems.

What is the code8 that is used to solve the LRS problem?

The attached Java code8 contains an implementation of a suffix array (SuffixArray.java), consisting essentially of a lexicographical comparison on arrays, a sorting routine, and LCP.

How does the VeriCors tool set encode the tree delete challenge?

They illustrate their encoding by verifying the tree delete challenge, using a loop invariant that is similar to the loop specification used by VeriFast.

What were the teams encouraged to use?

Particularly encouraged were:– student teams (including PhD students), – non-developer teams using a tool someone else developed, and – several teams using the same tool.

What is the main point of the Why3 paper?

The Why3 paper makes an observation that a facility to “debug the specifications” would have assisted greatly in developing a solution.

What is the efficient solution to this challenge?

The KIV team is the only team that applied “forward reasoning”, which is the most efficient solution to this challenge, to the full extent.

What are the success factors of deductive verifiers?

Success factors include support for verifying C programs (as otherwise time was lost translating the subject program into the language supported by the verifier) and finding the bug first (either by testing or by using automatic verification as an auxiliary technique).

Open AccessJournal Article10.1007/S10009-015-0396-8

VerifyThis 2012

Marieke Huisman, +2 more

- 01 Nov 2015

Vol. 17, Iss: 6, pp 647-657

TL;DR: An overview of the VerifyThis competition series, an account of related activities in the area, and an overview of solutions submitted to the organizers both during and after the 2012 competition are provided.

Abstract: VerifyThis 2012 was a 2-day verification competition that took place as part of the International Symposium on Formal Methods (FM 2012) on August 30---31, 2012, in Paris, France. It was the second installment in the VerifyThis series. After the competition, an open call solicited contributions related to the VerifyThis 2012 challenges and overall goals. As a result, seven papers were submitted and, after review and revision, included in this special issue. In this introduction to the special issue, we provide an overview of the VerifyThis competition series, an account of related activities in the area, and an overview of solutions submitted to the organizers both during and after the 2012 competition. We conclude with a summary of results and some remarks concerning future installments of VerifyThis.

AI Agents for this Paper

Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps

Most frequently asked questions

1. What are the contributions in "Verifythis 2012" ?

In this introduction to the special issue, the authors provide an overview of the VerifyThis competition series, an account of related activities in the area, and an overview of solutions submitted to the organizers both during and after the 2012 competition.

2. What is the advantage of the point-and-click style?

While the textual interaction paradigm has advantages w.r.t. effort reuse across proof iterations, the point-and-click style can at times offer greater flexibility.

3. What is the expression for the common prefix property?

The authors found the common prefix property was best expressed in Dafny syntaxa[x..x+l] == a[y..y+l],which eliminatedmuchof the quantifier verbosity.

4. What is the key to achieving this goal?

An important technique for achieving this goal is formal verification: demonstrating in amathematically rigorous andmachine-checkedway that a programsatisfies a given formal specification of what is considered correct behavior.

Fig. 1 Upsweep and downsweep phases of the prefix sum calculation, picture taken from [11]

Citations

•Book Chapter•10.1007/978-3-030-72013-1_24

Software Verification: 10th Comparative Evaluation (SV-COMP 2021)

Dirk Beyer

- 27 Mar 2021

TL;DR: SV-COMP 2021 as mentioned in this paper was the 10th edition of the competition on software verification, which is an annual comparative evaluation of fully automatic software verifiers for C and Java programs.

...read moreread less

•Journal Article•10.1007/S10009-016-0438-X

VerifyThis 2015 A program verification competition

Marieke Huisman, +3 more

- 18 Aug 2015

- International Journal on Software Tools ...

TL;DR: An overview is provided of the VerifyThis 2016 event, the challenges that were posed during the competition, and a high-level overview of the solutions to these challenges.

...read moreread less

•Book Chapter•10.1007/978-3-030-17502-3_11

International Competition on Software Testing (Test-Comp)

Dirk Beyer

- 06 Apr 2019

TL;DR: Test-Comp 2019 is presented as part of TOOLympics 2019, a satellite event of the conference TACAS, a comparative evaluation of automatic tools for software test generation.

...read moreread less

•Book Chapter•10.1007/978-3-030-45234-6_25

Second Competition on Software Testing: Test-Comp 2020

Dirk Beyer

- 25 Apr 2020

TL;DR: The 2020 Test-Comp 2020 was a series of comparative evaluations of fully automatic software test-case generators for C programs, and has a strong focus on replicability of its results.

...read moreread less

Proceedings Article•10.1145/3092282.3098206

The RERS 2017 challenge and workshop (invited paper)

Marc Jasper, +7 more

- 13 Jul 2017

TL;DR: The first half of the RERS workshop focused on the 2017 benchmark profiles, the evaluation of the received contributions, and short presentations of each participating team, while the second half comprised discussions about attractive problem scenarios for future benchmarks.

...read moreread less

...

Expand

References

Book Chapter•10.1007/978-3-642-17511-4_20

Dafny: an automatic program verifier for functional correctness

K. Rustan M. Leino

- 25 Apr 2010

TL;DR: A tour of the language and verifier Dafny, which has been used to verify the functional correctness of a number of challenging pointer-based programs, is given and the full functional specification of the Schorr-Waite algorithm is shown.

...read moreread less

•Book Chapter•10.1007/978-3-642-37036-6_8

Why3: where programs meet provers

Jean-Christophe Filliâtre, +1 more

- 16 Mar 2013

TL;DR: Why3, a tool for deductive program verification, and WhyML, its programming and specification language, are presented, a first-order language with polymorphic types, pattern matching, and inductive predicates.

...read moreread less

606

•10.1184/R1/6608579.V1

Prefix sums and their applications

Guy E. Blelloch

- 01 May 2004

TL;DR: This paper defines the all-prefix-sums operation, shows how to implement it on a P-RAM and illustrates many applications of the operation.

...read moreread less

600

Journal Article•10.1007/S00165-014-0326-7

Frama-C: A software analysis perspective

Florent Kirchner, +4 more

- 01 May 2015

- Formal Aspects of Computing

TL;DR: A consolidated view of the Frama-C platform, its main and composite analyses, and some of its industrial achievements are presented.

...read moreread less

536

•Book

Synthesis of Parallel Algorithms

John H. Reif

- 01 Sep 1993

TL;DR: These thorough but introductory presentations demonstrate the most important algorithmic techniques and their use in exposing the hidden parallelism within problems.

...read moreread less

472

...

Expand

VerifyThis 2012

Chat with Paper

AI Agents for this Paper

Most frequently asked questions

1. What are the contributions in "Verifythis 2012" ?

2. What is the advantage of the point-and-click style?

3. What is the expression for the common prefix property?

4. What is the key to achieving this goal?

5. What is the main purpose of competitions?

6. What is the code8 that is used to solve the LRS problem?

7. How does the VeriCors tool set encode the tree delete challenge?

8. What were the teams encouraged to use?

9. What is the main point of the Why3 paper?

10. What is the efficient solution to this challenge?

11. What are the success factors of deductive verifiers?

Figures

Citations

Software Verification: 10th Comparative Evaluation (SV-COMP 2021)

VerifyThis 2015 A program verification competition

International Competition on Software Testing (Test-Comp)

Second Competition on Software Testing: Test-Comp 2020

The RERS 2017 challenge and workshop (invited paper)

References

Dafny: an automatic program verifier for functional correctness

Why3: where programs meet provers

Prefix sums and their applications

Frama-C: A software analysis perspective

Synthesis of Parallel Algorithms

Related Papers (5)

Rigorous examination of reactive systems

Competition on software verification

Software Verification and Verifiable Witnesses

Second competition on software verification

Competition on Software Verification (SV-COMP)