Webpages tagged with «concurrency»

Published Sep. 25, 2017 9:01 PM

The presentation by Daniel Fava at the Doctoral Symposium of the 13th International  integrated Formal Methods (iFM 2017) won the award for  the symposium's best presentation (shared with a second winner). The presentation covers joint work with Martin Steffen, Volker Stolz, and Stian Valle, about   ``An Operational Semantics for a Weak Memory Model with Buffered Writes, Message Passing, and Goroutines''.

 

Published Nov. 5, 2016 9:46 AM

Memory models as a part of programming language specifications have become increasingly popular the last two decades. They describe how the values that are obtained by reads are related to the values that are written by writes. To properly define this has proven particularly difficult for programming languages that allows for shared variables between multiple processes. In this thesis we formalize parts of the memory model specified by the Go language by making a structural operational semantics for it. We further use this semantics to prove that programs that are data race free will run under this semantics as they would under a strong memory model.

Published Sep. 23, 2016 1:45 PM

by Lars Tveito

Real-time collaboration allows multiple users to view and edit a document simultaneously over a network. In this thesis, we develop a new protocol, called Shared Buffer, which enables real-time collaboration in existing editors. Shared Buffer leverages a client-server architecture and minimizes the implementation effort of the client-side algorithm. It achieves this without degrading the responsiveness of the editor.

The greatest challenge of a real-time collaborative system is ensuring consistency between the distributed copies of the document. We chose eventual consistency as the consistency model, which essentially states that if all users stop typing, then eventually they will look at the same document.

We apply a formal verification technique called model checking, using it as a tool to validate the protocol. The behavior of the system is formally specified in Maude, a language based on equational and rewriting logic. Linear Temporal Logic (LTL) is used to formalize the consistency model. Using the Maude LTL model checker, we have verified that the system exhibits eventual consistency for a limited number of clients and operations.

A Shared Buffer server has been implemented in Clojure, a modern functional language with strong support for concurrency. Client implementations have been developed as an extension for Emacs, a widely used text editor, and as a library for the Python programming language.

Published Aug. 16, 2015 9:26 PM

"Modelling Tools and Programming languages for Internet of Things"

Published Jan. 13, 2015 8:27 AM
Published Dec. 1, 2014 8:23 AM
Published Mar. 3, 2011 8:37 PM
Published Nov. 9, 2010 10:47 AM
Published Nov. 4, 2010 2:19 PM
Published Nov. 4, 2010 2:12 PM
Published Nov. 4, 2010 1:50 PM