Fully Abstract and Robust Compilation: And How to Reconcile the Two, Abstractly
No abstract available.
Related papers
- Reconciling transactional conflicts with compiler's help CGO 2012
- Proving data-poisoning robustness in decision trees PLDI 2020
- A general construction for abstract interpretation of higher-order automatic differentiation OOPSLA 2022
- RPython: a step towards reconciling dynamically and statically typed OO languages DLS 2007
- Reconciling Shannon and Scott with a Lattice of Computable Information POPL 2023
- A Two-Phase Infinite/Finite Low-Level Memory Model: Reconciling Integer-Pointer Casts, Finite Space, and undef at the LLVM IR Level of Abstraction ICFP 2024
- Reconciling exhaustive pattern matching with objects PLDI 2013
- Reconciling Preemption Bounding with DPOR TACAS 2023