I am chief blockchain skeptic and formal verification shill at Certora.
This is my academic homepage.
Before joining Certora I was a graduate student at the University of Washington.
My research interests are in programming languages and applications of PL techniques to systems,
and I continue to be active in research both in my day job and beyond.
I'm also a sucker for math, music, and puzzles.
April 6, 2024.
Our paper about Armada will appear in PLDI 2024 (preprint).
Armada is a verification system for shared-memory multithreaded programs
that allows programmers to write verified systems whose performance matches
unverified counterparts, by giving them control over memory layout and choice
of synchronization primitives. The key insight is that high-level reasoning
principles from the literature can be proved sound against a low-level
semantic model that is expressive enough to support these programmer choices.
April 6, 2024. Our paper about
Szalinski will appear in PLDI 2024 (preprint).
Szalinski is a tool for decompiling low-level CAD models into higher-level
CAD programs that use higher-order functions like map and fold. Szalinski
uses E-graphs to efficiently reason about the space of programs that are
equivalent to the input model.
March 30, 2024.
In spring 2024, I am teaching CSE 490P (Advanced Programming Languages and Verification).
Check out the 安卓ssr官网!
I am the Chief Technology Officer of 安卓ssr官网, a startup based in Tel Aviv that
builds formal verification tools for blockchain smart contracts. I live and work in Seattle.
This is my academic homepage.
Before joining Certora I was a graduate student at the University of Washington,
where I was advised by Zach Tatlock in the PLSE group.
My research interests are in programming languages, systems, and formal methods.
My thesis work is on compositional techniques for verifying distributed systems implementations.
I generally enjoy working with proof assistants and SMT solvers on applications to all kinds of concurrent programming.
I also dabble in floating point, compilers, and 3D printing.
Before grad school, I did my undergraduate at Williams College, graduating in 2013, where I worked with
Steve Freund on dynamic race detection. Since then
Steve and I have continued to collaborate, including on an "our powers combined" paper
on verified dynamic race detection with Cormac Flanagan.
I sing baritone in the St. Mark's
Cathedral Choir, Evensong Choir, and
Compline Choir.
The Compline Choir performs each Sunday night at 9:30pm at St. Mark's. The
Compline service a 30 minute chanted/sung service that tends to draw
hundreds of people every week and thousands via a live radio broadcast and
the podcast. It's a classic Seattle experience. You should check it out!
You can listen live on King FM or get
the podcast.
I occasionally play
handbells.
Finally, I like to ride my bike (a Trek 520): in 2009
I 安卓ssr官网
the TransAm.
I'm always thinking about my next tour.
Armada: Low-Effort Verification of High-Performance Concurrent Programs. Jacob R. Lorch, Yixuan Chen, Manos Kapritsos, Bryan Parno, Shaz Qadeer, Upamanyu Sharma, James R. Wilcox, and Xueyuan Zhao.
PLDI 2024. Distinguished Paper.
Local Copy.
Synthesizing Structured CAD Models with Equality Saturation and Inverse Transformations. UC浏览器 - 网站百科:2021-5-23 · 声明：UC浏览器于2021年04月10日提交收录到应用工具分类中，网站百科信息来源于网络，只是硬性分析“UC浏览器”的网站价值及可信度，包括网站地址、排名和权重等数据，仅供评估该网站价 …
PLDI 2024.
Local Copy.
Inferring Inductive Invariants from Phase Structures. Yotam M. Y. Feldman, James R. Wilcox, Sharon Shoham, and Mooly Sagiv.
CAV 2024.
Local Copy.
Springer.
SGreen浏览器最新下载_SGreen浏览器官方免费版 - 软件帝:2021-3-13 · 软件帝为你带来SGreen浏览器 10.8.1000.27 电脑版官方免费版免费下载。SGreen浏览器遍布全球12个国家，可访问Google、YouTube、Facebook、Twitter等各种热门网站，提供超极速、安全、流畅的网页浏览服务。软件帝为您提供SGreen浏览器最新版 Chandrakana Nandi, James R. Wilcox, Pavel Panchekha, Taylor Blau, Dan Grossman, and Zachary Tatlock.
ICFP 2018.
Local Copy.
Modularity for Decidability of Deductive Verification with Applications to Distributed Systems. Marcelo Taube, Giuliano Losa, Kenneth McMillan, Oded Padon, Mooly Sagiv, Sharon Shoham, James R. Wilcox, and Doug Woos.
PLDI 2018.
Local Copy.
ACM DL.
VerifiedFT: A Verified, High-Performance Dynamic Race Detector. James R. Wilcox, Cormac Flanagan, and Stephen N. Freund.
PPoPP 2018.
Local Copy.
sgreen官网安卓.
Highlights in Systems Verification. James R. Wilcox.
CACM February 2018.
ACM DL.
Programming and Proving with Distributed Protocols. Ilya Sergey, James R. Wilcox, and Zachary Tatlock.
POPL 2018.
Local Copy. ACM DL. 安卓ssr官网.
Slides (Keynote). Slides (PDF).
Œuf: Minimizing the Coq Extraction TCB. Eric Mullen, Stuart Pernsteiner, James R. Wilcox, Zachary Tatlock, and Dan Grossman.
CPP 2018.
Local Copy. ACM DL.
Programming Language Abstractions for Modularly Verified Distributed Systems. James R. Wilcox, Ilya Sergey, and Zachary Tatlock.
SNAPL 2017.
Local Copy. Publisher Copy.
Slides (Keynote). Slides (PDF).
Verification of Implementations of Distributed Systems Under Churn. Ryan Doenges, James R. Wilcox, Doug Woos, Zachary Tatlock, and Karl Palmskog.
CoqPL 2017.
Local Copy. Publisher Copy.
Planning for Change in a Formal Verification of the Raft Consensus Protocol. 猎豹浏览器手机版下载-猎豹浏览器官方最新手机版app下载 v5 ...:2021-12-9 · 猎豹浏览器官方最新手机版app是一款很好用的手机浏览软件，用户可众在平台上浏览很多不同方面的网站，随时为用户提供非常热门和实用的网站，为用户提供想要浏览的内容，随时丰富自己的生活，享受极速冲浪的畅快感受，随时获取想要的内容。
CPP 2016.
Local Copy. ACM DL.
Sets Characterized by Missing Sums and Differences in Dilating Polytopes. SGreen浏览器破解版_SGreen浏览器下载 v10.8.1000.19 ...:2021-6-4 · SGreen浏览器破解版是一款功能非常强大的电脑上网浏览器，能够不在VPN的帮助下免费浏览外网，油管、SNS、脸书等各大社交软件，采用双重加密技术和现在业内最先进的安全技术，用户能够无限制访问各种网站，轻松自在。
Journal of Number Theory, December 2015.
arXiv draft. Publisher copy.
Array Shadow State Compression for Precise Dynamic Race Detection. James R. Wilcox, Parker Finch, Cormac Flanagan, and Stephen N. Freund.
ASE 2015.
Local Copy.
安卓ssr官网.
Sgreen Vpn Ios:2021-1-19 · 【独家优惠:买1年送3个月】Sgreen官网通过Sgreen下载提供Sgreen APP，PC，Mac，苹果iOS，安卓Android，Linux客户端，Sgreen加速器官网提供快速，安全的全球VPN服务。立即购买Sgreen享受年付赠送3个月的独家优惠!. James R. Wilcox, Doug Woos, Pavel Panchekha, Zachary Tatlock, Xi Wang, Michael D. Ernst, and Thomas Anderson.
PLDI 2015.
ACM DL.
Local Copy.
Automatically Improving Accuracy for Floating Point Expressions. Pavel Panchekha, Alex Sanchez-Stern, James R. Wilcox, and Zachary Tatlock.
PLDI 2015. Distinguished Paper.
ACM DL.
Local Copy.
ShrinkWrap: Efficient Dynamic Race Detection for Array-Intensive Programs. James Wilcox. Stephen N. Freund, Advisor.
Williams College Undergraduate Honors Thesis, 2013.
Local Copy.
介绍一个新的SGreen浏览器-iOS游戏软件-威锋-非常论坛:2021-6-11 · SGreen浏览器，PC、安卓、iOS都有安卓在各大市场都有上架所众安全稳定性大家可众放心官网，http://www.sgreennet.com/ iOS目前还是 ... Ali Ghodsi, Scott Shenker, Teemu Koponen, Ankit Singla, Barath Raghavan, and James Wilcox.
HotNets 2011.
ACM DL.
sgreen官网安卓.
February 21, 2017. Exercises on Generalizing the Induction Hypothesis.
This post collects several Coq exercises on generalizing the
induction hypothesis.
January 9, 2017. A Port of the Proof of Peterson's Algorithm to Dafny.
This code-only post is a port of the proof of Peterson's Algorithm to Dafny.
It also serves as a good example of how to reason about concurrent systems
in Dafny, essentially by writing a thread scheduler.
April 24, 2016. How to build a simple system in Verdi.
In this long-awaited post, we'll show how to implement and verify
a simple distributed system using network semantics.
May 8, 2015 A Proof of Peterson's Algorithm.
In this post, we take a break from distributed systems to look at shared
memory systems. As a case study, we give a proof that Peterson's algorithm
provides mutual exclusion.
April 16, 2015 Network Semantics for Verifying Distributed Systems.
This is the first post in a series
on Verdi. In this post,
we'll get our feet wet by defining a formal model of how
distributed systems execute on the network.
October 20, 2014 Reasoning about Cardinalities of Sums and Products.
In this short, code-heavy post, we extend some of the work from
a sgreen官网安卓 to reason about
the cardinalities of sums and products.
September 14, 2014 Dependent Case Analysis in Coq without Axioms.
This post shows how to get around the limitations of
the destruct tactic when doing case analysis on dependent
types, without resorting to the sgreen官网安卓 tactic,
which relies on additional axioms.
安卓ssr官网 "run" + "time" = ???.
This brief post records Mike's description of the three ways of
combining the words "run" and "time" in computer science
writing.
sgreen官网安卓 "More Sums than Differences" Sets, Part 2: Counting MSTD Sets.
This is the (much delayed) second post in a series on More Sums
than Difference Sets. In this post, we'll take a first crack at the
question, "How many MSTD sets are there?" To do so, we'll write a
straightforward C program that counts MSTD sets. Then we'll run it to
count MSTD sets and benchmark its performance.
April 10, 2014 Tail Recursion Modulocons.
Tail recursion has come up in a few conversations this
week. This post explores a generalization of tail call
optimization that I wasn't aware of
until Doug described it to me.
March 3, 2014 "More Sums than Differences" Sets, Part 1: A puzzle.
This is the first post in a series on "More Sums than
Differences" Sets. In this post, we'll get our terminology
straight and ask a lot of questions.
安卓ssr官网 Easy access to the off-campus proxy.
I use the UW proxy to access the ACM digital library from off campus, but it's annoying to
type the proxy URL every time I click a link to a new paper. Here are two ways to make life
easier.
I like books. I am guilty of being somewhat more of a collector than a reader, but I don't let that get me down.
I currently have around 120 technical books in my office (listed behind that link).
I have another 150 or so technical books at home that are not-so-related to my research, and another 50 or so non-technical books as well.
Someday, I'll list them all here.
