Lecture

Concurrency and transactional memory in Dafny

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

ea excepteur velit sunt

Ipsum reprehenderit esse voluptate labore et. Nulla eiusmod excepteur enim magna consequat est reprehenderit magna sit id excepteur fugiat culpa. Officia pariatur ex consectetur labore sit velit magna ex. Quis cillum irure nostrud laborum occaecat occaecat sunt pariatur non incididunt. Fugiat ut aliqua proident velit qui. Culpa cillum aliqua id fugiat est tempor consectetur. In nostrud eu sunt eiusmod consequat amet fugiat sint aliquip eu cillum laboris nulla.

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)

Graph Chatbot

Chat with Graph Search

Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.

DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.