A Pragmatic Type System for Deductive Verification - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Preprints, Working Papers, ... Year : 2016

A Pragmatic Type System for Deductive Verification


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.
Fichier principal
Vignette du fichier
main (1).pdf (376.6 Ko) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-01256434 , version 1 (14-01-2016)
hal-01256434 , version 2 (28-01-2016)
hal-01256434 , version 3 (01-02-2016)


  • 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⟩
773 View
465 Download


Gmail Mastodon Facebook X LinkedIn More