Chin, W.-N. and David, C. and Nguyen, H.H. and Qin, S. (2007) 'Automated verification of shape, size and bag properties.', in 12th IEEE International Conference on Engineering of Complex Computer Systems, 11-14 Jul 2007, Auckland, New Zealand ; proceedings. Los Alamitos, CA: IEEE, pp. 307-320.
In recent years, separation logic has emerged as a contender for formal reasoning of heap-manipulating imperative programs. Recent works have focused on specialised provers that are mostly based on fixed sets of predicates. To improve expressivity, we have proposed a prover that can automatically handle user-defined predicates. These shape predicates allow programmers to describe a wide range of data structures with their associated size properties. In the current work, we shall enhance this prover by providing support for a new type of constraints, namely bag (multi-set) constraints. With this extension, we can capture the reachable nodes (or values) inside a heap predicate as a bag constraint. Consequently, we are able to prove properties about the actual values stored inside a data structure.
|Item Type:||Book chapter|
|Full text:||PDF - Published Version (179Kb)|
|Publisher Web site:||http://dx.doi.org/10.1109/ICECCS.2007.17|
|Publisher statement:||© 2007 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.|
|Record Created:||17 Nov 2009 12:20|
|Last Modified:||08 Nov 2010 11:05|
|Social bookmarking:||Export: EndNote, Zotero | BibTex|
|Usage statistics||Look up in GoogleScholar | Find in a UK Library|