• Verifying pointer programs usi...

Treffer: Verifying pointer programs using graph grammars.

Title:
Verifying pointer programs using graph grammars.
Authors:
Heinen, Jonathan1, Jansen, Christina1, Katoen, Joost-Pieter1, Noll, Thomas1
Source:
Science of Computer Programming. Jan2015 Part 1, Vol. 97, p157-162. 6p.
Subject Terms:
*GRAPH grammars, *DATA structures, *COMPUTER software development, *COMPUTER software research, *COMPUTER programming
Database:
Academic Search Index

Weitere Informationen

This paper argues that graph grammars naturally model dynamic data structures such as lists, trees and combinations thereof. These grammars can be exploited to obtain finite abstractions of pointer-manipulating programs, thus enabling model checking. Experimental results for verifying Lindstrom's variant of the Deutsch–Schorr–Waite tree traversal algorithm illustrate this. [ABSTRACT FROM AUTHOR]