Skip to Main content Skip to Navigation
New interface
Preprints, Working Papers, ...

A Pragmatic Type System for Deductive Verification

Abstract : In the context of deductive verication, it is customary today to handle programs with pointers using either separation logic, dynamic frames, or explicit memory models. Yet we can observe that in numerous programs, a large amount of code ts within the scope of Hoare logic, provided we can statically control aliasing. When this is the case, the code correctness can be reduced to simpler verication conditions which do not require any explicit memory model. This makes verication conditions more amenable both to automated theorem proving and to manual inspection and debugging. In this paper, we devise a method of such static aliasing control for a programming language featuring nested data structures with mutable components. Our solution is based on a type system with singleton regions and eects, which we prove to be sound.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [31 references]  Display  Hide  Download
Contributor : Jean-Christophe Filliâtre Connect in order to contact the contributor
Submitted on : Monday, February 1, 2016 - 10:24:14 AM
Last modification on : Saturday, June 25, 2022 - 10:19:04 PM
Long-term archiving on: : Friday, November 11, 2016 - 9:08:23 PM


main (1).pdf
Files produced by the author(s)


  • HAL Id : hal-01256434, version 3


Jean-Christophe Filliâtre, Léon Gondelman, Andrei Paskevich. A Pragmatic Type System for Deductive Verification. 2016. ⟨hal-01256434v3⟩



Record views


Files downloads