Skip to content
New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Add 2023 awards #220

Merged
merged 8 commits into from
Jul 31, 2023
Merged
Show file tree
Hide file tree
Changes from all commits
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
91 changes: 59 additions & 32 deletions _data/Achievement.yaml
Original file line number Diff line number Diff line change
@@ -1,3 +1,24 @@
2023:
- Awardee: Kathryn S. McKinley
Citation: |

Kathryn McKinley has made seminal contributions to a number of
areas in PL, most notably memory management and parallelizing
compilers. Her contributions to memory management include some of
the most innovative and effective algorithms available for garbage
collection and memory allocation. … She served in leadership
roles in numerous SIGPLAN conferences and was instrumental in
introducing double blind reviewing to the programming languages
community, seeking to reduce bias and improve scientific quality.
McKinley also played a key role in advancing women and minorities
in programming languages, and more generally, within computer
science. She has energetically championed this cause and has been
a dedicated mentor to her 23 PhD students and countless other
researchers. In short, Kathryn McKinley is the "whole picture" of
what the SIGPLAN achievement award seeks to recognize.

Selection committee: Işil Dillig, Nate Foster, Cormac Flanagan, Jonathan Aldrich, Robby Findler

2022:
- Awardee: Xavier Leroy
Citation: |
Expand Down Expand Up @@ -71,39 +92,45 @@
research with an emphasis on solving problems in widely-used languages -
it has made life better for many practicing programmers.

Hans is the primary author of the Boehm-Demers-Weiser garbage collection
(GC) library, the first to enable automatic deallocation of memory for most
C programs -- a surprising result at that time. Its low overhead made
automatic GC widely accessible, enabling many language implementations to
get off the ground quickly, with competitive GC performance. Initially
published in 1988, the library is still widely used. It likely significantly
accelerated the widespread adoption of GC and also enabled many modern C/C++
memory leak detectors for non-garbage-collected programs. Hans' papers based
on this library provided major new insights into both this "conservative"
style of GC, and GC in general - his sole-author 1993 "most influential" PLDI
paper showed how to greatly reduce the space cost of "conservative" GC, and
his PLDI’91 paper introduced "sticky bit" collection, later adopted by mainstream
Java collectors.
Hans is the primary author of the Boehm-Demers-Weiser garbage
collection (GC) library, the first to enable automatic
deallocation of memory for most C programs -- a surprising result
at that time. Its low overhead made automatic GC widely
accessible, enabling many language implementations to get off the
ground quickly, with competitive GC performance. Initially
published in 1988, the library is still widely used. It likely
significantly accelerated the widespread adoption of GC and also
enabled many modern C/C++ memory leak detectors for
non-garbage-collected programs. Hans' papers based on this library
provided major new insights into both this "conservative" style of
GC, and GC in general - his sole-author 1993 "most influential"
PLDI paper showed how to greatly reduce the space cost of
"conservative" GC, and his PLDI’91 paper introduced "sticky bit"
collection, later adopted by mainstream Java collectors.

Hans is the leading authority on programming language memory models and thread
semantics. The theory of memory models is complex, with subtleties still not well
understood. Defining the model for a popular language is even harder, requiring
balancing conflicting constituencies – teachable to the masses, performance for
advanced programmers, and compatibility with legacy and future hardware. Leading
the C++11 process, Hans miraculously managed to satisfy all constituencies. He
argued for the core model to be the teachable “sequential-consistency for
data-race-free” model, but additionally developed an alternate path for advanced
programmers and non-compatible hardware using the concept of relaxed atomics.
Along the way, Hans wrote several seminal papers. The PLDI’05 paper exposed
problems with the then-prevalent approach of implementing threads as a library,
the PLDI’08 paper described the C++ model, and a series of papers exposed hitherto
unknown problems with benign data races, fences, seqlocks, and subtleties in the
notorious out-of-thin-air (OOTA) issue. Hans was also a major contributor to the
Java memory model effort, a precursor to the C++ effort, and his C++ work has
influenced analogous OOTA related open problems for Java. It is impossible to
overstate Hans’ impact on the understanding and practice of language memory models.
He has had profound influence on the boundary between PL and computer architecture
communities.
Hans is the leading authority on programming language memory
models and thread semantics. The theory of memory models is
complex, with subtleties still not well understood. Defining the
model for a popular language is even harder, requiring balancing
conflicting constituencies – teachable to the masses, performance
for advanced programmers, and compatibility with legacy and future
hardware. Leading the C++11 process, Hans miraculously managed to
satisfy all constituencies. He argued for the core model to be the
teachable “sequential-consistency for data-race-free” model, but
additionally developed an alternate path for advanced programmers
and non-compatible hardware using the concept of relaxed atomics.
Along the way, Hans wrote several seminal papers. The PLDI’05
paper exposed problems with the then-prevalent approach of
implementing threads as a library, the PLDI’08 paper described the
C++ model, and a series of papers exposed hitherto unknown
problems with benign data races, fences, seqlocks, and subtleties
in the notorious out-of-thin-air (OOTA) issue. Hans was also a
major contributor to the Java memory model effort, a precursor to
the C++ effort, and his C++ work has influenced analogous OOTA
related open problems for Java. It is impossible to overstate
Hans’ impact on the understanding and practice of language memory
models. He has had profound influence on the boundary between PL
and computer architecture communities.

