Fully automated shape analysis based on forest automata

Authors:
Lukáš Holík;Ondřej Lengál;Adam Rogalewicz;Jiří Šimáček;Tomáš Vojnar
Affiliations:
IT4Innovations Centre of Excellence, FIT, Brno University of Technology, Czech Republic;IT4Innovations Centre of Excellence, FIT, Brno University of Technology, Czech Republic;IT4Innovations Centre of Excellence, FIT, Brno University of Technology, Czech Republic;IT4Innovations Centre of Excellence, FIT, Brno University of Technology, Czech Republic;IT4Innovations Centre of Excellence, FIT, Brno University of Technology, Czech Republic
Venue:
CAV'13 Proceedings of the 25th international conference on Computer Aided Verification
Year:
2013

Citing 11
Cited 0

Skip lists: a probabilistic alternative to balanced trees

Communications of the ACM
Shape analysis with inductive recursion synthesis

Proceedings of the 2007 ACM SIGPLAN conference on Programming language design and implementation
Scalable Shape Analysis for Systems Code

CAV '08 Proceedings of the 20th international conference on Computer Aided Verification
Automatic numeric abstractions for heap-manipulating programs

Proceedings of the 37th annual ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Juggrnaut: Graph Grammar Abstraction for Unbounded Heap Structures

Electronic Notes in Theoretical Computer Science (ENTCS)
SLAYER: memory safety for systems-level code

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Predator: a practical tool for checking manipulation of dynamic data structures using separation logic

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Forest automata for verification of heap manipulation

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Program analysis for overlaid data structures

CAV'11 Proceedings of the 23rd international conference on Computer aided verification
Abstract regular (tree) model checking

International Journal on Software Tools for Technology Transfer (STTT) - Regular Model Checking
Shape analysis with structural invariant checkers

SAS'07 Proceedings of the 14th international conference on Static Analysis

Quantified Score

Hi-index	0.00

Visualization

Abstract

Forest automata (FA) have recently been proposed as a tool for shape analysis of complex heap structures. FA encode sets of tree decompositions of heap graphs in the form of tuples of tree automata. In order to allow for representing complex heap graphs, the notion of FA allowed one to provide user-defined FA (called boxes) that encode repetitive graph patterns of shape graphs to be used as alphabet symbols of other, higher-level FA. In this paper, we propose a novel technique of automatically learning the FA to be used as boxes that avoids the need of providing them manually. Further, we propose a significant improvement of the automata abstraction used in the analysis. The result is an efficient, fully-automated analysis that can handle even as complex data structures as skip lists, with the performance comparable to state-of-the-art fully-automated tools based on separation logic, which, however, specialise in dealing with linked lists only.