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. © Springer-Verlag Berlin Heidelberg 2007.
Cite
CITATION STYLE
Češka, M., Erlebach, P., & Vojnar, T. (2007). Pattern-based verification for trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4739 LNCS, pp. 488–496). Springer Verlag. https://doi.org/10.1007/978-3-540-75867-9_62
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
