Fast approximations of quantifier elimination

DOI10.1007/978-3-031-37703-7_4zbMath1545.68136MaRDI QIDQ6535528

V. K. Hari Govind, Isabel García-Contreras, Arie Gurfinkel, Sharon Shoham

Publication date: 12 January 2024

Mathematics Subject Classification ID

Mechanization of proofs and logical operations (03B35) Quantifier elimination, model completeness, and related topics (03C10) Theorem proving (automated and interactive theorem provers, deduction, resolution, etc.) (68V15)

Cites Work

• SMT-based model checking for recursive programs
• An Abstract Domain of Uninterpreted Functions
• Equality Saturation: A New Approach to Optimization
• Satisfiability Modulo Theories
• Simplify: a theorem prover for program checking
• Simplification by Cooperating Decision Procedures
• Equality saturation
• FSTTCS 2004: Foundations of Software Technology and Theoretical Computer Science
• Verification, Model Checking, and Abstract Interpretation

This page was built for publication: Fast approximations of quantifier elimination