Chapter

Computer Aided Verification

Volume 2404 of the series Lecture Notes in Computer Science pp 209-222

Date:

Deciding Separation Formulas with SAT

  • Ofer StrichmanAffiliated withComputer Science, Carnegie Mellon University
  • , Sanjit A. SeshiaAffiliated withComputer Science, Carnegie Mellon University
  • , Randal E. BryantAffiliated withComputer Science, Carnegie Mellon University

* Final gross prices may vary according to local VAT.

Get Access

Abstract

We show a reduction to propositional logic from a Boolean combination of inequalities of the form v iv j + c and v i > v j + c, where c is a constant and v i, v j are variables of type real or integer. Equalities and uninterpreted functions can be expressed in this logic as well. We discuss the advantages of using this reduction as compared to competing methods, and present experimental results that support our claims.