Verification of heap manipulating programs with ordered data by extended forest automata

@article{Abdulla2013VerificationOH,
  title={Verification of heap manipulating programs with ordered data by extended forest automata},
  author={Parosh Aziz Abdulla and Luk{\'a}s Hol{\'i}k and Bengt Jonsson and Ondrej Leng{\'a}l and Cong Quy Trinh and Tom{\'a}s Vojnar},
  journal={Acta Informatica},
  year={2013},
  volume={53},
  pages={357-385}
}
We present a general framework for verifying programs with complex dynamic linked data structures whose correctness depends on ordering relations between stored data values. The underlying formalism of our framework is that of forest automata (FA), which has previously been developed for verification of heap-manipulating programs. We extend FA with constraints between data elements associated with nodes of the heaps represented by FA, and we present extended versions of all operations needed… CONTINUE READING