James R. Wilcox

James R. Wilcox

Auto-generated profile, based on publicly available information

James R. Wilcox

University of Washington, USA

Research Focus & Metrics

Academic Career Length

16Years (2011-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
3 June 2015 in ACM SIGPLAN Notices
Verified
Journal Article
Open access
PPPavel Panchekha
Pavel Panchekha
ASAlex Sanchez-Stern
Alex Sanchez-Stern
JWJames R. Wilcox
James R. Wilcox
ZTZachary Tatlock
Zachary Tatlock
Scientific and engineering applications depend on floating point arithmetic to approximate real arithmetic. This approximation introduces rounding error, which can accumulate to produce unacceptable results. While the numerical methods literature provides techniques to mitigate rounding error, applying these techniques requires manually rearranging expressions and understanding the finer details of floating point arithmetic. We introduce Herbie, a tool which automatically discovers the rewrites experts perform to improve accuracy. Herbie's heuristic search estimates and localizes rounding error using sampled points (rather than static error analysis), applies a database of rules to generate improvements, takes series expansions, and combines improvements for different input regions. We evaluated Herbie on examples from a classic numerical methods textbook, and found that Herbie was able to improve accuracy on each example, some by up to 60 bits, while imposing a median performance overhead of 40%. Colleagues in machine learning have used Herbie to significantly improve the results of a clustering algorithm, and a mathematical library has accepted two patches generated using Herbie.

18 January 2016
Verified
Conference Paper
Open access
DWDoug Woos
Doug Woos
JWJames R. Wilcox
James R. Wilcox
SASteve Anton
Steve Anton
ZTZachary Tatlock
Zachary Tatlock
MEMichael D. Ernst
Michael D. Ernst
TAThomas Anderson
Thomas Anderson
We present the first formal verification of state machine safety for the Raft consensus protocol, a critical component of many distributed systems. We connected our proof to previous work to establish an end-to-end guarantee that our implementation provides linearizable state machine replication. This proof required iteratively discovering and proving 90 system invariants. Our verified implementation is extracted to OCaml and runs on real networks. The primary challenge we faced during the verification process was proof maintenance, since proving one invariant often required strengthening and updating other parts of our proof. To address this challenge, we propose a methodology of planning for change during verification. Our methodology adapts classical information hiding techniques to the context of proof assistants, factors out common invariant-strengthening patterns into custom induction principles, proves higher-order lemmas that show any property proved about a particular component implies analogous properties about related components, and makes proofs robust to change using structural tactics. We also discuss how our methodology may be applied to systems verification more broadly.

27 December 2017 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
PDF file
ISIlya Sergey
Ilya Sergey
JWJames R. Wilcox
James R. Wilcox
ZTZachary Tatlock
Zachary Tatlock
Distributed systems play a crucial role in modern infrastructure, but are notoriously difficult to implement correctly. This difficulty arises from two main challenges: (a) correctly implementing core system components (e.g., two-phase commit), so all their internal invariants hold, and (b) correctly composing standalone system components into functioning trustworthy applications (e.g., persistent storage built on top of a two-phase commit instance). Recent work has developed several approaches for addressing (a) by means of mechanically verifying implementations of core distributed components, but no methodology exists to address (b) by composing such verified components into larger verified applications. As a result, expensive verification efforts for key system components are not easily reusable, which hinders further verification efforts. In this paper, we present Disel, the first framework for implementation and compositional verification of distributed systems and their clients, all within the mechanized, foundational context of the Coq proof assistant. In Disel, users implement distributed systems using a domain specific language shallowly embedded in Coq and providing both high-level programming constructs as well as low-level communication primitives. Components of composite systems are specified in Disel as protocols, which capture system-specific logic and disentangle system definitions from implementation details. By virtue of Disel's dependent type system, well-typed implementations always satisfy their protocols' invariants and never go wrong, allowing users to verify system implementations interactively using Disel's Hoare-style program logic, which extends state-of-the-art techniques for concurrency verification to the distributed setting. By virtue of the substitution principle and frame rule provided by Disel's logic, system components can be composed leading to modular, reusable verified distributed systems. We describe Disel, illustrate its use with a series of examples, outline its logic and metatheory, and report on our experience using it as a framework for implementing, specifying, and verifying distributed systems.

14 November 2011
Verified
Conference Paper
Open access
AGAli Ghodsi
Ali Ghodsi
SSScott Shenker
Scott Shenker
TKTeemu Koponen
Teemu Koponen
ASAnkit Singla
Ankit Singla
BRBarath Raghavan
Barath Raghavan
JWJames Wilcox
James Wilcox

1 November 2015
Verified
Conference Paper
Closed access
JWJames R. Wilcox
James R. Wilcox
PFParker Finch
Parker Finch
CFCormac Flanagan
Cormac Flanagan
SFStephen N. Freund
Stephen N. Freund
Precise dynamic race detectors incur significant time and space overheads, particularly for array-intensive programs, due to the need to store and manipulate analysis (or shadow) state for every element of every array. This paper presents SlimState, a precise dynamic race detector that uses an adaptive, online algorithm to optimize array shadow state representations. SlimState is based on the insight that common array access patterns lead to analogous patterns in array shadow state, enabling optimized, space efficient representations of array shadow state with no loss in precision. We have implemented SlimState for Java. Experiments on a variety of benchmarks show that array shadow compression reduces the space and time overhead of race detection by 27% and 9%, respectively. It is particularly effective for array-intensive programs, reducing space and time overheads by 35% and 17%, respectively, on these programs.

1 December 2015 in Journal of Number Theory
Verified
Journal Article
Closed access
TDThao Do
Thao Do
AKArchit Kulkarni
Archit Kulkarni
SMSteven J. Miller
Steven J. Miller
DMDavid Moon
David Moon
JWJake Wellens
Jake Wellens
JWJames Wilcox
James Wilcox