Minimization of Symbolic Tree Automata
Bounded Abstract Interpretation
Programming Languages and Technical Disruption
[This is a reprise of a keynote talk I gave at PLDI 2016] What do cheating on fuel economy, the London Whale, and building a better mosquito trap have in common? We are constantly bombarded…
Practical Statically-checked Deterministic Parallelism
Reproducibility is important in computing, whether reproducing bug reports or scientific results. After obvious sources of irreproducibility are addressed by containerization and hermetic build systems, the fundamental remaining challenge is preventing unintended nondeterminism due to…
Congruence Closure in Intensional Type Theory
Dr. TLA+ Series- Paxos
Welcome to the inaugural lecture in the Dr. TLA+ Series! The presentation slide and the complete schedule of Dr. TLA+ Series are available at https://github.com/tlaplus/DrTLAPlus This lecture will familiarize you with the Paxos…