Detail publikace

Low-Level Bi-Abduction

HOLÍK, L. PERINGER, P. ROGALEWICZ, A. ŠOKOVÁ, V. VOJNAR, T. ZULEGER, F.

Originální název

Low-Level Bi-Abduction

Anglický název

Low-Level Bi-Abduction

Jazyk

en

Originální abstrakt

The paper proposes a new static analysis designed to handle open programs, i.e., fragments of programs, with dynamic pointer-linked data structures in particular, various kinds of lists that employ advanced low-level pointer operations. The goal is to allow such programs be analysed without a need of writing analysis harnesses that would first initialise the structures being handled. The approach builds on a special flavour of separation logic and the approach of bi-abduction. The code of interest is analyzed along the call tree, starting from its leaves, with each function analysed just once without any call context, leading to a set of contracts summarizing the behaviour of the analysed functions. In order to handle the considered programs, methods of abduction existing in the literature are significantly modified and extended in the paper. The proposed approach has been implemented in a tool prototype and successfully evaluated on not large but complex programs.

Anglický abstrakt

The paper proposes a new static analysis designed to handle open programs, i.e., fragments of programs, with dynamic pointer-linked data structures in particular, various kinds of lists that employ advanced low-level pointer operations. The goal is to allow such programs be analysed without a need of writing analysis harnesses that would first initialise the structures being handled. The approach builds on a special flavour of separation logic and the approach of bi-abduction. The code of interest is analyzed along the call tree, starting from its leaves, with each function analysed just once without any call context, leading to a set of contracts summarizing the behaviour of the analysed functions. In order to handle the considered programs, methods of abduction existing in the literature are significantly modified and extended in the paper. The proposed approach has been implemented in a tool prototype and successfully evaluated on not large but complex programs.

Dokumenty

BibTex


@inproceedings{BUT178210,
  author="Lukáš {Holík} and Petr {Peringer} and Adam {Rogalewicz} and Veronika {Šoková} and Tomáš {Vojnar} and Florian {Zuleger}",
  title="Low-Level Bi-Abduction",
  annote="The paper proposes a new static analysis designed to handle open programs, i.e.,
fragments of programs, with dynamic pointer-linked data structures in particular,
various kinds of lists that employ advanced low-level pointer operations. The
goal is to allow such programs be analysed without a need of writing analysis
harnesses that would first initialise the structures being handled. The approach
builds on a special flavour of separation logic and the approach of bi-abduction.
The code of interest is analyzed along the call tree, starting from its leaves,
with each function analysed just once without any call context, leading to a set
of contracts summarizing the behaviour of the analysed functions. In order to
handle the considered programs, methods of abduction existing in the literature
are significantly modified and extended in the paper. The proposed approach has
been implemented in a tool prototype and successfully evaluated on not large but
complex programs.",
  address="Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik",
  booktitle="36th European Conference on Object-Oriented Programming (ECOOP 2022)",
  chapter="178210",
  doi="10.4230/LIPIcs.ECOOP.2022.19",
  edition="Leibniz International Proceedings in Informatics",
  howpublished="online",
  institution="Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik",
  number="222",
  year="2022",
  month="june",
  pages="1--30",
  publisher="Schloss Dagstuhl--Leibniz-Zentrum fuer Informatik",
  type="conference paper"
}