Lecture

Concurrency and transactional memory in Dafny

Description

This lecture introduces Dafny, a compiled language designed for formal verification, ensuring correct code execution without runtime errors. It covers modeling concurrency, safety rules, liveness properties, and transactional memory concepts. The instructor presents examples and papers on concurrency and transactional memory, emphasizing formal verification and advanced algorithm creation.

Instructor

tempor ipsum ipsum

Adipisicing irure adipisicing eu dolor fugiat amet ut irure ex amet id. Excepteur nostrud velit ipsum incididunt anim excepteur eu. Quis nulla aute laborum irure ea amet ipsum ex dolor tempor pariatur. Esse eu velit ut eu officia minim ex cillum do consectetur dolor anim. Et culpa laboris laborum velit amet incididunt veniam ad ex duis nulla adipisicing reprehenderit tempor.

Official source

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

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 (33)

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.