The VerCors project

Amighi, Afshin; Blom, Stefan; Huisman, Marieke; Zaharieva-Stojanovski, Marina

doi:10.1145/2103776.2103785

Cited by 15 publications

(4 citation statements)

References 53 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…The specifications are readable even without the code, and therefore can be used as formally written documentation. Future Work The work described here are only the first steps in the VerCors project [1], and there is still much work to be done in the future. A first important step is to develop tool support, so that the history-based specifications can be validated w.r.t.…”

Section: Discussionmentioning

confidence: 99%

“…Furthermore, we claim that the history pattern is also useful for specifying other concurrent data structures; in particular we have also specified the ConcurrentHashMap using the same idea. Support to reason about historybased specifications will be integrated into the tool set that is currently being developed as part of the VerCors project [1] (Verification of Concurrent Data Structures).…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

A History of BlockingQueues

Zaharieva-Stojanovski¹,

Huisman²,

Blom³

2012

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

This paper describes a way to formally specify the behaviour of concurrent data structures. When specifying concurrent data structures, the main challenge is to make specifications stable, i.e., to ensure that they cannot be invalidated by other threads. To this end, we propose to use history-based specifications: instead of describing method behaviour in terms of the object's state, we specify it in terms of the object's state history. A history is defined as a list of state updates, which at all points can be related to the actual object's state. We illustrate the approach on the BlockingQueue hierarchy from the java.util.concurrent library. We show how the behaviour of the interface BlockingQueue is specified, leaving a few decisions open to descendant classes. The classes implementing the interface correctly inherit the specifications. As a specification language, we use a combination of JML and permission-based separation logic, including abstract predicates. This results in an abstract, modular and natural way to specify the behaviour of concurrent queues. The specifications can be used to derive high-level properties about queues, for example to show that the order of elements is preserved. Moreover, the approach can be easily adapted to other concurrent data structures

show abstract

Section: Discussionmentioning

confidence: 99%

Section: Introductionmentioning

confidence: 99%

A History of BlockingQueues

Zaharieva-Stojanovski¹,

Huisman²,

Blom³

2012

Electron. Proc. Theor. Comput. Sci.

Self Cite

View full text Add to dashboard Cite

show abstract

“…In another line of work, the focus is on developing practical techniques to reason about commonly used programs, using various synchronisation methods, support for dynamic thread creation, reentrant locks etc. This has been the focus of our work on the VerCors tool set [3][4][5]14], where we developed techniques (with tool support) to reason about multi-threaded Java and OpenCL programs. This is also the aim of the VeriFast tool, for verification of single-and multithreaded C and Java programs [39,65] and the Viper framework, which provides support for separation logic-based reasoning for a low-level intermediate language [43,51].…”

Section: Verification Of Concurrent Softwarementioning

confidence: 99%

Towards Reliable Concurrent Software

Huisman

Joosten

2018

Principled Software Development

Self Cite

View full text Add to dashboard Cite

As the use of concurrent software is increasing, we urgently need techniques to establish the correctness of such applications. Over the last years, significant progress has been made in the area of software verification, making verification techniques usable for realistic applications. However, much of this work concentrates on sequential software, and a next step is necessary to apply these results also on realistic concurrent software. In this paper, we outline a research agenda to realise this goal. We argue that current techniques for verification of concurrent software need to be further developed in multiple directions: extending the class of properties that can be established, improving the level of automation that is available for this kind of verification, and enlarging the class of concurrent programs that can be verified.

show abstract

“…In particular, many program verification tools have been developed for many years (e.g., KeY [1], VeriFast [10,11], and Dafny [13] have all been developed for more than 10 years). In this paper we focus on the VerCors verifier, which focuses in particular on the verification of concurrent and distributed software, and has been under development since 2011 [2][3][4][5]. It is being developed with the ultimate goal to make verification usable for developers that are not necessarily formal method experts, but to reach this goal, still substantial work is needed.…”

Section: Introductionmentioning

confidence: 99%

Improving Performance of the VerCors Program Verifier

Mulder

Huisman²,

Joosten

2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

As program verification tools are becoming more powerful, and are used on larger programs, their performance also becomes more and more important. In this paper we investigate performance bottlenecks in the VerCors program verifier. Moreover, we also discuss two solutions to the identified performance bottlenecks: an improved encoding of arrays, as well as a technique to automatically generate trigger expressions to guide the underlying prover when reasoning about quantifiers. For both solutions we measure the effect on the performance. We see that the new encoding vastly reduces the verification time of certain programs, while other programs keep showing comparable times. This effect remains when moving to newer backends for VerCors. S. Joosten-Work done while at the University of Twente.

show abstract

The VerCors project

Cited by 15 publications

References 53 publications

A History of BlockingQueues

A History of BlockingQueues

Towards Reliable Concurrent Software

Improving Performance of the VerCors Program Verifier

Contact Info

Product

Resources

About