A Theory of Arrays with set and copy Operations

11 pages•Published: August 19, 2013

Stephan Falke, Carsten Sinz and Florian Merz

Abstract

The theory of arrays is widely used in order to model main memory in program analysis, software verification, bounded model checking, symbolic execution, etc. Nonetheless, the basic theory as introduced by McCarthy is not expressive enough for important practical cases since it only supports array updates at single locations. In programs, the memory is often modified using functions such as memset or memcpy/memmove, which modify a user-specified range of locations whose size might not be known statically. In this paper we present an extension of the theory of arrays with set and copy operations which make it possible to reason about such functions. We also discuss further applications of the theory.

Keyphrases: bitvectors, copy, integers, memcpy, memmove, memset, set, smt, theory of arrays

In: Pascal Fontaine and Amit Goel (editors). SMT 2012. 10th International Workshop on Satisfiability Modulo Theories, vol 20, pages 98-108.

Links:	https://easychair.org/publications/paper/9WF
	https://doi.org/10.29007/q58t

BibTeX entry

@inproceedings{SMT2012:Theory_Arrays_with_set,
  author    = {Stephan Falke and Carsten Sinz and Florian Merz},
  title     = {A Theory of Arrays with set and copy Operations},
  booktitle = {SMT 2012. 10th International Workshop on Satisfiability Modulo Theories},
  editor    = {Pascal Fontaine and Amit Goel},
  series    = {EPiC Series in Computing},
  volume    = {20},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/9WF},
  doi       = {10.29007/q58t},
  pages     = {98-108},
  year      = {2013}}

Download PDF Open PDF in browser