Verification of Programs with Pointers in SPARK

Jaloyan, Georges-Axel; Dross, Claire; Maalej, Maroua; Moy, Yannick; Paskevich, Andrei

doi:10.1007/978-3-030-63406-3_4

Cited by 3 publications

(1 citation statement)

References 20 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For a long-time, it was restricted to a subset of Ada without pointers. Support for pointers was added in 2020 [13], based on an ownership policy similar to Rust's. At the start Spark used a notion of pledges similar to Prusti's, but they have now replaced it with prophecies.…”

Section: Related Workmentioning

confidence: 99%

Creusot: A Foundry for the Deductive Verification of Rust Programs

Denis

Jourdan

Marché

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

Rust is a fairly recent programming language for system programming, bringing static guarantees of memory safety through a strict ownership policy. The strong guarantees brought by this feature opens promising progress for deductive verication, which aims at proving the conformity of Rust code with respect to a specication of its intended behavior. We present the foundations of Creusot, a tool for the formal specication and deductive verication of Rust code. A rst originality comes from Creusot's specication language, which features a notion of prophecy to reason about memory mutation, working in harmony with Rust's ownership system. A second originality is how Creusot builds upon Rust trait system to provide several advanced abstraction features.Keywords: Rust programming language • Deductive program verication • Aliasing and Ownership • Prophecies • Traits.

show abstract

Section: Related Workmentioning

confidence: 99%

Creusot: A Foundry for the Deductive Verification of Rust Programs

Denis

Jourdan

Marché

2022

Lecture Notes in Computer Science

View full text Add to dashboard Cite

show abstract

HOL4P4: Mechanized Small-Step Semantics for P4

Alshnakat,

Lundberg,

Guanciale

et al. 2024

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

We present the first semantics of the network data plane programming language P4 able to adequately capture all key features of P4 16 , the most recent version of P4, including external functions (externs) and concurrency. These features are intimately related since, in P4, extern invocations are the only points at which one execution thread can affect another. Reflecting P4’s lack of a general-purpose memory and the presence of multithreading the semantics is given in small-step style and eschews the use of a heap. In addition to the P4 language itself, we provide an architectural level semantics, which allows the composition of P4-programmed blocks, models end-to-end packet processing, and can take into account features such as arbitration and packet recirculation. A corresponding type system is provided with attendant progress, preservation, and type-soundness theorems. Semantics, type system, and meta-theory are formalized in the HOL4 theorem prover. From this formalization, we derive a HOL4 executable semantics that supports verified execution of programs with partially symbolic packets able to validate simple end-to-end program properties.

show abstract

A Safe Low-Level Language for Computer Algebra and Its Formally Verified Compiler

Melquiond,

Moreau

2024

Proc. ACM Program. Lang.

View full text Add to dashboard Cite

This article describes a programming language for writing low-level libraries for computer algebra systems. Such libraries (GMP, BLAS/LAPACK, etc) are usually written in C, Fortran, and Assembly, and make heavy use of arrays and pointers. The proposed language, halfway between C and Rust, is designed to be safe and to ease the deductive verification of programs, while being low-level enough to be suitable for this kind of computationally intensive applications. This article also describes a compiler for this language, based on CompCert. The safety of the language has been formally proved using the Coq proof assistant, and so has the property of semantics preservation for the compiler. While the language is not yet feature-complete, this article shows what it entails to design a new domain-specific programming language along its formally verified compiler.

show abstract

Verification of Programs with Pointers in SPARK

Cited by 3 publications

References 20 publications

Creusot: A Foundry for the Deductive Verification of Rust Programs

Creusot: A Foundry for the Deductive Verification of Rust Programs

HOL4P4: Mechanized Small-Step Semantics for P4

A Safe Low-Level Language for Computer Algebra and Its Formally Verified Compiler

Contact Info

Product

Resources

About