An experimental evaluation of ground decision procedures

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

Volumn 3114, Issue , 2004, Pages 162-174

  De Moura, Leonardo ^a   Rueß, Harald ^a  

^a SRI INTERNATIONAL   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER AIDED ANALYSIS;

BENCHMARK SUITES; EXPERIMENTAL EVALUATION; GROUND DECISION PROCEDURES; RELATIVE STRENGTH;

BENCHMARKING;

EID: 35048865999     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-27813-9_13     Document Type: Review

References (23)

1. Bryant, R.E.: Graph-based algorithms for boolean function manipulation. IEEE Transactions in Computers 8 (1986) 677-691
2. Davis, M., Putnam, H.: A computing procedure for quantification theory. Journal of the ACM 7 (1960) 201-215
3. Detlefs, D., Nelson, G., Saxe, J.B.: Simplify: A theorem prover for program checking. Technical Report HPL-2003-148, HP Labs (2003)
4. Stump, A., Barrett, C.W., Dill, D.L.: CVC: a cooperating validity checker. In: Proc. of CAV'02. Volume 2404 of LNCS. (2002)
5. Filliâtre, J.C., Owre, S., Rueß, H., Shankar, N.: ICS: Integrated Canonization and Solving. In: Proc. of CAV'01. Volume 2102 of LNCS. (2001)
6. Bryant, R.E., Lahiri, S.K., Seshia, S.A.: Modeling and verifying systems using a logic of counter arithmetic with lambda expressions and uninterpreted functions. In: Proc. of CAV'02. Volume 2404 of LNCS. (2002)
7. Audemard, G., Bertoli, P., Cimatti, A., Kornilowicz, A., Sebastiani, R.: A SAT based approach for solving formulas over boolean and linear mathematical propositions. In: Proc. of CADE'02. (2002)
8. Barrett, C., Dill, D., Levitt, J.: Validity checking for combinations of theories with equality. LNCS 1166 (1996) 187-201
9. Downey, P.J., Sethi, R., Tarjan, R.E.: Variations on the common subexpressions problem. Journal of the ACM 27 (1980) 758-771
10. Nelson, G., Oppen, D.C.: Simplification by cooperating decision procedures. ACM Transactions on Programming Languages and Systems 1 (1979) 245-257
11. Shostak, R.E.: Deciding combinations of theories. Journal of the ACM 31 (1984) 1-12
12. Shankar, N., Rueß, H.: Combining Shostak theories. In: Proc. of RTA'02. Volume 2378 of LNCS. (2002)
13. de Moura, L., Rueß, H., Sorea, M.: Lazy theorem proving for bounded model checking over infinite domains. In: Proc. of CADE'02. Volume 2392 of LNCS. (2002)
14. Ackermann, W.: Solvable cases of the decision problem. Studies in Logic and the Foundation of Mathematics (1954)
15. Shostak, R.E.: Deciding linear inequalities by computing loop residues. Journal of the ACM 28 (1981) 769-779
16. Goel, A., Sajid, K., Zhou, H., Aziz, A.: BDD based procedures for a theory of equality with uninterpreted functions. LNCS 1427 (1998) 244-255
17. Pnueli, A., Rodeh, Y., Shtrichman, O., Siegel, M.: Deciding equality formulas by small domains instantiations. LNCS 1633 (1999) 455-469
18. Bryant, R.E., German, S., Velev, M.N.: Exploiting positive equality in a logic of equality with uninterpreted functions. LNCS 1633 (1999) 470-482
19. Strichman, O., Seshia, S.A., Bryant, R.E.: Reducing linear inequalities to prepositional formulas. In: Proc. of CAV'02. Volume 2404 of LNCS. (2002)
20. Barrett, C. W., Dill, D.L., Stump, A.: Checking satisfiability of first-order formulas by incremental translation to SAT. In: Proc. of CAV'02. Volume 2404 of LNCS. (2002)
21. Joshi, R., Ou, X., Saxe, J.B., Flanagan, C.: Theorem proving using lazy proof explication. In: Proc. of CAV'03. Volume 2725 of LNCS. (2003)
22. de Moura, L., Rueß, H., Shankar, N.: Justifying Equality. Submitted for publication, http://www.csl.sri.com/users/ruess/papers/PDPAR04/index.html (2004)
23. Ranise, S., Tinelli, C.: The smt-lib format: An initial proposal. In: Proceedings of the 1st International Workshop on Pragmatics of Decision Procedures in Automated Reasoning (PDPAR'03), Miami, Florida. (2003) 94-111