DUDKA, Kamil, Lukáš HOLÍK, Petr PERINGER, Marek TRTÍK and Tomáš VOJNAR. From Low-Level Pointers to High-Level Containers. In B. Jobstmann, K. Rustan, M. Leino. Verification, Model Checking, and Abstract Interpretation. LNCS, VMCAI 2016. St. Petersburg, Florida, United States: Springer, Switzerland, 2016, p. 431-452. ISBN 978-3-662-49121-8. Available from: https://dx.doi.org/10.1007/978-3-662-49122-5_21.
Other formats:   BibTeX LaTeX RIS
Basic information
Original name From Low-Level Pointers to High-Level Containers
Authors DUDKA, Kamil (203 Czech Republic), Lukáš HOLÍK (203 Czech Republic), Petr PERINGER (203 Czech Republic), Marek TRTÍK (203 Czech Republic, belonging to the institution) and Tomáš VOJNAR (203 Czech Republic, guarantor).
Edition LNCS, VMCAI 2016. St. Petersburg, Florida, United States, Verification, Model Checking, and Abstract Interpretation, p. 431-452, 22 pp. 2016.
Publisher Springer, Switzerland
Other information
Original language English
Type of outcome Proceedings paper
Field of Study 20206 Computer hardware and architecture
Country of publisher Switzerland
Confidentiality degree is not subject to a state or trade secret
Publication form printed version "print"
Impact factor Impact factor: 0.402 in 2005
RIV identification code RIV/00216224:14330/16:00089165
Organization unit Faculty of Informatics
ISBN 978-3-662-49121-8
ISSN 0302-9743
Doi http://dx.doi.org/10.1007/978-3-662-49122-5_21
UT WoS 000375148800021
Keywords in English Shape analysis; list; program transformation
Tags C language, firank_A, program transformation, shape analysis, static analysis
Tags International impact, Reviewed
Changed by Changed by: RNDr. Pavel Šmerk, Ph.D., učo 3880. Changed: 14/5/2020 15:18.
Abstract
We propose a method that transforms a C program manipulating containers using low-level pointer statements into an equivalent program where the containers are manipulated via calls of standard high-level container operations like push_back or pop_front. The input of our method is a C program annotated by a special form of shape invariants which can be obtained from current automatic shape analysers after a slight modification. The resulting program where the low-level pointer statements are summarized into high-level container operations is more understandable and (among other possible benefits) better suitable for program analysis. We have implemented our approach and successfully tested it through a number of experiments with list-based containers, including experiments with simplification of program analysis by separating shape analysis from analysing data-related properties.
PrintDisplayed: 25/4/2024 08:21