The Internet Archive has a preservation copy of this work in our general collections.
The file type is
The proposed framework provides a general model of concurrent imperative programming. Programs are modeled as formal languages and concurrency as an interleaving (or shuffle) operator. This yields a simple and elegant algebra of programs. The framework supports the views program logic by Dinsdale-Young and others, which generalizes various type systems and separation logic approaches to program correctness. It also validates familiar operational calculi in small-step and big-step flavours. ThearXiv:1209.2012v1 fatcat:yl6ieqzmlzaoniumrl6gg6o7r4