Register your interest in attending
To register, please fill out the expression-of-interest form. Since attendance is free and the form is public, please provide some verifiable information that puts you in our target interest group. This can be in the form of an institutional e-mail address from a relevant university or company, a publication record, github account, personal website content, etc. There are capacity limits to our venue which we do not expect to exceed, but technically, we will verify and confirm registrations on a first-come-first-serve basis.
Please register your intent to attend SAPLING by November 1, 2023, though at the latest by November 17, 2023.
Call for Presentations
SAPLING talks are generally of 20 minutes duration with substantial periods of time available for discussion. Talks can present completed work, outline work in progress, demonstrate a system, or provide a short tutorial on a topic of general interest.
As far as possible, selection of presenters is non-competitive, with all interested qualified speakers given an opportunity to talk, within the time constraints of a one day meeting. Preference will be given to topics of general interest.
No proceedings will be published but the talk abstracts and links to related material will be published on the SAPLING website.
To register your interest in giving a presentation, please fill out the expression-of-interest form and indicate details about your presentation.
Presentation allocations will be decided and notified separately from registrations, in early November.
The deadline to register interest in presenting at SAPLING while participating in the general selection of presenters is November 1, 2023. Any leftover presentation slots will be allocated on a first-come-first-serve basis.
VenueSAPLING 2023 will happen as a full-day in-person event on December 1st, 2023, at Google Sydney. A light breakfast, lunch, and snacks will be provided by Google.
|09:40||10:00||Nick Webster (VUW)||(Don't Fear) The Object|
|10:00||10:20||Pengbo Yan (UniMelb)||Formally Verifying the Obliviousness of Probabilistic Algorithms|
|10:20||10:40||Yanqi Su (ANU)||Constructing a System Knowledge Graph of User Tasks and Failures from Bug Reports to Support Soap Opera Testing|
|10:40||11:00||Francois Gauthier (Oracle Labs)||Runtime and Software Supply Chain Security Research at Oracle Labs|
|11:10||11:30||Sameer Ali (ANU)||Applications of Zero-Knowledge Proofs|
|11:30||11:50||Zixian Cai (ANU)||Trashy Inflation: How Garbage Collectors Are Getting Worse, and How We Can Fix It|
|11:50||12:10||Kunal Sareen (ANU)||Lower Bound Overheads of Android Garbage Collection|
|12:10||12:30||Google Research Talk|
|13:00||14:00||Lunch + Social Activity TBA|
|14:00||14:25||Matt Roberts (MQ)||A Survey of Pattern Matching|
|14:25||14:50||Huw Campbell (Simple Machines)||Icicle: Composable Streaming Queries with Modal Types|
|14:50||15:15||Rahul Gopinath (U Sydney)||Dancing to Unknown Music: Learning Black-Box Program Input Grammars with Prefix Queries|
|15:45||16:10||Gary Miller (The Helix Collective)||The C3 Model - Modelling the Fitness of a System of Languages|
|16:10||16:35||Julian Mestre (U Sydney)||Optimizing Function Layout for Mobile Applications|
|16:35||17:00||Fabian Muehlboeck (ANU)||Language Design and the Semantics of Partial Programs|