Reachability Modulo Theories

  • Akash Lal
  • Shaz Qadeer
Conference paper

DOI: 10.1007/978-3-642-41036-9_4

Part of the Lecture Notes in Computer Science book series (LNCS, volume 8169)
Cite this paper as:
Lal A., Qadeer S. (2013) Reachability Modulo Theories. In: Abdulla P.A., Potapov I. (eds) Reachability Problems. RP 2013. Lecture Notes in Computer Science, vol 8169. Springer, Berlin, Heidelberg

Abstract

Program verifiers that attempt to verify programs automatically pose the verification problem as the decision problem: Does there exist a proof that establishes the absence of errors? In this paper, we argue that program verification should instead be posed as the following decision problem: Does there exist an execution that establishes the presence of an error? We formalize the latter problem as Reachability Modulo Theories (RMT) using an imperative programming language parameterized by a multi-sorted first-order signature. We present complexity results, algorithms, and the Corral solver for the RMT problem. We present our experience using Corral on problems from a variety of application domains.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2013

Authors and Affiliations

  • Akash Lal
    • 1
  • Shaz Qadeer
    • 1
  1. 1.Microsoft ResearchUSA

Personalised recommendations