
What we’re about
ATTENTION: Please join the PWL Discord and hop into the #nyc channel -> https://https://discord.gg/B7aHhwBb8r
We are organizing the next steps for PWL NYC there!
---
What was the last paper within the realm of computing you read and loved? What did it inspire you to build or tinker with? Come share the ideas in an awesome academic/research paper with fellow engineers, programmers, and paper-readers. Lead a session and show off code that you wrote that implements these ideas or just give us the lowdown about the paper (because of HARD MATH!). Otherwise, just come, listen, and discuss.
We're curating a repository for papers and places-to-find papers. You can contribute by adding PR's for papers, code, and/or links to other repositories.
We're posting videos of all our presentations, from all our chapters.
If you need to reach out to us or have ideas for papers, just ask us via our twitter account.
Papers We Love has a Code of Conduct. Please contact one of the Meetup's organizers if anyone is not following it. Be good to each other and to the PWL community!
Upcoming events (1)
See all- Michael Vaughn on EXE: Automatically Generating Inputs of DeathDatadog, New York, NY
We're please to present Michael Vaughn on EXE: Automatically Generating Inputs of Death (read the paper)
Autonomous testing complements conventional testing by leveraging cheap compute to explore software state spaces and uncover “unknown unknowns” beyond human-written tests. It spans a spectrum from random-input fuzzing, which is fast but struggles with complex conditions, to symbolic execution, which uses SAT solvers to systematically reach hard-to-hit paths—though these solvers can become prohibitively slow on complex constraints. Exe strikes a balance through concolic execution: it runs bare-metal code on concrete inputs while instrumenting paths with logical constraints, invoking a solver only when needed to explore alternate branches. This approach combines the speed of concrete execution with the path-finding power of symbolic methods, avoiding the full cost of traditional symbolic engines.
Michael Vaughn (he/him) has a PhD in computer science from the University of Wisconsin-Madison, and is a senior software engineer at Antithesis, working on their hypervisor and fuzzer. He spent the better part of a decade doing research at the intersection of operating systems and programming languages, somehow managing to write concerning amounts of x86 assembly, C, Scheme, Haskell, and LaTeX, often in the same day. He has also worked as a pub trivia host, and loves board games, hiking, and reading.
---
⚠️ Required: You must have your real name on your account and provide a photo ID at the entrance to attend, per the venue rules. If you are not on the list, you will not be admitted.
🚔 Reminder: Papers We Love has a code of conduct. Breaching the CoC is grounds to be ejected from the meetup at the organizers' discretion.
📹 The event will be recorded and made available 1-2 weeks afterwards.
💬 Join us on the Papers We Love Discord - https://discord.gg/6gupsBg4qp