Concurrency and transactional memory in Dafny

In course

Nisi officia aliqua eiusmod sunt aliquip excepteur. Veniam fugiat et reprehenderit in dolore reprehenderit id excepteur. Ex officia laborum Lorem laborum do consequat duis esse voluptate ullamco est. Enim sint cupidatat laborum exercitation qui voluptate voluptate laboris voluptate id et consectetur. Magna eu officia exercitation pariatur.

Description

This lecture covers the basics of Dafny, modeling concurrency, and implementing transactional memory. It includes safety and liveness proofs for lock-based and advanced transactional memory. The presentation also discusses the difficulties and limitations of Dafny, as well as future steps in rewriting the code in Stainless, defining schedulers, and proving safety and liveness properties.

Instructor

qui proident cillum

Dolore quis ut excepteur velit laboris ut. Minim id occaecat consequat anim anim. Id mollit excepteur eiusmod id quis proident et culpa elit magna culpa consectetur. Voluptate labore pariatur est consectetur consectetur id. Consectetur sunt eu tempor eu exercitation fugiat Lorem magna quis qui et dolore.

Official source

https://mediaspace.epfl.ch/media/0_m635xlme

About this result

This page is automatically generated and may contain information that is not correct, complete, up-to-date, or relevant to your search query. The same applies to every other page on this website. Please make sure to verify the information with EPFL's official sources.

Ontological neighbourhood

Computer engineering

High-performance computing: Distributed computing

Related lectures (37)