Cesare Tinelli's Research
- Breaking the Satisfiability Modulo Theories (SMT) Bottleneck in Symbolic Security Analysis, PI.
NSF grant #1228765
(in collaboration with CMU, grant 1228827 and NYU, grant 1228768),
- StarExec: Cross-Community Infrastructure for Logic Solving, co-PI.
NSF grant #1058748
(in collaboration with U. Miami, grant 1058925),
Improving Counterexample Generation in Satisfiability Modulo Theories, PI.
Intel Corporation grant, 2011-12.
- Parallel Automated Reasoning, PI.
NSF EAGER grant #1049674
(in collaboration with NYU, grant 1049495), 2010-12.
- Scalable and Accurate SMT-based Model Checking of Data Flow Systems.
AFOSR grant #FA9550-09-1-0517
(in collaboration with NYU, grant #FA9550–09–1–0596),
- Flexible, Efficient, and Trustworthy Proof Checking for Satisfiability Modulo Theories, co-PI.
NSF grant #0914877
(in collaboration with NYU, grant 0914956),
- *-EXEC: A Cross-Community Solver Execution Service, co-PI.
NSF planning grant #0958160
(in collaboration with U. Miami, grant 0957438),
- 2010 Midwest Verification Day Workshop.
NSF grant #1049597,
- SMT-LIB, A Common Library and Infrastructure for
Satisfiability Modulo Theories, PI.
NSF grant # 0551646
(in collaboration with NYU, grant 0551645),
SMT-LIB Specification, PI.
Intel Corporation grant, 2006-07.
Equipment grant, PI.
Intel Corporation, 2006.
CAREER: Fast Provers for Extended Static Checking of Software, PI.
NSF grant #0237422,
- Modular Combination of Satisfiability Procedures, co-PI.
NSF Grant #9972311,
- 15th International Workshop on Unification, PI.
NSF Grant #0108548, 2001.