Call for Presentations
Talks can present completed work, outline work in progress, demonstrate a system, or provide a short tutorial on a topic of general interest.
Presenters may indicate which of the following three kinds of slots they could use, and their preferences between them:
- Full talks are generally of about 20 minutes of length, with substantial time for discussion, in ideally a 30-minute slot
- Short talks are generally of about 5-10 minutes of length, with less time for overall discussion, in 10-15 minute-slots
- Lightning talks are meant to either introduce yourself to the community, or give a brief status update. Depending on scheduling, they may be in 2-5 minute slots, with no time alotted for discussion.
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. We will try to keep the main program between 10:00 and 17:00 to enable most attendees to make this a day trip.
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.
The deadline to register interest in presenting at SAPLING while participating in the general selection of presenters is November 5th, 2025. Selected presenters will be notified by November 10th, 2025. Any leftover presentation slots will be allocated on a first-come-first-serve basis.
Participating
All attendees need to be registered ahead of time. The deadline to fill out the the expression-of-interest form for participation is November 16th. However, please register early if you can. There is no cost to attending, but the earlier we have a good estimate on the number of attendees, the easier it is to plan.
Venue
SAPLING 2025 will happen on November 24th at Google Sydney, Pyrmont. More details to be announced later.
Schedule
| From | To | ||||||
|---|---|---|---|---|---|---|---|
| 10:00 | 10:10 | Welcome | |||||
| 10:10 | 10:15 | Xin Lu (ANU) | Getting started with incorrectness logic: backward reasoning for program exploitation | B | |||
| 10:15 | 10:20 | Thomas Sewell (UNSW) | Intro to PL & Verification work at UNSW and/or Subdividing a Formal Spec | B | |||
| 10:20 | 10:25 | Huw Campbell (Simple Machines) | A Stitch in Time - the time travelling optimisation | A | B | ||
| 10:25 | 10:35 | Sasha Pak (ANU) | View Types in Rust | A | B | ||
| 10:40 | 11:10 | Jack Luo (USyd) | Input Repair without Format Specifications | A | B | ||
| 11:10 | 11:25 | Break | |||||
| 11:25 | 11:35 | Danushka Liyanage (USyd) | Evaluating Statistical Maximum Coverage Estimators in Fuzzing | A | B | ||
| 11:40 | 11:50 | Tim McGilchrist (Tarides) | Improving the Observability of Multicore OCaml | A | B | ||
| 11:55 | 12:25 | Alex Mirrlees-Black (ANU) | A Programming Language for Type-safe Object Evolution | A | B | ||
| 12:25 | 14:00 | Lunch Break | |||||
| 14:00 | 14:05 | Shangzhi Xu (UNSW Canberra) | Root Causes of Buffer Overflows: An Empirical Study | B | |||
| 14:05 | 14:10 | Carlo Zancarano (ANU) | Gradual Typing | ||||
| 14:10 | 14:20 | Kait Lam (UQ) | Programmatically generating a bidirectional assembler/disassembler | A | B | ||
| 14:25 | 14:35 | Jack Stodart (ANU) | Interacting with Automatic Verifiers | A | B | ||
| 14:40 | 15:10 | Halogen Truong (UNSW) | Improving the Safety of the Pancake Language | A | B | ||
| 15:10 | 15:45 | Break | |||||
| 15:45 | 15:55 | Hayley Patton (ANU) | Compressors and Compactors in MMTk | A | B | ||
| 16:00 | 16:10 | Thomas Liang (UNSW) | Refining Touched Addresses for Time Protection | A | B | ||
| 16:15 | 16:45 | Panel | |||||
Contact
If you have any questions about SAPLING 2025, please contact Fabian Muehlboeck at fabian.muehlboeck AT anu.edu.au .Sponsors
