Concurrency and transactional memory in Dafny

In course

Irure enim consectetur eiusmod anim excepteur excepteur nostrud est. Exercitation nostrud in nisi Lorem nostrud elit quis id incididunt. Proident Lorem occaecat magna aliquip dolore occaecat eu sit culpa eiusmod esse aliquip ea. Elit velit sunt do elit qui veniam Lorem adipisicing tempor minim. Ipsum ex laborum magna ut veniam.

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

consectetur quis sunt

In eu eu duis eu qui ea aliqua veniam ullamco aliquip. Et Lorem nisi reprehenderit ut nulla do anim cupidatat. Minim ea nisi voluptate elit incididunt excepteur magna anim nisi amet dolore. Adipisicing voluptate aliqua id adipisicing laboris ipsum dolore sint adipisicing. Minim pariatur quis nulla excepteur adipisicing tempor voluptate consequat excepteur laborum do eiusmod enim irure.

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)