Corral : A Solver for Reachability Modulo Theories Akash

@inproceedings{Lal2012CorralA,
  title={Corral : A Solver for Reachability Modulo Theories Akash},
  author={Akash Lal and Shaz Qadeer and Shuvendu K. Lahiri},
  year={2012}
}
Consider a sequential programming language with control flow constructs such as assignments, choice, loops, and procedure calls. We restrict the syntax of expressions in this language to one that can be efficiently decided by a satisfiability-modulo-theories solver. For such a language, we define the problem of deciding whether a program can reach a particular control location as the reachability-modulo-theories problem. This paper describes the architecture of Corral, a semi-algorithm for the… CONTINUE READING
Highly Cited
This paper has 41 citations. REVIEW CITATIONS