Julia Belyakova
where else to find them
what they talk about
where they keep going back
- OOPSLA2 editions2020–2021
all 5 in the filters
on a stage with
all 10 in the filters
who talks about the same things
- Benjamin W Chung6 talks
- Artem Pelenitsyn5 talks
- Jeff Bezanson6 talks
- Jan Vitek26 talks
- Ross Tate7 talks
- Viral B Shah9 talks
| title | conference | date |
|---|---|---|
| From Traces to Program Incorrectness: A Type-Theoretic Approach | TPSA 2025 | 2025-01-19 |
Claims a type-theoretic, underapproximate correctness method that treats library interactions as traces encoded with symbolic regular expressions and reasoned… | ||
| Derivative-Guided Symbolic Execution | POPL 2025 | 2025-01-19 |
Framework builds a symbolic execution for functional code that calls opaque, effectful libraries, encoding LTLf specs as symbolic finite automata and using… | ||
| Decidable Subtyping of Existential Types for Julia | PLDI 2024 | 2024-06-24 |
Proves Julia’s runtime subtyping is undecidable via reduction from System F<: and designs a restricted grammar that is stratify types into method signatures… | ||
| Julia: Practical Restrictions For A Scientific-Computing Language | LambdaConf 2024 | 2024-05-04 |
Julia claims that a few intentional restrictions buy huge runtime speed: concrete types are final so the compiler can do dispatch elimination and emit… | ||
| Type Stability in Julia: Avoiding Performance Pathologies in JIT Compilation | OOPSLA 2021 | 2021-10-17 |
Formalizes type stability and introduces a stronger property, type groundedness, proves grounded instances always fully devirtualize under a modeled JIT, and… | ||
| World Age in Julia: Optimizing Method Dispatch in the Presence of Eval | OOPSLA 2020 | 2020-11-15 |
Julia uses a world-age semantics that delays visibility of methods added by eval until between top-level calls, enabling safe inlining and avoiding… | ||
| nothing matches | ||