E-matching for Fun and Profit

Electronic Notes in Theoretical Computer Science

Volumn 198, Issue 2, 2008, Pages 19-35

  Moskal, Michał ^a   Łopuszański, Jakub ^a   Kiniry, Joseph R ^b  

^a UNIVERSITY OF WROC AW   (Poland)

^b UNIVERSITY COLLEGE DUBLIN   (Ireland)

Author keywords

E matching; quantifier instantiation; SMT

Indexed keywords

ALGORITHMS; COMPUTER SOFTWARE; PROBLEM SOLVING;

E-MATCHING; QUANTIFIER INSTANTIATION; SATISFIABILITY MODULO THEORIES;

DATA HANDLING;

EID: 43749094726     PISSN: 15710661     EISSN: None     Source Type: Journal    
DOI: 10.1016/j.entcs.2008.04.078     Document Type: Article

References (17)

1. Ball T., Lahiri S.K., and Musuvathi M. Zap: Automated theorem proving for software analysis. In: Sutcliffe G., and Voronkov A. (Eds). LPAR. Lecture Notes in Computer Science 3835 (2005) 2-22
2. Barnett M., Leino K., and Schulte W. The Spec# programming system: An overview. Proceeding of CASSIS 2004. LNCS 3362 (2004)
3. Barrett, C., L. de Moura and A. Stump, Design and Results of the 3rd Satisfiability Modulo Theories Competition (SMT-COMP 2007) (2007), to appear, also http://www.smtcomp.org/2007/
4. Barrett C., and Tinelli C. CVC3. In: Damm W., and Hermanns H. (Eds). CAV. LNCS 4590 (2007) 298-302
5. Conchon, S., E. Contejean, J. Kanig and S. Lescuyer, Lightweight Integration of the Ergo Theorem Prover inside a Proof Assistant, in: Second Automated Formal Methods workshop series (AFM07), Atlanta, Georgia, USA, 2007
6. de Moura L.M., and Bjørner N. Efficient E-matching for SMT solvers. In: Pfenning F. (Ed). CADE. LNCS 4603 (2007) 183-198
7. Detlefs, D., G. Nelson and J.B. Saxe, Simplify: A theorem prover for program checking, Technical Report HPL-2003-148, HP Labs (2003)
8. Dutertre B., and de Moura L.M. A fast linear-arithmetic solver for DPLL(T). In: Ball T., and Jones R.B. (Eds). CAV. LNCS 4144 (2006) 81-94
9. Flanagan, C., R. Joshi and J.B. Saxe, An explicating theorem prover for quantified formulas, Technical Report 199, HP Labs (2004)
10. Flanagan, C., K. Leino, M. Lillibridge, G. Nelson, J.B. Saxe and R. Stata, Extended static checking for Java, in: ACM SIGPLAN 2002 Conference on Programming Language Design and Implementation (PLDI'2002), 2002, pp. 234-245
11. Kiniry J.R., and Cok D.R. ESC/Java2: Uniting ESC/Java and JML: Progress and issues in building and using ESC/Java2 and a report on a case study involving the use of ESC/Java2 to verify portions of an Internet voting tally system. Construction and Analysis of Safe, Secure and Interoperable Smart Devices: International Workshop. CASSIS 2004. LNCS 3362 (2005)
12. th Symposium on Theory of Computing, 1977, pp. 164-177
13. Moskal M., Skalski K., Olszta P., et al. Nemerle programming language. http://nemerle.org/
14. Nieuwenhuis R., and Oliveras A. Proof-Producing Congruence Closure. In: Giesl J. (Ed). 16th International Conference on Term Rewriting and Applications, RTA'05. Lecture Notes in Computer Science 3467 (2005) 453-468
15. Plotkin G.D. Building-in equational theories. In: Michie D., and Meltzer B. (Eds). Machine Intelligence (1972) 73-90
16. Ramakrishnan I.V., Sekar R.C., and Voronkov A. Term indexing. In: Robinson J.A., and Voronkov A. (Eds). Handbook of Automated Reasoning (2001), Elsevier and MIT Press 1853-1964
17. Ranise S., and Tinelli C. The Satisfiability Modulo Theories Library (SMT-LIB) (2007). http://www.smt-lib.org