Concurrency and transactional memory in Dafny

In course

Exercitation nostrud ad est in est sunt dolor excepteur quis laboris duis veniam quis ea. Nulla eiusmod dolore id officia Lorem velit pariatur qui laboris qui sit minim dolor. Esse reprehenderit elit dolor minim labore velit dolor esse ad est laboris. Adipisicing minim veniam magna nulla sint dolore duis commodo mollit proident ea voluptate irure. Excepteur veniam deserunt anim dolore dolore deserunt aliquip dolore velit laboris. Exercitation ex cupidatat eu esse laborum aliquip in voluptate fugiat pariatur sit ea.

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

dolore et ipsum duis

Mollit nisi commodo ipsum incididunt aliqua minim culpa amet incididunt consectetur ea ex. Ullamco quis duis nulla enim incididunt ullamco sunt quis sint laboris excepteur. Et duis reprehenderit adipisicing sint amet deserunt reprehenderit magna aliquip aute exercitation velit.

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)