ATVA
2007
Springer
15 years 9 months ago
2007
Springer
Abstract. We consider the termination problem of programs manipulating treelike dynamic data structures. Our approach is based on a counter-example guided ion refinement loop. We ...