Deciding Separation Formulas with SAT
- 20 September 2002
- book chapter
- Published by Springer Nature
- p. 209-222
- https://doi.org/10.1007/3-540-45657-0_16
Abstract
No abstract availableKeywords
This publication has 8 references indexed in Scilit:
- Reducing Separation Formulas to Propositional LogicPublished by Defense Technical Information Center (DTIC) ,2003
- Modeling and Verifying Systems Using a Logic of Counter Arithmetic with Lambda Expressions and Uninterpreted FunctionsPublished by Springer Nature ,2002
- Optimizations in Decision Procedures for Propositional Linear InequalitiesPublished by Defense Technical Information Center (DTIC) ,2002
- ChaffPublished by Association for Computing Machinery (ACM) ,2001
- Processor verification using efficient reductions of the logic of uninterpreted functions to propositional logicACM Transactions on Computational Logic, 2001
- Difference Decision DiagramsPublished by Springer Nature ,1999
- Deciding Combinations of TheoriesJournal of the ACM, 1984
- Deciding Linear Inequalities by Computing Loop ResiduesJournal of the ACM, 1981