viktor vafeiadis software analysis verification
play

Viktor Vafeiadis Software Analysis & Verification Full - PowerPoint PPT Presentation

Viktor Vafeiadis Software Analysis & Verification Full functional verification Compilers , concurrent programs , theorem provers Program equivalence / Compositional reasoning Compositional compiler verification


  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

  2. Concurrency & relaxed memory models — Interleaving concurrency (SC) ... Thread Thread — Relaxed memory models TSO, PSO, RMO, CC, RelAcq, PPC/ARM, Alpha, Itanium, Shared Memory 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?

  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

Download Presentation
Download Policy: The content available on the website is offered to you 'AS IS' for your personal information and use only. It cannot be commercialized, licensed, or distributed on other websites without prior consent from the author. To download a presentation, simply click this link. If you encounter any difficulties during the download process, it's possible that the publisher has removed the file from their server.

Recommend


More recommend