The following pages link to StarExec (Q20838):
Displaying 50 items.
- The 2013 evaluation of SMT-COMP and SMT-LIB (Q286784) (← links)
- SAT race 2015 (Q334795) (← links)
- An efficient SMT solver for string constraints (Q518402) (← links)
- Machine learning-based restart policy for CDCL SAT solvers (Q1656568) (← links)
- An empirical study of branching heuristics through the lens of global learning rate (Q1680251) (← links)
- Incremental bounded model checking for embedded software (Q1682291) (← links)
- Deciding local theory extensions via E-matching (Q1702888) (← links)
- Counterexample-guided quantifier instantiation for synthesis in SMT (Q1702893) (← links)
- Superposition for \(\lambda\)-free higher-order logic (Q1799065) (← links)
- A FOOLish encoding of the next state relations of imperative programs (Q1799102) (← links)
- Datatypes with shared selectors (Q1799121) (← links)
- On solving quantified bit-vector constraints using invertibility conditions (Q2050109) (← links)
- Multi-dimensional interpretations for termination of term rewriting (Q2055861) (← links)
- Superposition with first-class booleans and inprocessing clausification (Q2055873) (← links)
- SAT competition 2020 (Q2060693) (← links)
- A combinator-based superposition calculus for higher-order logic (Q2096452) (← links)
- Subsumption demodulation in first-order theorem proving (Q2096454) (← links)
- Layered clause selection for theory reasoning (short paper) (Q2096461) (← links)
- Term orderings for non-reachability of (conditional) rewriting (Q2104512) (← links)
- Proving non-termination and lower runtime bounds with \textsf{LoAT} (system description) (Q2104557) (← links)
- Symmetry avoidance in MACE-style finite model finding (Q2180212) (← links)
- Induction with generalization in superposition reasoning (Q2219385) (← links)
- Automated reasoning. 7th international joint conference, IJCAR 2014, held as part of the Vienna summer of logic, VSL 2014, Vienna, Austria, July 19--22, 2014. Proceedings (Q2250555) (← links)
- Refutation-based synthesis in SMT (Q2280222) (← links)
- Restricted combinatory unification (Q2305407) (← links)
- Old or heavy? Decaying gracefully with age/weight shapes (Q2305433) (← links)
- Induction in saturation-based proof search (Q2305434) (← links)
- Faster, higher, stronger: E 2.3 (Q2305435) (← links)
- The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17) (Q2321317) (← links)
- A decision procedure for (co)datatypes in SMT solvers (Q2360873) (← links)
- Splitting proofs for interpolation (Q2405256) (← links)
- Scavenger 0.1: a theorem prover based on conflict resolution (Q2405260) (← links)
- Certifying confluence of quasi-decreasing strongly deterministic conditional term rewrite systems (Q2405266) (← links)
- Polyhedral Approximation of Multivariate Polynomials Using Handelman’s Theorem (Q2796046) (← links)
- Selecting the Selection (Q2817931) (← links)
- Performance of Clause Selection Heuristics for Saturation-Based Theorem Proving (Q2817933) (← links)
- Learning Rate Based Branching Heuristic for SAT Solvers (Q2818006) (← links)
- Synthesis of Domain Specific CNF Encoders for Bit-Vector Solvers (Q2818024) (← links)
- Finding Finite Models in Multi-sorted First-Order Logic (Q2818025) (← links)
- Proving Termination Through Conditional Termination (Q3303892) (← links)
- Scaling Enumerative Program Synthesis via Divide and Conquer (Q3303902) (← links)
- Confluence Competition 2015 (Q3454083) (← links)
- A Decision Procedure for (Co)datatypes in SMT Solvers (Q3454092) (← links)
- Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers (Q4972164) (← links)
- (Q4989394) (← links)
- (Q4993364) (← links)
- Open-WBO-Inc: Approximation Strategies for Incomplete Weighted MaxSAT (Q5015607) (← links)
- The 10th IJCAR automated theorem proving system competition – CASC-J10 (Q5019796) (← links)
- (Q5020662) (← links)
- Learning Optimal Decision Sets and Lists with SAT (Q5026234) (← links)
