Learn how techniques from traditional compiler verification can be applied to the emerging domain of quantum computing.
Did you think test case reduction was all about debugging? Find out how test case reducers can be used for program optimisation, to generate high coverage tests, for program understanding, and even for fuzzing!
Modern analog computers offer unique programming challenges which make them challenging compilation targets. How do we automatically program an analog computer to implement a computation?
The Programming Languages Mentoring Workshop (PLMW) is directed at new members of the PL community: senior undergraduate and beginning graduate students. With its first edition taking place in January 2012, PLMW is coming up on its ten year anniversary. We take a look back at how PLMW has grown and evolved, and imagine where it could go next.
Defending cryptographic code from Spectre attacks is difficult. Blade is a fully automatic approach to eliminate speculative leaks provably and efficiently.
Academic communities have increased the reach and accessibility of their work by publishing interactive, open-access, open-source articles on the web that explain both core and emerging ideas in their fields. It’s time for the PL community to do the same.
Recent developments in e-graphs and equality saturation make a compelling case for a new way to build optimizers and synthesizers.
Test case reducers are useful tools that can help you to simplify complex inputs that trigger bugs. In this post — the first in a series — we’ll give an overview of how test case reducers work.
Five early-career researchers bring their perspective to the debate on conference formats after COVID. They discuss the needs of junior researchers and how different approaches address those needs.
The SIGPLAN Climate Committee was active 2016-2020. Its members look back on the committee’s goals and achievements, and ahead at what is still to do.