HAL will be down for maintenance from Friday, June 10 at 4pm through Monday, June 13 at 9am. More information
Skip to Main content Skip to Navigation

Harnessing forest automata for verification of heap manipulating programs

Abstract : This work addresses verification of infinite-state systems, more specifically, verification of programs manipulating complex dynamic linked data structures. Many different approaches emerged to date, but none of them provides a sufficiently robust solution which would succeed in all possible scenarios appearing in practice. Therefore, in this work, we propose a new approach which aims at improving the current state of the art in several dimensions. Our approach is based on using tree automata, but it is also partially inspired by some ideas taken from the methods based on separation logic. Apart from that, we also present multiple advancements within the implementation of various tree automata operations, crucial for our verification method to succeed in practice. Namely, we provide an optimised algorithm for computing simulations over labelled transition systems which then translates into more efficient computation of simulations over tree automata. We also give a new algorithm for checking inclusion over tree automata, and we provide experimental evaluation demonstrating that the new algorithm outperforms other existing approaches.
Complete list of metadata

Cited literature [56 references]  Display  Hide  Download

Contributor : Abes Star :  Contact
Submitted on : Tuesday, June 27, 2017 - 10:46:10 AM
Last modification on : Friday, March 25, 2022 - 9:43:52 AM
Long-term archiving on: : Wednesday, January 17, 2018 - 7:34:18 PM


Version validated by the jury (STAR)


  • HAL Id : tel-00805794, version 2



Jiri Simacek. Harnessing forest automata for verification of heap manipulating programs. Systems and Control [cs.SY]. Université de Grenoble; Brno University of Technology (MAIS), 2012. English. ⟨NNT : 2012GRENM049⟩. ⟨tel-00805794v2⟩



Record views


Files downloads