4 citations · 7 across the 8 of their papers we have counts for
Showing 2013Show all
2 papers · 1 filter
cs.LO2013★ 2 cited
Fully Automated Shape Analysis Based on Forest Automata
Lukas Holik, Ondrej Lengal, Adam Rogalewicz +2
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…
cs.LO2013★ 4 cited
The Tree Width of Separation Logic with Recursive Definitions
Radu Iosif, Adam Rogalewicz, Jiri Simacek
Separation Logic is a widely used formalism for describing dynamically allocated linked data structures, such as lists, trees, etc. The decidability status of various fragments of…