Program Verification as Satisfiability Modulo Theories

@inproceedings{Bjrner2012ProgramVA,
  title={Program Verification as Satisfiability Modulo Theories},
  author={Nikolaj Bj\orner and Kenneth L. McMillan and Andrey Rybalchenko},
  booktitle={SMT@IJCAR},
  year={2012}
}
A key driver of SMT over the past decade has been an interchange format, SMT-LIB, and a growing set of benchmarks sharing this common format. SMT-LIB captures very well an interface that is suitable for many tasks that reduce to solving first-order formulas modulo theories. Here we propose to extend these benefits into the domain of symbolic software model checking. We make a case that SMT-LIB can be used, and to a limited extent adapted, for exchanging symbolic software model checking… CONTINUE READING
Highly Cited
This paper has 88 citations. REVIEW CITATIONS

Citations

Publications citing this paper.

89 Citations

0102030'14'16'18
Citations per Year
Semantic Scholar estimates that this publication has 89 citations based on the available data.

See our FAQ for additional information.

Similar Papers

Loading similar papers…