Verification of Heap Manipulating Programs with Ordered Data by Extended Forest Automata

Download Now
Provided by: Uppror Media Group
Topic: Big Data
Format: PDF
The authors 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 their framework is that of Forest Automata (FA), which has previously been developed for verification of heap-manipulating programs. They extend FA by constraints between data elements associated with nodes of the heaps represented by FA, and they present extended versions of all operations needed for using the extended FA in a fully automated verification approach, based on abstract interpretation.
Download Now

Find By Topic