The following pages link to Leonardo de Moura (Q438532):
Displaying 35 items.
- On deciding satisfiability by theorem proving with speculative inferences (Q438533) (← links)
- Design and results of the first satisfiability modulo theories competition (SMT-COMP 2005) (Q861691) (← links)
- Deciding effectively propositional logic using DPLL and substitution sets (Q972432) (← links)
- The Lean 4 theorem prover and programming language (Q2055901) (← links)
- Cutting to the chase. (Q2351157) (← links)
- Efficiently solving quantified bit-vector formulas (Q2441770) (← links)
- Design and results of the 2nd annual satisfiability modulo theories competition (SMT-COMP 2006) (Q2461559) (← links)
- Congruence Closure in Intensional Type Theory (Q2817913) (← links)
- (Q2848059) (← links)
- Model-based Theory Combination (Q2864402) (← links)
- Real Algebraic Strategies for MetiTarski Proofs (Q2907335) (← links)
- Solving Non-linear Arithmetic (Q2908506) (← links)
- A Model-Constructing Satisfiability Calculus (Q2926635) (← links)
- The Lean Theorem Prover (System Description) (Q3454108) (← links)
- Deciding Effectively Propositional Logic Using DPLL and Substitution Sets (Q3541720) (← links)
- Engineering DPLL(T) + Saturation (Q3541724) (← links)
- Efficient E-Matching for SMT Solvers (Q3608773) (← links)
- Complete Instantiation for Quantified Formulas in Satisfiabiliby Modulo Theories (Q3636870) (← links)
- Satisfiability Modulo Theories: An Appetizer (Q3651277) (← links)
- (Q4809077) (← links)
- The Strategy Challenge in SMT Solving (Q4913859) (← links)
- Computation in Real Closed Infinitesimal and Transcendental Extensions of the Rationals (Q4928437) (← links)
- Symbolic Automata Constraint Solving (Q4933337) (← links)
- Beyond Notations: Hygienic Macro Expansion for Theorem Proving Languages (Q5049000) (← links)
- (Q5094129) (← links)
- On Deciding Satisfiability by DPLL( $\Gamma+{\mathcal T}$ ) and Unsound Theorem Proving (Q5191095) (← links)
- Cutting to the Chase Solving Linear Integer Arithmetic (Q5200035) (← links)
- (Q5219923) (← links)
- Automated Reasoning (Q5307060) (← links)
- Computer Aided Verification (Q5312896) (← links)
- Computer Aided Verification (Q5312938) (← links)
- A Tutorial on Satisfiability Modulo Theories (Q5429314) (← links)
- Computer Aided Verification (Q5716582) (← links)
- Bugs, Moles and Skeletons: Symbolic Reasoning for Software Development (Q5747779) (← links)
- Computer Aided Verification (Q5900667) (← links)
