SLIDE 1
Viktor Vafeiadis — Software Analysis & Verification
— Full functional verification – Compilers , concurrent programs , theorem provers — Program equivalence / Compositional reasoning – Compositional compiler verification — Concurrency (relaxed memory models) — Interactive theorem provers
SLIDE 2
Concurrency & relaxed memory models
— Interleaving concurrency (SC) — Relaxed memory models TSO, PSO, RMO, CC, RelAcq, PPC/ARM, Alpha, Itanium, JMM, Linux, C11 — Concurrent program logics OG, RG, CSL, RGSep, LRG, CAP , ... Ownership transfer, stability — Compilation for relaxed memory models Compiling from one MM to another? What optimisations are possible?
...
Shared Memory Thread Thread
SLIDE 3
Interactive theorem proving (Coq, Isabelle, etc.)
— Pencil & paper proofs cannot be trusted — Interactive theorem provers (Coq, Isabelle) — Improve the theorem provers Parameterized coinduction Tactic language for proof terms — Treat Coq as a programming language Add state, concurrency, ... Write & verify a theorem prover
