14 citations · 17 across the 6 of their papers we have counts for
6 papers
From Traces to Program Incorrectness: A Type-Theoretic Approach
Yongwei Yuan, Zhe Zhou, Julia Belyakova +2
We present a type-theoretic framework for reasoning about incorrectness in functional programs that interact with effectful, opaque library APIs. Our approach centers on traces --…
Derivative-Guided Symbolic Execution
Yongwei Yuan, Zhe Zhou, Julia Belyakova +1
We consider the formulation of a symbolic execution (SE) procedure for functional programs that interact with effectful, opaque libraries. Our procedure allows specifications of li…
Type Stability in Julia: Avoiding Performance Pathologies in JIT Compilation (Extended Version)
Artem Pelenitsyn, Julia Belyakova, Benjamin Chung +2
As a scientific programming language, Julia strives for performance but also provides high-level productivity features. To avoid performance pathologies, Julia users are expected t…
World Age in Julia: Optimizing Method Dispatch in the Presence of Eval (Extended Version)
Julia Belyakova, Benjamin Chung, Jack Gelinas +3
Dynamic programming languages face semantic and performance challenges in the presence of features, such as eval, that can inject new code into a running program. The Julia program…
Decidable Tag-Based Semantic Subtyping for Nominal Types, Tuples, and Unions
Julia Belyakova
Semantic subtyping enables simple, set-theoretical reasoning about types by interpreting a type as the set of its values. Previously, semantic subtyping has been studied primarily…
Generic Approach to Certified Static Checking of Module-like Constructs
Julia Belyakova
In this paper we consider the problem of certified static checking of module-like constructs of programming languages. We argue that there are algorithms and properties related to…