Separation Logic Contracts for a Java-like Language with Fork/Join - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports (Technical Report) Year : 2008

Separation Logic Contracts for a Java-like Language with Fork/Join

Christian Haack
  • Function : Author
  • PersonId : 846315

Abstract

We adapt a variant of permission-accounting separation logic to a concurrent Java-like language with fork/join. To support both concurrent reads and information hiding, we combine fractional permissions with abstract predicates. We present a separation logic contract for iterators that prevents data races and concurrent modifications. Our program logic is presented in an algorithmic style, based on a proof-theoretical logical consequence. We show that verified programs satisfy the following properties: data race freedom, absence of null-dereferences and partial correctness.
Fichier principal
Vignette du fichier
techrep.pdf (947.4 Ko) Télécharger le fichier
Origin : Files produced by the author(s)
Loading...

Dates and versions

inria-00218114 , version 1 (25-01-2008)
inria-00218114 , version 2 (28-01-2008)
inria-00218114 , version 3 (27-02-2008)
inria-00218114 , version 4 (27-02-2008)

Identifiers

  • HAL Id : inria-00218114 , version 4

Cite

Christian Haack, Clément Hurlin. Separation Logic Contracts for a Java-like Language with Fork/Join. [Technical Report] RR-6430, INRIA. 2008, pp.101. ⟨inria-00218114v4⟩
82 View
340 Download

Share

Gmail Facebook Twitter LinkedIn More