W
William Mansky
Researcher at University of Illinois at Chicago
Publications - 25
Citations - 267
William Mansky is an academic researcher from University of Illinois at Chicago. The author has contributed to research in topics: Semantics (computer science) & Correctness. The author has an hindex of 7, co-authored 22 publications receiving 200 citations. Previous affiliations of William Mansky include University of Pennsylvania & Princeton University.
Papers
More filters
Journal ArticleDOI
A verified messaging system
TL;DR: This work formally verifying a C implementation of the concurrent-read exclusive-write buffer system with strong correctness and security properties in Coq, using the Verified Software Toolchain extended with an atomic exchange operation, is the first C-level mechanized verification of a nonblocking communication protocol.
Proceedings ArticleDOI
Verifying an HTTP Key-Value Server with Interaction Trees and VST.
Hengchu Zhang,Wolf Honoré,Nicolas Koh,Yao Li,Yishuai Li,Li-yao Xia,Lennart Beringer,William Mansky,Benjamin C. Pierce,Steve Zdancewic +9 more
TL;DR: A networked key-value server, implemented in C and formally verified in Coq, that interacts with clients using a subset of the HTTP/1.1 protocol and is specified and verified using interaction trees and the Verified Software Toolchain.
Book ChapterDOI
Connecting Higher-Order Separation Logic to a First-Order Outside World
TL;DR: This paper shows how to extend the higher-order separation logic of the Verified Software Toolchain to interface with a first-order verified operating system, in this case CertiKOS, that mediates its interaction with the outside world and proves the correctness of C programs in separation logic based on the semantics of system calls implemented in Certi KOS.
Book ChapterDOI
An Axiomatic Specification for Sequential Memory Models
TL;DR: This work presents an abstract specification for sequential memory models with allocation and free operations, in the form of a set of axioms that provide enough information to reason about memory without overly constraining the behavior of implementations.
Proceedings ArticleDOI
From C to Interaction Trees: Specifying, Verifying, and Testing a Networked Server
Nicolas Koh,Yao Li,Yishuai Li,Li-yao Xia,Lennart Beringer,Wolf Honoré,William Mansky,Benjamin C. Pierce,Steve Zdancewic +8 more
TL;DR: The main theorem connects a specification of acceptable server behaviors, written in a straightforward “one client at a time” style, with the CompCert semantics of the C program.