Skip to main content
Conference Proceedings

Modeling concurrency in dafny

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2018) 11174 LNCS 115-142
DOI: 10.1007/978-3-030-02928-9_4
1Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.
Get full text

Abstract

This article gives a tutorial on how the Dafny language and verifier can be used to model a concurrent system. The running example is a simple ticket system for mutual exclusion. Both safety and, under the assumption of a fair scheduler, liveness are verified.

Cite

CITATION STYLE

APA

Leino, K. R. M. (2018). Modeling concurrency in dafny. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 11174 LNCS, pp. 115–142). Springer Verlag. https://doi.org/10.1007/978-3-030-02928-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free