Sciweavers

Share
EUROCAST
2007
Springer

Pattern-Based Verification for Trees

9 years 2 months ago
Pattern-Based Verification for Trees
Abstract. Pattern-based verification trying to abstract away the concrete number of repeated memory structures is one of the approaches that have recently been proposed for verification of programs using dynamic data structures linked with pointers. It proved to be very efficient and promising on extended linear data structures. In this paper, we overview some possibilities how to extend this approach to programs over tree structures.
Milan Ceska, Pavel Erlebach, Tomás Vojnar
Added 16 Aug 2010
Updated 16 Aug 2010
Type Conference
Year 2007
Where EUROCAST
Authors Milan Ceska, Pavel Erlebach, Tomás Vojnar
Comments (0)
books