Přístupnostní navigace
E-application
Search Search Close
Publication detail
DUDKA, K. PERINGER, P. VOJNAR, T.
Original Title
Byte-Precise Verification of Low-Level List Manipulation
Type
article in a collection out of WoS and Scopus
Language
English
Original Abstract
We propose a new approach to shape analysis of programs with linked lists that use low-level memory operations. Such operations include pointer arithmetic, safe usage of invalid pointers, block operations with memory, reinterpretation of the memory contents, address alignment, etc. Our approach is based on a new representation of sets of heaps, which is to some degree inspired by works on separation logic with higher-order list predicates, but it is graph-based and uses a more fine-grained (byte-precise) memory model in order to support the various low-level memory operations. The approach was implemented in the Predator tool and successfully validated on multiple non-trivial case studies that are beyond the capabilities of other current fully automated shape analysis tools.
Keywords
dynamic linked data structures, separation logic, symbolic memory graphs, list manipulation, low-level memory manipulation, memory safety, shape analysis
Authors
DUDKA, K.; PERINGER, P.; VOJNAR, T.
RIV year
2013
Released
12. 5. 2013
Publisher
Springer Verlag
Location
Berlin
ISBN
978-3-642-38855-2
Book
20th Static Analysis Symposium
Edition
Lecture Notes in Computer Science Volume 7935
0302-9743
Periodical
Lecture Notes in Computer Science
Year of study
20
Number
7935
State
Federal Republic of Germany
Pages from
215
Pages to
237
Pages count
23
BibTex
@inproceedings{BUT103494, author="Kamil {Dudka} and Petr {Peringer} and Tomáš {Vojnar}", title="Byte-Precise Verification of Low-Level List Manipulation", booktitle="20th Static Analysis Symposium", year="2013", series="Lecture Notes in Computer Science Volume 7935", journal="Lecture Notes in Computer Science", volume="20", number="7935", pages="215--237", publisher="Springer Verlag", address="Berlin", isbn="978-3-642-38855-2", issn="0302-9743" }