Jules Villard (ENS Cachan, F)

 

 

Proving Copyless Message Passing

 

 Handling concurrency using a shared memory and locks is tedious and
error-prone. One solution is to use message passing instead. We study
here a particular, contract-based flavor that makes the ownership
transfer of messages explicit. In this case, ownership of the heap
region representing the content of a message is lost upon sending, which
can lead to efficient implementations. In this talk, we define a proof
system for a concurrent imperative programming language implementing
this idea and inspired by the Singularity OS.  The proof system is an
extension of separation logic, which has already been used successfully
to study various ownership-oriented paradigms.  A fragment of it is
automatized in a tool, Heap-Hop.