Skip to main content
Graph
Search
fr
|
en
Login
Search
All
Categories
Concepts
Courses
Lectures
MOOCs
People
Practice
Publications
Startups
Units
Show all results for
Home
Lecture
Formal Verification and Program Synthesis
Graph Chatbot
Related lectures (29)
Previous
Page 1 of 3
Next
Formal Verification and Program Synthesis
Explores Viktor Kuncak's research in formal verification, program synthesis, and teaching activities at EPFL.
Introduction to Concurrency
Covers the basics of concurrency, its importance, and how to write concurrent programs.
Concurrency and transactional memory in Dafny
Covers Dafny basics, modeling concurrency, and implementing transactional memory with safety and liveness proofs.
Transactions: Concepts and Implementations
Explores the significance and challenges of transactions, emphasizing ACID properties and the practical implications of using transactional memory for concurrency control.
Dining philosopher problem
Presents an algorithm to prevent starvation and maximize philosophers eating simultaneously.
Hardware Verification using High-Level Design Languages
Explores challenges in hardware verification, clear specifications, speculation harm, and cycle-precise semantics.
Akka Streams: Programming Reactive Systems
Covers Akka Streams basics, stream stages concurrency, materialized values, and more.
Atomic Operations: Basics and Applications
Covers the basics of atomic operations in concurrency and parallelism, including hardware-provided operations and synchronized algorithms.
Concurrency and Parallelism: Visibility
Explores visibility in concurrency, memory models, shared memory, and hardware optimizations.
Dining Philosophers Problem
Discusses algorithms to prevent starvation and maximize philosophers eating simultaneously.