MOVES Seminar 27 Nov 2008

 

Juggrnaut : Rolling over the Deutsch-Schorr-Waite tree traversal algorithm

 

 

Jonathan Heinen

 

 

 

Abstract:

 

We present an abstraction framework for heap data structures called Juggrnaut. The framework employs graph grammars as an intuitive formalism for abstractly modeling dynamic data structures. It aims at extending finite-state verification techniques to handle pointer-manipulating programs operating on complex dynamic data structures that are potentially unbounded in their size.  

 

We demonstrate how Juggrnaut can be employed for analysis and verification purposes by giving its instantiation for binary trees, and by applying this instantiation to the well-known Deutsch-Schorr-Waite traversal algorithm.