Skip to main content

A verified messaging system

Author(s): Mansky, William; Appel, Andrew W; Nogin, Aleksey

To refer to this page use:
Abstract: We present a concurrent-read exclusive-write buffer system with strong correctness and security properties. Our motivating application for this system is the distribution of sensor values in a multicomponent vehicle-control system, where some components are unverified and possibly malicious, and other components are vehicle-control-critical and must be verified. Valid participants are guaranteed correct communication (i.e., the writer is always able to write to an unused buffer, and readers always read the most recently published value), while invalid readers or writers cannot compromise the correctness or liveness of valid participants. There is only one writer, all operations are wait-free, and there is no extra process or thread mediating communication. We prove the correctness of the system with valid participants by formally verifying a C implementation of the system in Coq, using the Verified Software Toolchain extended with an atomic exchange operation. The result is the first C-level mechanized verification of a nonblocking communication protocol.
Publication Date: Oct-2017
Citation: William Mansky, Andrew W. Appel, and Aleksey Nogin. 2017. A Verified Messaging System. Proc. ACM Program. Lang. 1, OOPSLA, Article 87 (October 2017), 28 pages.
DOI: 10.1145/3133911
EISSN: 2475-1421
Keywords: shared-memory communication, shared-memory concurrency, concurrent separation logic
Language: en
Type of Material: Journal Article
Journal/Proceeding Title: Proceedings of the ACM on Programming Languages
Version: Final published version. This is an open access article.

Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.