International Conference on Computer Aided Verification

CAV 2002: Computer Aided Verification pp 209-222

Deciding Separation Formulas with SAT

  • Ofer Strichman
  • Sanjit A. Seshia
  • Randal E. Bryant
Conference paper

DOI: 10.1007/3-540-45657-0_16

Volume 2404 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Strichman O., Seshia S.A., Bryant R.E. (2002) Deciding Separation Formulas with SAT. In: Brinksma E., Larsen K.G. (eds) Computer Aided Verification. CAV 2002. Lecture Notes in Computer Science, vol 2404. Springer, Berlin, Heidelberg

Abstract

We show a reduction to propositional logic from a Boolean combination of inequalities of the form vivj + c and vi > vj + c, where c is a constant and vi, vj 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer-Verlag Berlin Heidelberg 2002

Authors and Affiliations

  • Ofer Strichman
    • 1
  • Sanjit A. Seshia
    • 1
  • Randal E. Bryant
    • 1
  1. 1.Computer ScienceCarnegie Mellon UniversityPittsburgh