Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
97 tokens/sec
GPT-4o
53 tokens/sec
Gemini 2.5 Pro Pro
44 tokens/sec
o3 Pro
5 tokens/sec
GPT-4.1 Pro
47 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Modular Formal Verification of Rust Programs with Unsafe Blocks (2212.12976v1)

Published 26 Dec 2022 in cs.LO and cs.PL

Abstract: Rust is a modern systems programming language whose type system guarantees memory safety. For the sake of expressivity and performance it allows programmers to relax typing rules temporarily, using unsafe code blocks. However, in unsafe blocks, the burden of making sure that the code does not end up having undefined behaviour is on the programmer. Even most expert programmers make mistakes and a memory safety bug in an unsafe block renders all the type system guarantees void. To address this problem we are trying to verify soundness of Rust unsafe code applying our Modular Symbolic Execution algorithm. This text outlines our approach and the progress that has been made so far.

User Edit Pencil Streamline Icon: https://streamlinehq.com
Authors (2)
  1. Nima Rahimi Foroushaani (1 paper)
  2. Bart Jacobs (60 papers)
Citations (1)

Summary

We haven't generated a summary for this paper yet.