Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

93

Voted

CADE
2007
Springer

100views Logical Reasoning» more CADE 2007»

Efficient E-Matching for SMT Solvers

16 years 3 months ago

Efficient E-Matching for SMT Solvers

Download research.microsoft.com

Leonardo Mendonça de Moura, Nikolaj Bj&osla

Real-time Traffic

Automated Reasoning | CADE 2007 | Efficient E-Matching |

claim paper

Related Content

» Dont care in SMT building flexible yet efficient abstractionrefinement solvers

» Engineering DPLLT Saturation

» On Using FloatingPoint Computations to Help an Exact Linear Arithmetic Decision Procedure

» Ground Interpolation for Combined Theories

» Beaver Engineering an Efficient SMT Solver for BitVector Arithmetic

» Satisfiability Modulo the Theory of Costs Foundations and Applications

» Filtering false alarms of buffer overflow analysis using SMT solvers

» veriT An Open Trustable and Efficient SMTSolver

» PhraseBased Statistical Machine Translation as a Traveling Salesman Problem

Post Info
More Details (n/a)

Added	03 Dec 2009
Updated	03 Dec 2009
Type	Conference
Year	2007
Where	CADE
Authors	Leonardo Mendonça de Moura, Nikolaj Bjørner

Comments (0)