Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic

Viktor Kuncak, Martin C. Rinard. Towards Efficient Satisfiability Checking for Boolean Algebra with Presburger Arithmetic. In Frank Pfenning, editor, Automated Deduction - CADE-21, 21st International Conference on Automated Deduction, Bremen, Germany, July 17-20, 2007, Proceedings. Volume 4603 of Lecture Notes in Computer Science, pages 215-230, Springer, 2007. [doi]

References

No references recorded for this publication.

Cited by

No citations of this publication recorded.