Efficient E-Matching for SMT Solvers
Top Cited Papers
- 1 January 2007
- book chapter
- conference paper
- Published by Springer Science and Business Media LLC in Lecture Notes in Computer Science
Abstract
No abstract availableKeywords
This publication has 18 references indexed in Scilit:
- A Fast Linear-Arithmetic Solver for DPLL(T)Lecture Notes in Computer Science, 2006
- Simplify: a theorem prover for program checkingJournal of the ACM, 2005
- Zap: Automated Theorem Proving for Software AnalysisLecture Notes in Computer Science, 2005
- The Spec# Programming System: An OverviewLecture Notes in Computer Science, 2005
- DPLL(T): Fast Decision ProceduresLecture Notes in Computer Science, 2004
- Extended static checking for JavaPublished by Association for Computing Machinery (ACM) ,2002
- Using Decision Procedures to Accelerate Domain-Specific Deductive Synthesis SystemsLecture Notes in Computer Science, 1999
- Automated deduction by theory resolutionJournal of Automated Reasoning, 1985
- Complexity of finitely presented algebrasPublished by Association for Computing Machinery (ACM) ,1977
- Automatic Theorem Proving with Built-in Theories Including Equality, Partial Ordering, and SetsJournal of the ACM, 1972