POPL 2020 in Review
POPL is the premiere conference on the theoretical foundations of programming languages. The PC Chair, General Chair, and Steering Committee Chair of POPL 2020 review this year’s event.
Archive of posts tagged: formal verification
The First PLanQC in the Road to Quantum Programming
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).
“Program Verification”: Has it lost its punch?
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?
Program Synthesis in 2019
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.
Secure Compilation
*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.
