Mon 19 Jun 2023 18:30 - 18:37 at Cypress 1 - SRC: Poster Session

Rust is a general-purpose, memory-safe programming language with the aim of providing guaranteed safety regarding manipulating, reading and storing data. Currently, there is no formal specification for the Rust compiler. Without the behaviour of Rust defined, how do we know that our code has sound behaviour? This project takes a small step towards a formal treatment of the Rust compiler by formalising a fragment of the intermediate language MIR, and hand-proving the correctness of a simple optimisation.

MIR (Middle Intermediate Representation) is the language of the Rust compiler’s frontend, post-type checking and prior to translation to LLVM IR. Several MIR-to-MIR optimisations take place in the complier. One such optimisation, ‘simplify branches’, eliminates dead branches in conditionals with constant value conditions. We provide a grammar for a fragment of MIR sufficient to express a set of programs that the optimisation targets. We provide a formal semantics for this MIR fragment, a formal definition of simplify branches, and hand-prove the soundness of simplify branches. This exploratory work makes a first step toward verification of the frontend to the Rust compiler.

Mon 19 Jun

Displayed time zone: Eastern Time (US & Canada) change

18:00 - 19:30
SRC: Poster SessionSRC at Cypress 1
18:00
7m
Poster
An Eager SMT Solver for Algebraic Data Type Queries
SRC
File Attached
18:07
7m
Poster
A Synchronization Mechanism for an Accelerator Design IR
SRC
Pai Li Cornell University, USA
Media Attached
18:15
7m
Poster
ConstraintFlow: A Declarative DSL for Certified Artificial Intelligence
SRC
Media Attached
18:22
7m
Poster
Distributions for Compositionally Differentiating Parametric Discontinuities
SRC
Jesse Michel Massachusetts Institute of Technology
Media Attached
18:30
7m
Poster
Formal Verification of a MIR-to-MIR optimisation
SRC
Media Attached
18:37
7m
Poster
Formal verification of approximate differential privacy via the characteristic function
SRC
Media Attached
18:45
7m
Poster
Leveraging Far Memory for Data-Intensive Processing: A Hotness-Segregated Heap Approach
SRC
Dat Nguyen Texas A & M University
File Attached
18:52
7m
Poster
On lightweight Hoare logic of probabilistic programs: a bound tighter than the union bound
SRC
Xingyu Xie Tsinghua University
Media Attached
19:00
7m
Poster
Prettybird: A DSL for Programmatic Font Compilation
SRC
Charles Averill University of Texas at Dallas
Media Attached
19:07
7m
Poster
Quantum Simulation using Context-Free-Language Ordered Binary Decision Diagrams
SRC
Media Attached
19:15
7m
Poster
Resource Sharing through Control-Flow Based Optimizations
SRC
Media Attached
19:22
7m
Poster
Scaling Decision-Theoretic Probabilistic Programs Through Factorization
SRC
Minsung Cho Northeastern University
Media Attached