Deciding separation formulas with SAT

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 2404, Issue , 2002, Pages 209-222

  Strichman, Ofer ^a   Seshia, Sanjit A ^a   Bryant, Randal E ^a  

^a Carnegie Mellon University   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; COMPUTER AIDED ANALYSIS;

BOOLEAN COMBINATIONS; PROPOSITIONAL LOGIC; UNINTERPRETED FUNCTIONS;

COMPUTER CIRCUITS;

EID: 84937568788     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/3-540-45657-0_16     Document Type: Conference Paper

References (13)

1. W. Ackermann. Solvable cases of the Decision Problem. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1954.
2. B. Barras, S. Boutin, C. Cornes, J. Courant, J. C. Filliatre, E. Giménez, H. Herbelin, G. Huet, C. Mu noz, C. Murthy, C. Parent, C. Paulin, A. Säıbi, and B. Werner. The Coq Proof Assistant Reference Manual-Version V6.1. Technical Report RT-0203, INRIA, August 1997. revised version distributed with Coq.
3. A. J. C. Bik and H. A. G. Wijshoff. Implementation of Fourier-Motzkin elimination. Technical Report 94-42, Dept. of Computer Science, Leiden University, 1994.
4. R. Bryant, S. German, and M. Velev. Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logic. ACM Transactions on Computational Logic, 2(1):1-41, 2001.
5. R. E. Bryant, S. K. Lahiri, and S. A. Seshia. Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In Proc. Computer-Aided Verification (CAV’02), July 2002. This volume.
6. T. Cormen, C. Leiserson, and L. Rivest. Introduction to Algorithms. MIT press.
7. J. Møller, J. Lichtenberg, H. R. Andersen, and H. Hulgaard. Difference decision diagrams. In Proceedings 13th International Conference on Computer Science Logic, volume 1683 of LNCS, pages 111-125, 1999.
8. M. Moskewicz, C. Madigan, Y. Zhao, L. Zhang, and S. Malik. Chaff: Engineering an efficient SAT solver. In Proc. Design Automation Conference (DAC’01), 2001.
9. V. Pratt. Two easy theories whose combination is hard. Technical report, Massachusetts Institute os Technology, 1977. Cambridge, Mass.
10. R. Shostak. Deciding linear inequalities by computing loop residues. J. ACM, 28(4):769-779, October 1981.
11. R. Shostak. Deciding combinations of theories. J. ACM, 31(1):1-12, 1984.
12. O. Strichman. Optimizations in decision procedures for propositional linear inequalities. Technical Report CMU-CS-02-133, Carnegie Mellon University, 2002. 216
13. O. Strichman, S. A. Seshia, and R. E. Bryant. Reducing separation formulas to propositional logic