Conference item icon

Conference item

Verifying C++ with STL containers via predicate abstraction

Abstract:
This paper describes a flexible and easily extensible predicate abstraction-based approach to the verification of STLusage, and observes the advantages of verifying programsin terms of high-level data structures rather than low-level pointer manipulations. We formalize the semantics of the STL by means of a Hoare-style axiomatization. The verification requires an operational model conservatively approximating the semantics given by the Standard. Our results show advantages (in terms of errors detected and false positives avoided) over previous attempts to analyze STL usage, due to the power of the abstraction engine and model checker.
Publication status:
Published
Peer review status:
Peer reviewed

Actions


Access Document


Files:
Publisher copy:
10.1145/1321631.1321724

Authors


More by this author
Institution:
University of Oxford
Division:
MPLS
Department:
Computer Science
Role:
Author

Contributors

Role:
Editor
Role:
Editor
Role:
Editor


Publisher:
Association for Computing Machinery
Host title:
ASE '07 Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering
Journal:
ASE '07 Proceedings of the twenty-second IEEE/ACM international conference on Automated software engineering More from this journal
Pages:
521-524
Publication date:
2007-12-01
DOI:
ISBN:
9781595938824


Keywords:
Pubs id:
pubs:327242
UUID:
uuid:8d445dd2-9eaa-4b1b-96d7-588052c1b11d
Local pid:
pubs:327242
Source identifiers:
327242
Deposit date:
2017-01-28

Terms of use



Views and Downloads






If you are the owner of this record, you can report an update to it here: Report update to this record

TO TOP