2019:
- Awardee: Alex Aiken
Expand Down
26 changes: 26 additions & 0 deletions _data/Dissertation.yaml
Original file line number Diff line number Diff line change
@@ -1,3 +1,25 @@
2023:
- Awardee: "Sam Westrick, Carnegie Mellong University"
Other: _Efficient and Scalable Parallel Functional Programming through Disentanglement_
Advisor: "Umut Acar"
Citation: |

Writing understandable and performant concurrent programs,
especially ones that exploit racing updates, is one of the most
important problems in computing. Sam Westrick's dissertation
introduces a new concept, disentanglement, that can be exploited
to design efficient parallel and concurrent programs. The work
assembles a benchmark suite of existing programs to evaluate the
proposed techniques and shows that the technique is widely
applicable. The thesis also develops the MPL compiler and shows
how disentanglement can be exploited to improve execution, notably
garbage collection. Overall, the thesis is clearly written, with
every technical concept introduced with an informative example,
and is a pleasure to read.

* Selection committee: Işil Dillig, Philip Wadler, Milind Kulkarni,
Stephanie Weirich, Hidehiko Masuhara

2022:
- Awardee: "Uri Alon, Technion"
Other: _Machine Learning for Programming Language Processing_
Expand Down Expand Up @@ -332,6 +354,8 @@
understanding of the potential of automated program verification
and its application to real-world programs.

* Selection committee: Susan Eisenbach, Tiziana Margaria, Antony Hosking, Suresh Jagannathan

- Awardee: "Vilhelm Sjöberg, University of Pennsylvania"
Other: |
_[A Dependently Typed Language with Nontermination](/Awards/Dissertation/2016_sjoberg.pdf)_
Expand Down Expand Up @@ -363,6 +387,8 @@
generation of language designs supporting significantly more
robust and reliable software development.

* Selection committee: Susan Eisenbach, Tiziana Margaria, Antony Hosking, Suresh Jagannathan

2015:
- Awardee: "Mark Batty, University of Cambridge"
Other: |
Expand Down
19 changes: 19 additions & 0 deletions _data/Educator.yaml
Original file line number Diff line number Diff line change
@@ -1,3 +1,22 @@
2023:
- Awardee: Kathi Fisler and Shriram Krishnamurthi
Citation: |

Professors Fisler and Krishnamurthi have made significant and
sustained pedagogical contributions to Programming Languages over
the last two decades. Both of them have a long track record of
being SIGPLAN community leaders in PL education, from writing
well-known textbooks to making significant contributions to CS
Curriculum Guidelines. .. With Emmanuel Schanzer, they are
co-founders of Bootstrap, a national program that uses functional
programming to integrate data science and computing into math,
science, and social studies classes. … In short, their innovative
work has paved the way for a new generation of computer scientists
and teachers and has helped to make computing education more
accessible, engaging, and effective for all.

* Selection committee: Işil Dillig, Graham Hutton, Alastair Donaldson, Elisa Gonzalez Boix, Jeremy Gibbons

2021:
- Awardee: Benjamin Pierce
Citation: |
Expand Down
22 changes: 22 additions & 0 deletions _data/Milner.yaml
Original file line number Diff line number Diff line change
@@ -1,3 +1,25 @@
2023:
- Awardee: Nate Foster
Citation: |

Nate Foster is a world leader in programming languages and
software-defined networking. His skills as a PL researcher run the
gamut: adept at design, theory, implementation, and applications,
a combination rare to find in a single individual. His work brings
elegant PL techniques to bear on fundamental problems in
networking, makes pioneering contributions to both fields, and
enables verification approaches for networking
implementations. Notably, this is the second field Nate has opened
up: his PhD work introduced "lenses" as a language construct for
bidirectional tree transformations applied to the database view
update problem. His work has been recognized with multiple
distinguished paper and "test of time" awards. Nate also gives
significant service & leadership to the PL community on conference
program and steering committees, mentoring workshops, and
representative to influential working groups.

* Selection committee: Antony Hosking, Sandrine Blazy, Suresh Jagannathan, Ranjit Jhala, Éric Tanter.

