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
Proceedings ArticleDOI
A formal C memory model supporting integer-pointer casts
TL;DR: This work presents the first formal memory model that allows many common optimizations and fully supports operations on the representation of pointers and all arithmetic operations are well-defined for pointers that have been cast to integers.
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: In this article, the authors present the first formal verification of a networked server implemented in C. 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.
Proceedings ArticleDOI
Toward a multi-method approach to formalizing human-automation interaction and human-human communications
Ellen J. Bass,Matthew L. Bolton,Karen M. Feigh,Dennis Griffith,Elsa L. Gunter,William Mansky,John Rushby +6 more
TL;DR: A multi-method approach based on extending the Enhanced Operator Function Model language to address human agent communications (EOFMC) including analyses via theorem proving and future support for model checking linked through the EOFMC top level XML description is developed.
Book ChapterDOI
A framework for formal verification of compiler optimizations
William Mansky,Elsa L. Gunter +1 more
TL;DR: This article gives formal semantics to a variation of the TRANS language, which is designed to express optimizations as transformations on control-flow graphs using temporal logic side conditions, and formalizes the idea of correctness of a TRANS optimization.
Proceedings ArticleDOI
BARRACUDA: binary-level analysis of runtime RAces in CUDA programs
TL;DR: BARRACUDA is presented, a concurrency bug detector for GPU programs written in Nvidia’s CUDA language, leveraging a new binary instrumentation framework that is extensible to other dynamic analyses.