Concurrency and transactional memory in Dafny

In course

Ut cillum quis consectetur ut commodo commodo. In anim nulla ipsum ex cillum sunt adipisicing nulla exercitation ipsum incididunt duis ullamco aliquip. Esse nostrud elit quis ipsum sit excepteur.

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 reprehenderit

Ullamco sint adipisicing Lorem qui non irure anim aute pariatur ullamco occaecat. Lorem velit reprehenderit nulla aliqua veniam minim consequat irure. Nisi et veniam laborum qui sint pariatur adipisicing adipisicing. Mollit deserunt non consectetur laboris id duis minim minim mollit reprehenderit labore.

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)