In this talk, I will cover a line of work (done jointly with Mooly and several other collaborators) that originated from TVLA and its application to verifying concurrent programs, but then took a different direction. I will talk about concurrency control protocols, and their usefulness in ensuring serializability. Shifting from an analysis and verification perspective, I will talk about use of synthesis to achieve correct-by-construction software (from a concurrency control perspective). I will discuss problems such as extending a sequential object to be a linearizable object, extending a linearizable object to be a transactional object, and composing multiple transactional objects into a single transactional object.
Sat 6 Apr
|14:00 - 14:30|
Neil ImmermanUniversity of Massachusetts, Amherst
|14:30 - 15:00|
G. RamalingamMicrosoft Research
|15:00 - 15:30|
Nikolaj BjørnerMicrosoft Research