Vadim Zaliva

Vadim Zaliva

Auto-generated profile, based on publicly available information

Vadim Zaliva

University of Cambridge, Cambridge, United Kingdom

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
19 August 2021 in Proceedings of the ACM on Programming Languages
Verified
Journal Article
Open access
YZYannick Zakowski
Yannick Zakowski
CBCalvin Beck
Calvin Beck
IYIrene Yoon
Irene Yoon
IZIlia Zaichuk
Ilia Zaichuk
VZVadim Zaliva
Vadim Zaliva
SZSteve Zdancewic
Steve Zdancewic
This paper presents a novel formal semantics, mechanized in Coq, for a large, sequential subset of the LLVM IR. In contrast to previous approaches, which use relationally-specified operational semantics, this new semantics is based on monadic interpretation of interaction trees, a structure that provides a more compositional approach to defining language semantics while retaining the ability to extract an executable interpreter. Our semantics handles many of the LLVM IR's non-trivial language features and is constructed modularly in terms of event handlers, including those that deal with nondeterminism in the specification. We show how this semantics admits compositional reasoning principles derived from the interaction trees equational theory of weak bisimulation, which we extend here to better deal with nondeterminism, and we use them to prove that the extracted reference interpreter faithfully refines the semantic model. We validate the correctness of the semantics by evaluating it on unit tests and LLVM IR programs generated by HELIX.

21 September 2019 in Remote Sensing
Verified
Journal Article
Open access
PDF file
CCCorina Cerovski-Darriau
Corina Cerovski-Darriau
CCCorina Cerovski-Darriau
Corina Cerovski-Darriau
VZVadim Zaliva
Vadim Zaliva
JSJonathan Stock
Jonathan Stock
While machine learning techniques have been increasingly applied to land cover classification problems, these techniques have not focused on separating exposed bare rock from soil covered areas. Therefore, we built a convolutional neural network (CNN) to differentiate exposed bare rock (rock) from soil cover (other). We made a training dataset by mapping exposed rock at eight test sites across the Sierra Nevada Mountains (California, USA) using USDA’s 0.6 m National Aerial Inventory Program (NAIP) orthoimagery. These areas were then used to train and test the CNN. The resulting machine learning approach classifies bare rock in NAIP orthoimagery with a 0.95 F 1 score. Comparatively, the classical OBIA approach gives only a 0.84 F 1 score. This is an improvement over existing land cover maps, which underestimate rock by almost 90%. The resulting CNN approach is likely scalable but dependent on high-quality imagery and high-performance algorithms using representative training sets informed by expert mapping. As image quality and quantity continue to increase globally, machine learning models that incorporate high-quality training data informed by geologic, topographic, or other topical maps may be applied to more effectively identify exposed rock in large image collections.

17 April 2024
Verified
Conference Paper
Open access
VZVadim Zaliva
Vadim Zaliva
KMKayvan Memarian
Kayvan Memarian
RARicardo Almeida
Ricardo Almeida
JCJessica Clarke
Jessica Clarke
BDBrooks Davis
Brooks Davis
PSPeter Sewell
Peter Sewell
Memory safety issues are a persistent source of security vulnerabilities, with conventional architectures and the C codebase chronically prone to exploitable errors. The CHERI research project has shown how one can provide radically improved security for that existing codebase with minimal modification, using unforgeable hardware capabilities in place of machine-word pointers in CHERI dialects of C, implemented as adaptions of Clang/LLVM and GCC. CHERI was first prototyped as extensions of MIPS and RISC-V; it is currently being evaluated by Arm and others with the Arm Morello experimental architecture, processor, and platform, to explore its potential for mass-market adoption, and by Microsoft in their CHERIoT design for embedded cores. There is thus considerable practical experience with CHERI C implementation and use, but exactly what CHERI C's semantics is (or should be) remains an open question. In this paper, we present the first attempt to rigorously and comprehensively define CHERI C semantics, discuss key semantics design questions relating to capabilities, provenance, and undefined behaviour, and clarify them with semantics in multiple complementary forms: in prose, as an executable semantics adapting the Cerberus C semantics, and mechanised in Coq. This establishes a solid foundation for CHERI C, for those porting code to it, for compiler implementers, and for future semantics and verification.



10 January 2025
Verified
Conference Paper
Open access
VZVadim Zaliva
Vadim Zaliva
KMKayvan Memarian
Kayvan Memarian
BCBrian Campbell
Brian Campbell
RARicardo Almeida
Ricardo Almeida
NFNathaniel Filardo
Nathaniel Filardo
PSPeter Sewell
Peter Sewell
Memory safety concerns continue to be a major source of security vulnerabilities. The CHERI architecture, as instantiated in prototype CHERI-RISC-V cores, the Arm Morello system, and Microsoft's CHERIoT embedded core, provides fine-grained memory access control through unforgeable hardware capabilities. The impact of CHERI on spatial memory safety is well understood. This paper systematically examines temporal memory safety within CHERI C -- a dialect of the C programming language for CHERI -- and proposes a formal approach to defining and ensuring it. In particular: 1) we examine the impact of five existing capability revocation mechanisms on CHERI C semantics and present a specialised object memory model tailored to CHERI C; 2) we introduce a new CHERI-specific pointer provenance tracking scheme; and 3) we formally define the security guarantees provided by this memory model, supported by a Coq proof of their correctness, expressed as invariants of the memory state.