Conversation

Notices

1. Christine Lemmer-Webber (cwebber@octodon.social)'s status on Monday, 29-Jul-2019 11:33:54 UTC Christine Lemmer-Webber

   • Andrew Miloradovsky

   @amiloradovsky If you figure out how to statically analyze whether or not a program with almost any amount of locking has deadlocks, you'll probably receive the CS world's highest achievement award. I would then recommend that you move on to statically analyzing whether or not a program halts. :)

   There are really two ways to avoid deadlocks entirely AFAIK: no-shared-state-with-message-passing (actors, Erlang, E, Goblins/Goblinoid) and Rust's ownership model.

   • see shy jo (joeyh@octodon.social)'s status on Monday, 29-Jul-2019 13:29:44 UTC see shy jo

     in reply to

     • Andrew Miloradovsky

     @cwebber @amiloradovsky Systematic Concurrency Testing (SCT) can analyze a program and detect deadlocks and nondeterministic results.

     It works by scheduling threads so it can explore the entire space of schedules and the results.

     See https://www.barrucadu.co.uk/publications/dejafu-hs15.pdf
     for the haskell implementation of it.

     Christine Lemmer-Webber repeated this.
   • Christine Lemmer-Webber (cwebber@octodon.social)'s status on Monday, 29-Jul-2019 13:31:37 UTC Christine Lemmer-Webber

     in reply to

     • Andrew Miloradovsky
     • see shy jo

     @joeyh @amiloradovsky Huh, I guess I'm wrong then!