Modelling storage and resources: an introduction to separation logic

Supervisor
Dave Schmidt - Computing and Information Sciences Department, Kansas State University, USA
Date and time
Tuesday, July 13, 2004 at 5:00 PM
Place
Ca' Vignal - Piramide, Floor 0, Hall Verde
Programme Director
Roberto Giacobazzi
External reference
Publication date
July 5, 2004
Department
 

Summary

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.





© 2002 - 2021  Verona University
Via dell'Artigliere 8, 37129 Verona  |  P. I.V.A. 01541040232  |  C. FISCALE 93009870234