The following pages link to Cesare Tinelli (Q429585):
Displaying 14 items.
- Model evolution with equality -- revised and implemented (Q429586) (← links)
- An efficient SMT solver for string constraints (Q518402) (← links)
- Combining nonstably infinite theories (Q851136) (← links)
- Computing finite models by reduction to function-free clause logic (Q1006733) (← links)
- Solving quantified verification conditions using satisfiability modulo theories (Q1037401) (← links)
- Deciding the word problem in the union of equational theories. (Q1400706) (← links)
- Designing theory solvers with extensions (Q1687536) (← links)
- Counterexample-guided quantifier instantiation for synthesis in SMT (Q1702893) (← links)
- Datatypes with shared selectors (Q1799121) (← links)
- Cooperation of background reasoners in theory reasoning by residue sharing (Q1810855) (← links)
- Unions of non-disjoint theories and combinations of satisfiability procedures (Q1853591) (← links)
- Reasoning about vectors: satisfiability modulo a theory of sequences (Q6053845) (← links)
- Combining stable infiniteness and (strong) politeness (Q6053847) (← links)
- Synthesising programs with non-trivial constants (Q6161231) (← links)
