Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/association-for-computing-machinery/a-verified-messaging-system-gPSLQL0PWf
References (24)
-
G. Holzmann (1993)
Design and Validation of Protocols: A TutorialComput. Networks ISDN Syst., 25
-
P. McKenney, Jack Slingwine (2002)
READ-COPY UPDATE: USING EXECUTION HISTORY TO SOLVE CONCURRENCY PROBLEMS -
G. Holzmann (1990)
Design and validation of protocols -
P. Courtois, F. Heymans, D. Parnas (1971)
Concurrent control with “readers” and “writers”Commun. ACM, 14
-
(2007)
Using Promela and Spin to verify parallel algorithms -
Viktor Vafeiadis, Chinmay Narayan (2013)
Relaxed separation logic: a program logic for C11 concurrencyProceedings of the 2013 ACM SIGPLAN international conference on Object oriented programming systems languages & applications
-
G. Klein, Kevin Elphinstone, G. Heiser, June Andronick, David Cock, Philip Derrin, D. Elkaduwe, Kai Engelhardt, Rafal Kolanski, Michael Norrish, Thomas Sewell, Harvey Tuch, Simon Winwood (2009)
seL4: formal verification of an OS kernel -
Darren Cofer, Michael Whalen (2013)
Secure Mathematically-Assured Composition of Control Models (SMACCM)(2013). https://wiki.sei.cmu.edu/aadl/images/f/f6/SMACCM- TA4- whalen- 42013.pdf
-
Andrew W. Appel, Robert Dockins, Aquinas Hobor, Lennart Beringer, Josiah Dodds, Gordon Stewart, Sandrine Blazy, Xavier Leroy (2014)
Program Logics for Certified CompilersCambridge University Press
-
X. Leroy (2009)
Formal verification of a realistic compilerCommun. ACM, 52
-
B. Jacobs, Frank Piessens (2010)
Expressive modular fine-grained concurrency specification -
Ralf Jung, R. Krebbers, L. Birkedal, Derek Dreyer (2016)
Higher-order ghost stateProceedings of the 21st ACM SIGPLAN International Conference on Functional Programming
-
A. Appel, Robert Dockins, Aquinas Hobor, Lennart Beringer, J. Dodds, Gordon Stewart, Sandrine Blazy, X. Leroy (2014)
Program Logics for Certified Compilers -
Matthew Parkinson, R. Bornat, P. O'Hearn (2007)
Modular verification of a non-blocking stack -
S. Owicki, D. Gries (1976)
An axiomatic proof technique for parallel programs IActa Informatica, 6
-
Joseph Tassarotti, Derek Dreyer, Viktor Vafeiadis (2015)
Verifying read-copy-update in a logic for weak memoryProceedings of the 36th ACM SIGPLAN Conference on Programming Language Design and Implementation
-
P. O'Hearn (2004)
Resources, Concurrency and Local ReasoningTheor. Comput. Sci., 375
-
Aquinas Hobor, A. Appel, Francesco Nardelli (2008)
Oracle Semantics for Concurrent Separation Logic -
P. O'Hearn (2007)
Resources, concurrency, and local reasoningTheoretical Computer Science, 375
-
Marko Doko, Viktor Vafeiadis (2017)
Tackling Real-Life Relaxed Concurrency with FSL++ -
M. Quigley (2009)
ROS: an open-source Robot Operating System -
Ilya Sergey, Aleksandar Nanevski, A. Banerjee (2014)
Specifying and Verifying Concurrent Algorithms with Histories and Subjectivity -
D. Cofer, John Backes, Andrew Gacek, D. DaCosta, M. Whalen, I. Kuz, G. Klein, G. Heiser, Lee Pike, Adam Foltzer, Michal Podhradský, D. Stuart, Jason Grahan, B. Wilson (2017)
Secure mathematically-assured composition of control models -
S. Blom, M. Huisman, Marina Zaharieva-Stojanovski (2015)
History-Based Verification of Functional Behaviour of Concurrent Programs
- Publisher
- Association for Computing Machinery
- Copyright
- Copyright © 2017 ACM
- eISSN
- 1551-3688
- DOI
- 10.1145/3133911
- Publisher site
- See Article on Publisher Site
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.
Journal
ACM SIGBED Review – Association for Computing Machinery
Published: Oct 12, 2017
Keywords: concurrent separation logic