2022:
- Awardee: Viktor Vafeiadis
Citation: |
Expand Down
20 changes: 20 additions & 0 deletions _data/PLDI.yaml
Original file line number Diff line number Diff line change
@@ -1,3 +1,23 @@
2023:
- Awardee: |
Jonathan Ragan-Kelley (MIT), Connelly Barnes (Adobe), Andrew Adams (Adobe),
Sylvain Paris (Adobe), Frédo Durand (MIT), Saman Amarasinghe (MIT)
Other: |
(for 2013) _[Halide: A Language and Compiler for Optimizing Parallelism, Locality, and Representation in Image Processing Pipelines](https://doi.org/10.1145/2491956.2462176)_
Citation: |
Halide is a C++-embedded DSL that exploits locality and vectorized
computation for efficient use of SIMD multicore, GPU, and DSP
platforms in image and array processing applications. It has
become a key element of modern image processing pipelines at
Adobe, Google & Qualcomm. The main innovation of Halide is
separation of algorithm from execution schedule. Programmers can
separately schedule the image pipeline for their target
architecture. Combined with stochastic search over the space of
schedules, Halide enables terse, composable programs to achieve
state-of-the-art performance on a wide range of real image
processing pipelines to achieve order of magnitude performance
improvements over hand-tuned C and CUDA implementations.

2022:
- Awardee: |
John Regehr (University of Utah), Yang Chen (Meta), Pascal Cuoq
Expand Down
26 changes: 26 additions & 0 deletions _data/Service.yaml
Original file line number Diff line number Diff line change
@@ -1,3 +1,27 @@
2023:
- Awardee: Talia Ringer
Citation: |

Talia Ringer has been fearless and passionate about building a
welcoming and inclusive environment in the PL community,
especially for newcomers. Even so early in their career, Talia's
service has already had extraordinary impact in the PL community
and beyond. In 2020, Talia founded SIGPLAN-M, a
cross-institutional long-term mentoring program for the PL
community, which Talia chaired until recently. It currently
reaches more than 200 mentors and 300 mentees across more than 41
countries, and has been described by mentees as “life changing”
and “a career saver.” Talia then helped the computer architecture
community start their own long-term mentoring program. The two
programs, the history, and their impact is described in CACM. Last
year, Talia founded the Computing Connections Fellowship, to
provide institution-independent transitional funding and research
visits for CS Ph.D. students, initially in PL. Talia led the
fundraising necessary to run the fellowship and the recruiting of
a committee to select the awardees.

* Selection committee: Antony Hosking, Kathleen Fisher, Steve Blackburn, Zena Ariola, Heather Miller

2022:
- Awardee: Mike Hicks
Citation: |
Expand Down Expand Up @@ -33,6 +57,8 @@
engineering practices and the benefits of good programming
languages.

* Selection committee: Antony Hosking, Kathleen Fisher, Steve Blackburn, Zena Ariola, Heather Miller

2021:
- Awardee: Ben Zorn
Citation: |
Expand Down
35 changes: 35 additions & 0 deletions _data/Software.yaml
Original file line number Diff line number Diff line change
@@ -1,3 +1,36 @@
2023:
- Awardee: OCaml
Citation: |

The OCaml Compiler Distribution is the reference implementation of
the OCaml language, a dialect of ML that aims to be pragmatic,
both in language features and implementation, encouraging a simple
programming style that yields good performance and usability. It
has a large user base in industry, research, and education
throughout the world, and was used to implement a number of other
impactful systems, notably in verification: Coq proof assistant,
CompCert verified compiler, Why3 verified programming environment,
Frama-C, Astrée and Gillian static analyzers, Infer, Hack and Flow
projects at Meta, SLAM/SDV and F* at Microsoft, etc.

The nominated contributors are:
* David Allsopp, Tarides
* Florian Angeletti, INRIA
* Stephen Dolan, Jane Street
* Damien Doligez, INRIA
* Alain Fritsch, Lexifi
* Jacque Garrigue, University of Nagoya
* Xavier Leroy, Collège de France
* Anil Madhavapeddy, Cambridge University
* Luc Maranget, INRIA
* Nicolás Ojeda Bär, Lexifi
* Gabriel Scherer, INRIA
* KC Sivaramakrishnan, Tarides
* Jérôme Vouillon, CNRS
* Leo White, Jane Street

Selection Commitee: Antony Hosking, Dominique Devriese, Manu Sridharan, Andreas Rossberg, David Grove

2022:
- Awardee: CompCert
Citation: |
Expand Down Expand Up @@ -28,6 +61,8 @@
* Bernhard Schommer
* Jean-Baptiste Tristan

Selection Commitee: Antony Hosking, Dominique Devriese, Manu Sridharan, Andreas Rossberg, David Grove

2021:
- Awardee: "WebAssembly"
Citation: |
Expand Down
Loading