Taking satisfiability to the next level with z3

  • Authors:
  • Nikolaj Bjørner

  • Affiliations:
  • Microsoft Research

  • Venue:
  • IJCAR'12 Proceedings of the 6th international joint conference on Automated Reasoning
  • Year:
  • 2012

Quantified Score

Hi-index 0.00

Visualization

Abstract

Several applications from program analysis, design and testing rely critically on solving SMT problems. Many applications build on top of SMT solvers in sophisticated ways by carefully crafting the solver interaction. We illustrate partial correctness checking as an SMT problem and we introduce a procedure for model finding of recursive Horn clauses with arithmetic.