A randomized satisfiability procedure for arithmetic and uninterpreted function symbols

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

Volumn 2741, Issue , 2003, Pages 167-181

  Gulwani, Sumit ^a   Necula, George C ^a  

^a UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

FORMAL LOGIC; THEOREM PROVING; ALGORITHMS; CODES (SYMBOLS); COMPETITION; PROBABILITY; RANDOM PROCESSES;

LINEAR EQUALITY; RANDOMIZED ALGORITHMS; SATISFIABILITY; SATISFIABILITY PROCEDURE; SYMBOLIC ALGORITHMS; UNINTERPRETED FUNCTION SYMBOLS; UNINTERPRETED FUNCTIONS; VARIABLE ASSIGNMENT; RANDOMIZATION;

AUTOMATION; DIGITAL ARITHMETIC;

EID: 7044221796     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-45085-6_14     Document Type: Conference Paper

References (9)

1. W. Ackermann. Solvable Cases of the Decision Problem. Studies in Logic and the Foundations of Mathematics. North-Holland, Amsterdam, 1954
2. L. Bachmair and A. Tiwari. Abstract congruence closure and specializations. In D. McAllester, editor, Conference on Automated Deduction, CADE ’2000, volume 1831 of Lecture Notes in Artificial Intelligence, pages 64–78, Pittsburgh, PA, June 2000. Springer-Verlag
3. J.-C. Filliâtre, S. Owre, H. Rueß, and N. Shankar. ICS: Integrated Canonization and Solving. In G. Berry, H. Comon, and A. Finkel, editors, Computer-Aided Verification, CAV ’2001, volume 2102 of Lecture Notes in Computer Science, pages 246–249, Paris, France, July 2001. Springer-Verlag
4. S. Gulwani and G. C. Necula. Discovering affine equalities using random interpretation. In The 30th Annual ACM Symposium on Principles of Programming Languages, pages 74–84. ACM, Jan. 2003
5. S. Gulwani and G. C. Necula. A randomized satisfiability procedure for arithmetic and uninterpreted function symbols. Technical Report UCB-CS-03-1241, University of California, Berkeley, 2003
6. R. Motwani and P. Raghavan. Randomized Algorithms. Cambridge University Press, 1995
7. G. Nelson and D. Oppen. Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems, 1(2):245–257, Oct. 1979
8. H. Ruess and N. Shankar. Deconstructing Shostak. In 16th Annual IEEE Symposium on Logic in Computer Science (LICS ’01), pages 19–28, Washington-Brussels-Tokyo, June 2001. IEEE
9. R. E. Shostak. Deciding combinations of theories. Journal of the ACM, 31(1):1–12, Jan. 1984.