Jens Palsberg
where else to find them
linkedin:jens-palsberg-5b60339
what they talk about
all 6 in the filters
where they keep going back
- PLDI Workshop Honoring Andreas Podelski4 editions2022–2026
- OOPSLA2 editions2018–2025
all 6 in the filters
on a stage with
- Nengkun Yu2×
- Doug Leaonce
- Keli Huangonce
all 8 in the filters
who talks about the same things
- Michael Carbin14 talks
- Aws Albarghouthi14 talks
- Gilles Barthe17 talks
- Nengkun Yu10 talks
- Torsten Hoefler12 talks
- Amanda Xu6 talks
| title | conference | date |
|---|---|---|
| SAQR-QC: A Logic for Scalable but Approximate Quantitative Reasoning about Quantum(…) | PLDI 2026 | 2026-06-15 |
SAQR-QC combines quantum Hoare-style inequalities with quantum abstract interpretation to trade exactness for speed: each reasoning step touches only local… | ||
| Soundness of Predictive Concurrency Analyses | OOPSLA 2025 | 2025-10-16 |
Presents a unified, graph‑based definition of soundness for predictive concurrency analyses, lifts trace state‑similarity to execution‑graph similarity with… | ||
| Invited Talk: Welcome to Quantum 3.0! | POPL 2025 | 2025-01-19 |
Claims that 2024 experiments achieve small but real error suppression (logical error ≈ 0.1% logical error) and that current work produces only a few logical… | ||
| Closing Remarks | JENSFEST 2024 | 2024-10-22 |
Closing remarks list concrete habits, outcomes and a looming deadline: advice to make progress every day, judge work as new interesting difficult, use focused… | ||
| Optimal Quantum Programs | PLDI 2024 Workshop Honoring Andreas Podelski | 2024-06-25 |
Three notions of optimality are compared: reliability (gate error rates ~single‑qubit 99.99%, two‑qubit ~99.9%), depth (mapping to hardware is NP‑complete and… | ||
| Compiling Conditional Quantum Gates without Using Helper Qubits | PLDI 2024 | 2024-06-24 |
Compiles an n‑qubit conditional into a linear number of two‑qubit conditionals without helper qubits, using 278n gates overall and empirically requiring 1/3 as… | ||
| Quantum Abstract Interpretation | N40AI 2024 | 2024-01-20 |
Claims that abstract interpretation can verify quantum program assertions in polynomial time by representing abstract states as tuples of local projections and… | ||
| Business Meeting - PLDI 2022 | PLDI 2022 | 2022-06-13 |
PLDI 2022 reports concrete process changes: a single flat PC of 120 with four area chairs, no full PC meeting, and asynchronous discussion; paper assignment… | ||
| Quantum Computing & the Quantum Internet | Build Stuff 2020 | 2020-11-11 |
Claim: quantum hardware improves at a double‑exponential pace, with 72‑qubit Google machine and IBM systems above 50 qubits today and studies projecting ~300… | ||
| Awards/SIGPLAN Town Hall Meeting | OOPSLA 2018 | 2018-11-07 |
SIGPLAN reports spending $200,000 a year on travel grants for about 40 students per conference, offers gold open access paid for authors when needed, and asks… | ||
| nothing matches | ||