A randomized satisfiability procedure for arithmetic and uninterpreted function symbols

Authors:
Sumit Gulwani;George C. Necula
Affiliations:
Department of Computer Science, UC-Berkeley, Berkeley, CA 94720, USA;Department of Computer Science, UC-Berkeley, Berkeley, CA 94720, USA
Venue:
Information and Computation - Special issue: 19th international conference on automated deduction (CADE-19)
Year:
2005

Citing 8
Cited 0

Randomized algorithms

Randomized algorithms
Proof-carrying code

Proceedings of the 24th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Deciding Combinations of Theories

Journal of the ACM (JACM)
Simplification by Cooperating Decision Procedures

ACM Transactions on Programming Languages and Systems (TOPLAS)
Discovering affine equalities using random interpretation

POPL '03 Proceedings of the 30th ACM SIGPLAN-SIGACT symposium on Principles of programming languages
Validity Checking for Combinations of Theories with Equality

FMCAD '96 Proceedings of the First International Conference on Formal Methods in Computer-Aided Design
Deconstructing Shostak

LICS '01 Proceedings of the 16th Annual IEEE Symposium on Logic in Computer Science
Checking validities and proofs with cvc and flea

Checking validities and proofs with cvc and flea

Quantified Score

Hi-index	0.00

Visualization

Abstract

We present a new randomized algorithm for checking the satisfiability of a conjunction of literals in the combined theory of linear equalities and uninterpreted functions. The key idea of the algorithm is to process the literals incrementally and to maintain at all times a set of random variable assignments that satisfy the literals seen so far. We prove that this algorithm is complete (i.e., it identifies all unsatisfiable conjunctions) and is probabilistically sound (i.e., the probability that it fails to identify satisfiable conjunctions is very small). The algorithm has the ability to retract assumptions incrementally with almost no additional space overhead. The algorithm can also be easily adapted to produce proofs for its output. The key advantage of the algorithm is its simplicity. We also show experimentally that the randomized algorithm has performance competitive with the existing deterministic symbolic algorithms.