Acceleration-based safety decision procedure for programs with arrays

8 pages•Published: July 28, 2014

Francesco Alberti, Silvio Ghilardi and Natasha Sharygina

Abstract

Reachability analysis of programs with arrays is a well-known challenging problem and many existing approaches are bound to incomplete solutions.
In this paper we identify a class of programs with arrays for which safety is fully decidable.
The completeness result we provide is built up from acceleration techniques for arrays and the decision procedure for the Array Property Fragment class.

Keyphrases: acceleration, arrays, smt

In: Ken Mcmillan, Aart Middeldorp, Geoff Sutcliffe and Andrei Voronkov (editors). LPAR-19. 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning, vol 26, pages 1-8.

Links:	https://easychair.org/publications/paper/CvT
	https://doi.org/10.29007/xf2n

BibTeX entry

@inproceedings{LPAR-19:Acceleration_based_safety_decision,
  author    = {Francesco Alberti and Silvio Ghilardi and Natasha Sharygina},
  title     = {Acceleration-based safety decision procedure for programs with arrays},
  booktitle = {LPAR-19. 19th International Conference on Logic for Programming, Artificial Intelligence and Reasoning},
  editor    = {Ken Mcmillan and Aart Middeldorp and Geoff Sutcliffe and Andrei Voronkov},
  series    = {EPiC Series in Computing},
  volume    = {26},
  publisher = {EasyChair},
  bibsource = {EasyChair, https://easychair.org},
  issn      = {2398-7340},
  url       = {/publications/paper/CvT},
  doi       = {10.29007/xf2n},
  pages     = {1-8},
  year      = {2014}}

Download PDF Open PDF in browser