by Robert Rand and Michael Hicks on Feb 6, 2020 | Tags: compilers, formal verification, language design, program synthesis, quantum computing, type systems
As quantum computers become more practical, there is a rich opportunity to advance the development of tools to assist in the process of programming them, both now and in the future. To encourage more PL-minded researchers to work in this exciting new area, we established the Workshop on Programming Languages for Quantum Computing (PLanQC).
Read more...
by Nikhil Swamy on Sep 12, 2019 | Tags: formal verification, program proof, proof engineering
The usage of the term program verification has expanded well beyond its original meaning. As research in this space advances and expands, is it time to reconsider the term?
Read more...
by James Bornholt on Jul 31, 2019 | Tags: formal verification, machine learning, program synthesis, theorem proving
Program synthesis addresses an age-old problem in computer science: can a computer program itself? This post surveys the growing evolution of work in this exciting area.
Read more...
by Catalin Hritcu, David Chisnall, Deepak Garg, and Mathias Payer on Jul 1, 2019 | Tags: compilers, formal verification, hardware, security, systems
*Secure compilation* is an emerging field that puts together advances in programming languages, security, compilers, systems, formal verification, and hardware architectures. It aims to devise compilation chains that eliminate many of today’s security attacks, without sacrificing efficiency, and allowing sound reasoning about security properties in the source language.
Read more...
by Swarat Chaudhuri on Jun 24, 2019 | Tags: AI safety, formal verification, machine learning
In the last few years, there have been many anxious ruminations about AI safety. To a significant extent, these fears come from the realization that modern AI systems can be alarmingly brittle. For example, a deep neural net used for image classification can produce...
Read more...