CSISAT: Interpolation for LA+EUF: Tool paper

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

Volumn 5123 LNCS, Issue , 2008, Pages 304-308

  Beyer, Dirk ^a   Zufferey, Damien ^b   Majumdar, Rupak ^c  

^a SIMON FRASER UNIVERSITY   (Canada)

^b EPFL   (Switzerland)

^c UNIVERSITY OF CALIFORNIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

BOOLEAN FUNCTIONS; CODES (SYMBOLS); COMPUTER AIDED ANALYSIS; DECISION THEORY; DIGITAL ARITHMETIC; INTERPOLATION; LINEAR PROGRAMMING; LINEARIZATION; VERIFICATION;

BOOLEAN STRUCTURE; COMPUTER AIDED VERIFICATION; DECISION PROCEDURES; FREE SOFTWARE; INTERNATIONAL CONFERENCES; LINEAR ARITHMETIC; SAT SOLVER; SOFTWARE VERIFICATIONS; SOURCE CODING; UNINTERPRETED FUNCTION SYMBOLS;

COMPUTER SOFTWARE SELECTION AND EVALUATION;

EID: 48949106358     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-70545-1_29     Document Type: Conference Paper

References (10)

1. Biere, A.: PicoSAT essentials. JSAT (submitted, 2008)
2. Bozzano, M., Bruttomesso, R., Cimatti, A., Junttila, T.A., Ranise, S., Rossum, P.v., Sebastiani, R.: Efficient satisfiability modulo theories via delayed theory combination. In: Etessami, K., Rajamani, S.K. (eds.) CAV 2005. LNCS, vol. 3576, pp. 335-349. Springer, Heidelberg (2005)
3. Cimatti, A., Griggio, A., Sebastiani, R.: Efficient interpolant generation in satisfiability modulo theories. In: Ramakrishnan, C.R., Rehof, J. (eds.) TACAS 2008. LNCS, vol. 4963, pp. 397-412. Springer, Heidelberg (2008)
4. Craig, W.: Linear reasoning. A new form of the Herbrand-Gentzen theorem. J. Symb. Log. 22(3), 250-268 (1957)
5. Holzbaur, C.: OFAI clp(q,r) Manual, Edition 1.3.3. Austrian Research Institute for Artificial Intelligence, Vienna, TR-95-09 (1995)
6. McMillan, K.L.: An interpolating theorem prover. Theor. Comput. Sci. 345(1), 101-121 (2005)
7. Nelson, G., Oppen, D.C.: Fast decision procedures based on congruence closure. J. ACM 27(2), 356-364 (1980)
8. Nieuwenhuis, R., Oliveras, A., Tinelli, C.: Solving SAT and SAT modulo theories: From an abstract Davis-Putnam-Logemann-Loveland procedure to DPLL(T). J. ACM 53(6), 937-977 (2006)
9. Rybalchenko, A., Sofronie-Stokkermans, V.: Constraint Solving for Interpolation. In: Cook, B., Podelski, A. (eds.) VMCAI 2007. LNCS, vol. 4349, pp. 346-362. Springer, Heidelberg (2007)
10. Yorsh, G., Musuvathi, M.: A combination method for generating interpolants. In: Nieuwenhuis, R. (ed.) CADE 2005. LNCS (LNAI), vol. 3632, pp. 353-368. Springer, Heidelberg (2005)