Proceedings of ISP RAS


Predicate Abstractions Memory Modeling Method with Separation into Disjoint Regions

A. Volkov (MSU, Moscow, Russia)
M. Mandrykin (ISP RAS, Moscow, Russia)

Abstract

Software verification is a type of activity focused on software quality control and detection of errors in software. Static verification is verification without the execution of software source code. Special software – tools for static verification – often work with program's source code. One of the tools that can be used for static verification is a tool called CPAchecker. The problem of the current memory model used by the tool is that if a function returning a pointer to program's memory lacks a body, arbitrary assumptions can be made about this function return value in the process of verification. Although possible, the assumptions are often also practically very improbable. Their usage may lead to a false alarm. In this paper we give an overview of the approach capable of resolving this issue and its formal specification in terms of path formulas based on the uninterpreted functions used by the tool for memory modeling. We also present results of benchmarking the corresponding implementation against existing memory model.

Keywords

memory model; predicate abstractions; static verification

Edition

Proceedings of the Institute for System Programming, vol. 29, issue 4, 2017, pp. 203-216

ISSN 2220-6426 (Online), ISSN 2079-8156 (Print).

DOI: 10.15514/ISPRAS-2017-29(4)-13

Full text of the paper in pdf Back to the contents of the volume