[Pl-seminar] Tuesday: Ryan Doenges - Strong termination and concurrency

[Luna Phipps-Costin]

If people missed Andrew's talk last week but are interested in the 
background, he has shared his slides (attached).

On 2/23/24 17:03, Luna Phipps-Costin wrote:
> Hi PL Seminar people -
>
> Hope you're looking forward to Tuesday, when Ryan will speak in what's 
> starting to look like a bit of a series :)
>
> When: Tuesday Feb 27, 12:30-1:30. Lunch will be served 12-12:30
> Where: WVH 366
> Speaker: Ryan Doenges
> Title: Strong termination and concurrency
> Abstract: I will recap the approach to semantic typing introduced by 
> Andrew last week and show how to make semantic typing fancy enough to 
> prove strong termination (ST) for a concurrent programming language. A 
> language is ST if all executions terminate, regardless of 
> nondeterminism in scheduling. For languages with blocking locks, ST 
> implies threads never get stuck indefinitely waiting for locks held by 
> other threads (deadlock).
>
-------------- next part --------------
A non-text attachment was scrubbed...
Name: slides.pdf
Type: application/pdf
Size: 549723 bytes
Desc: slides.pdf
URL: <http://lists.ccs.neu.edu/pipermail/pl-seminar/attachments/20240227/60a94d51/attachment-0001.pdf>