An exercise in verifying sequential programs with VerCors

Joosten, Sebastiaan J. C.; Oortwijn, Wytse; Safari, Mohsen; Huisman, Marieke

doi:10.1145/3236454.3236479

Cited by 5 publications

(3 citation statements)

References 12 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…This is because VerCors uses Implicit Dynamic Frames [47] as its underlying logical framework, which is equivalent to separation logic [48] but handles ownership slightly differently. The details of this are deferred to [8,49].) The elect method contains the code that is executed by every worker.…”

Section: Behavioural Specificationmentioning

confidence: 99%

An Abstraction Technique for Verifying Shared-Memory Concurrency

2020

Self Cite

View full text Add to dashboard Cite

Modern concurrent and distributed software is highly complex. Techniques to reason about the correct behaviour of such software are essential to ensure its reliability. To be able to reason about realistic programs, these techniques must be modular and compositional as well as practical by being supported by automated tools. However, many existing approaches for concurrency verification are theoretical and focus primarily on expressivity and generality. This paper contributes a technique for verifying behavioural properties of concurrent and distributed programs that balances expressivity and usability. The key idea of the approach is that program behaviour is abstractly modelled using process algebra, and analysed separately. The main difficulty is presented by the typical abstraction gap between program implementations and their models. Our approach bridges this gap by providing a deductive technique for formally linking programs with their process-algebraic models. Our verification technique is modular and compositional, is proven sound with Coq, and has been implemented in the automated concurrency verifier VerCors. Moreover, our technique is demonstrated on multiple case studies, including the verification of a leader election protocol.

show abstract

Section: Behavioural Specificationmentioning

confidence: 99%

An Abstraction Technique for Verifying Shared-Memory Concurrency

2020

Self Cite

View full text Add to dashboard Cite

show abstract

“…Over the last years, enormous progress has been made on the use of such deductive program verification techniques for non-trivial examples, such as for example the discovery of a bug in Timsort [11], the verification of a Linux's USB keyboard driver [25], the verification of avionics software [7], and the various VerifyThis challenges (see e.g., [14,17]). There are many different factors that have contributed to this progress, such as: -the increase in power of automated provers, -efficient use of multi-core hardware for formal verification tools, -developments in specification languages, and -the development of new verification theories, such as the use of concurrent separation logics to reason in a modular way about concurrent programs [3,18,21].…”

Section: The Problem: Scaling Deductive Program Verificationmentioning

confidence: 99%

On Models and Code

Huisman

2018

Leveraging Applications of Formal Methods, Verification and Validation. Modeling

Self Cite

View full text Add to dashboard Cite

Despite the substantial progress in the area of deductive program verification over the last years, it still remains a challenge to use deductive verification on large-scale industrial applications. In this abstract, I analyse why this is case, and I argue that in order to solve this, we need to soften the border between models and code. This has two important advantages: (1) it would make it easier to reason about high-level behaviour of programs, using deductive verification, and (2) it would allow to reason about incomplete applications during the development process. I discuss how the first steps towards this goal are supported by verification techniques within the VerCors project, and I will sketch the future steps that are necessary to realise this goal.

show abstract

“…Notably, VerCors uses Implicit Dynamic Frames[27] as the underlying logical framework, which is equivalent to separation logic[39] but handles ownership slightly differently. The details of this are deferred to[6,21].…”

mentioning

confidence: 99%

Practical Abstractions for Automated Verification of Shared-Memory Concurrency

Oortwijn

Gurov

Huisman

2020

Lecture Notes in Computer Science

Self Cite

View full text Add to dashboard Cite

Modern concurrent and distributed software is highly complex. Techniques to reason about the correct behaviour of such software are essential to ensure its reliability. To be able to reason about realistic programs, these techniques must be modular and compositional as well as practical by being supported by automated tools. However, many existing approaches for concurrency verification are theoretical and focus on expressivity and generality. This paper contributes a technique for verifying behavioural properties of concurrent and distributed programs that makes a trade-off between expressivity and usability. The key idea of the approach is that program behaviour is abstractly modelled using process algebra, and analysed separately. The main difficulty is presented by the typical abstraction gap between program implementations and their models. Our approach bridges this gap by providing a deductive technique for formally linking programs with their process-algebraic models. Our verification technique is modular and compositional, is proven sound with Coq, and has been implemented in the automated concurrency verifier VerCors. Moreover, our technique is demonstrated on multiple case studies, including the verification of a leader election protocol.

show abstract

An exercise in verifying sequential programs with VerCors

Cited by 5 publications

References 12 publications

An Abstraction Technique for Verifying Shared-Memory Concurrency

An Abstraction Technique for Verifying Shared-Memory Concurrency

On Models and Code

Practical Abstractions for Automated Verification of Shared-Memory Concurrency

Contact Info

Product

Resources

About