Volume 2404 of the series Lecture Notes in Computer Science pp 209222
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
Abstract
We show a reduction to propositional logic from a Boolean combination of inequalities of the form v _{i} ≥ v _{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.
 Title
 Deciding Separation Formulas with SAT
 Book Title
 Computer Aided Verification
 Book Subtitle
 14th International Conference, CAV 2002 Copenhagen, Denmark, July 27–31, 2002 Proceedings
 Pages
 pp 209222
 Copyright
 2002
 DOI
 10.1007/3540456570_16
 Print ISBN
 9783540439974
 Online ISBN
 9783540456575
 Series Title
 Lecture Notes in Computer Science
 Series Volume
 2404
 Series ISSN
 03029743
 Publisher
 Springer Berlin Heidelberg
 Copyright Holder
 SpringerVerlag Berlin Heidelberg
 Additional Links
 Topics
 Industry Sectors
 Editors

 Ed Brinksma ^{(4)}
 Kim Guldstrand Larsen ^{(5)}
 Editor Affiliations

 4. Department of Computer Science, University of Twente
 5. Department of Computer Science, Aalborg University
 Authors

 Ofer Strichman ^{(6)}
 Sanjit A. Seshia ^{(6)}
 Randal E. Bryant ^{(6)}
 Author Affiliations

 6. Computer Science, Carnegie Mellon University, Pittsburgh, PA
Continue reading...
To view the rest of this content please follow the download PDF link above.