Modelling storage and resources: an introduction to separation logic

Relatore
Dave Schmidt - Computing and Information Sciences Department, Kansas State University, USA

Data e ora
martedì 13 luglio 2004 alle ore 17.00

Luogo
Ca' Vignal 3 - Piramide, Piano 0, Sala Verde

Referente
Roberto Giacobazzi

Referente esterno

Data pubblicazione
5 luglio 2004

Dipartimento
 

Riassunto

Programs, processes, resources, and storage heaps are often
modelled by graphs, and correctness properties are validated on the
graphs. The correctness proofs are often complicated because the graph's
nodes are _shared_ by the graph's edges.

Separation logic, developed by O'Hearn, Reynolds, and Yang,
is a simple extension of Hoare logic for writing compositional
correctness proofs for such graphs.

In this introductory presentation, we review Hoare logic,
show the difficulties that arise when there is sharing of resources,
and show how separation logic removes (some of) the difficulties. We
apply separation logic to example programs that manipulate storage heaps
and shared resources.
ornamento
Inizio pagina