PhD in Computer Science

The Ramifications of Sharing in Data Structures

Academic year 2012/2013

Sommario del corso

• Course objectives
• Results of learning outcomes
• Teaching tools

Course objectives

Programs manipulating mutable data structures with intrinsic sharing present a challenge for modular verification.  Deep aliasing inside data structures dramatically complicates reasoning in isolation over parts of these objects because changes to one part of the structure (say, the left child of a dag node) can affect other parts (the right child or some of its descendants) that may point into it.  The result is that finding intuitive and compositional proofs of correctness is usually a struggle.  We propose a compositional proof system that enables local reasoning in the presence of sharing.

While the AI "frame problem" elegantly captures the reasoning required to verify programs without sharing, we contend that natural reasoning about programs with sharing instead requires an answer to a different and more challenging AI problem, the "ramification problem": reasoning about the indirect consequences of actions.  Accordingly, we present a Ramify proof rule that attacks the ramification problem head-on and show how to reason with it.  Our framework is valid in any separation logic and permits sound compositional and local reasoning in the context of both specified and unspecified sharing.  This talk will be illustrated by proofs of examples manipulating dags, graphs, and overlaid data structures.

Results of learning outcomes

The seminar will be held

 Jules Villard (http://www0.cs.ucl.ac.uk/staff/J.Villard/)

 University College London

Class schedule

• Teaching materials
• Exams and finals
• Go to Moodle
• Visit the forums