The Laws of Programming with Concurrency

Subscribers:
342,000
Published on ● Video Link: https://www.youtube.com/watch?v=9kKQ8uLK8mk



Duration: 50:52
7,020 views
136


Regular algebra provides a full set of simple laws for the programming of abstract state machines by regular expressions. They apply equally to sequential programs run on real computers. When extended by similar laws for interleaving of regular expressions, they apply also to programs for modern concurrent and distributed systems. Evidence for this claim is given by deriving from the algebra a concurrent extension of Hoare Logic (O’Hearn’s separation logic), and also an operational semantics for Milner’s process calculus (CCS).







Tags:
microsoft research
mathematics