Program analysis in a combined abstract domain
Automated verification of heap-manipulating programs is a challenging task due to the complexity of aliasing and mutability of data structures used in these programs. The properties of a number of important data structures do not only relate to one domain, but to combined multiple domains, such as s...
| Main Author: | |
|---|---|
| Published: |
Durham University
2011
|
| Online Access: | http://ethos.bl.uk/OrderDetails.do?uin=uk.bl.ethos.545634 |