Pattern-based verification for trees

Authors:
Milan Češka;Pavel Erlebach;Tomáš Vojnar
Affiliations:
FIT, Brno University of Technology, Brno, Czech Republic;FIT, Brno University of Technology, Brno, Czech Republic;FIT, Brno University of Technology, Brno, Czech Republic
Venue:
EUROCAST'07 Proceedings of the 11th international conference on Computer aided systems theory
Year:
2007

Citing 7
Cited 0

The pointer assertion logic engine

Proceedings of the ACM SIGPLAN 2001 conference on Programming language design and implementation
Parametric shape analysis via 3-valued logic

ACM Transactions on Programming Languages and Systems (TOPLAS)
Pattern-Based Verification of Programs with Extended Linear Linked Data Structures

Electronic Notes in Theoretical Computer Science (ENTCS)
Abstract regular tree model checking of complex dynamic data structures

SAS'06 Proceedings of the 13th international conference on Static Analysis
Verifying programs with dynamic 1-selector-linked structures in regular model checking

TACAS'05 Proceedings of the 11th international conference on Tools and Algorithms for the Construction and Analysis of Systems
Automatic verification of pointer programs using grammar-based shape analysis

ESOP'05 Proceedings of the 14th European conference on Programming Languages and Systems
A local shape analysis based on separation logic

TACAS'06 Proceedings of the 12th international conference on Tools and Algorithms for the Construction and Analysis of Systems

Quantified Score

Hi-index	0.00

Visualization

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.