E-matching for fun and profit
From MaRDI portal
Publication:2864401
Recommendations
Cites work
- scientific article; zbMATH DE number 3413831 (Why is no real title available?)
- Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006)
- Efficient E-Matching for SMT Solvers
- Simplify: a theorem prover for program checking
- Term Rewriting and Applications
- Term indexing
- Zap: Automated Theorem Proving for Software Analysis
Cited in
(10)- Efficient E-Matching for SMT Solvers
- Profit-maximizing matchmaker
- Verifying visibility-based weak consistency
- Symbolic encoding of LL(1) parsing and its applications
- A heuristic prover for real inequalities
- Solving quantified verification conditions using satisfiability modulo theories
- E-matching with free variables
- Solving hard Mizar problems with instantiation and strategy invention
- Satisfiability solving and model generation for quantified first-order logic formulas
- Engineering DPLL(T) + Saturation
This page was built for publication: E-matching for fun and profit
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2864401)